http://git-wip-us.apache.org/repos/asf/hbase-site/blob/526c7822/devapidocs/src-html/org/apache/hadoop/hbase/CellUtil.LastOnRowCell.html ---------------------------------------------------------------------- diff --git a/devapidocs/src-html/org/apache/hadoop/hbase/CellUtil.LastOnRowCell.html b/devapidocs/src-html/org/apache/hadoop/hbase/CellUtil.LastOnRowCell.html index 37288b5..a168ce2 100644 --- a/devapidocs/src-html/org/apache/hadoop/hbase/CellUtil.LastOnRowCell.html +++ b/devapidocs/src-html/org/apache/hadoop/hbase/CellUtil.LastOnRowCell.html @@ -468,7 +468,7 @@ <span class="sourceLineNo">460</span><a name="line.460"></a> <span class="sourceLineNo">461</span> public static boolean matchingRow(final Cell left, final byte[] buf) {<a name="line.461"></a> <span class="sourceLineNo">462</span> if (buf == null) {<a name="line.462"></a> -<span class="sourceLineNo">463</span> return left.getQualifierLength() == 0;<a name="line.463"></a> +<span class="sourceLineNo">463</span> return left.getRowLength() == 0;<a name="line.463"></a> <span class="sourceLineNo">464</span> }<a name="line.464"></a> <span class="sourceLineNo">465</span> return matchingRow(left, buf, 0, buf.length);<a name="line.465"></a> <span class="sourceLineNo">466</span> }<a name="line.466"></a>
http://git-wip-us.apache.org/repos/asf/hbase-site/blob/526c7822/devapidocs/src-html/org/apache/hadoop/hbase/CellUtil.LastOnRowColByteBufferedCell.html ---------------------------------------------------------------------- diff --git a/devapidocs/src-html/org/apache/hadoop/hbase/CellUtil.LastOnRowColByteBufferedCell.html b/devapidocs/src-html/org/apache/hadoop/hbase/CellUtil.LastOnRowColByteBufferedCell.html index 37288b5..a168ce2 100644 --- a/devapidocs/src-html/org/apache/hadoop/hbase/CellUtil.LastOnRowColByteBufferedCell.html +++ b/devapidocs/src-html/org/apache/hadoop/hbase/CellUtil.LastOnRowColByteBufferedCell.html @@ -468,7 +468,7 @@ <span class="sourceLineNo">460</span><a name="line.460"></a> <span class="sourceLineNo">461</span> public static boolean matchingRow(final Cell left, final byte[] buf) {<a name="line.461"></a> <span class="sourceLineNo">462</span> if (buf == null) {<a name="line.462"></a> -<span class="sourceLineNo">463</span> return left.getQualifierLength() == 0;<a name="line.463"></a> +<span class="sourceLineNo">463</span> return left.getRowLength() == 0;<a name="line.463"></a> <span class="sourceLineNo">464</span> }<a name="line.464"></a> <span class="sourceLineNo">465</span> return matchingRow(left, buf, 0, buf.length);<a name="line.465"></a> <span class="sourceLineNo">466</span> }<a name="line.466"></a> http://git-wip-us.apache.org/repos/asf/hbase-site/blob/526c7822/devapidocs/src-html/org/apache/hadoop/hbase/CellUtil.LastOnRowColCell.html ---------------------------------------------------------------------- diff --git a/devapidocs/src-html/org/apache/hadoop/hbase/CellUtil.LastOnRowColCell.html b/devapidocs/src-html/org/apache/hadoop/hbase/CellUtil.LastOnRowColCell.html index 37288b5..a168ce2 100644 --- a/devapidocs/src-html/org/apache/hadoop/hbase/CellUtil.LastOnRowColCell.html +++ b/devapidocs/src-html/org/apache/hadoop/hbase/CellUtil.LastOnRowColCell.html @@ -468,7 +468,7 @@ <span class="sourceLineNo">460</span><a name="line.460"></a> <span class="sourceLineNo">461</span> public static boolean matchingRow(final Cell left, final byte[] buf) {<a name="line.461"></a> <span class="sourceLineNo">462</span> if (buf == null) {<a name="line.462"></a> -<span class="sourceLineNo">463</span> return left.getQualifierLength() == 0;<a name="line.463"></a> +<span class="sourceLineNo">463</span> return left.getRowLength() == 0;<a name="line.463"></a> <span class="sourceLineNo">464</span> }<a name="line.464"></a> <span class="sourceLineNo">465</span> return matchingRow(left, buf, 0, buf.length);<a name="line.465"></a> <span class="sourceLineNo">466</span> }<a name="line.466"></a> http://git-wip-us.apache.org/repos/asf/hbase-site/blob/526c7822/devapidocs/src-html/org/apache/hadoop/hbase/CellUtil.html ---------------------------------------------------------------------- diff --git a/devapidocs/src-html/org/apache/hadoop/hbase/CellUtil.html b/devapidocs/src-html/org/apache/hadoop/hbase/CellUtil.html index 37288b5..a168ce2 100644 --- a/devapidocs/src-html/org/apache/hadoop/hbase/CellUtil.html +++ b/devapidocs/src-html/org/apache/hadoop/hbase/CellUtil.html @@ -468,7 +468,7 @@ <span class="sourceLineNo">460</span><a name="line.460"></a> <span class="sourceLineNo">461</span> public static boolean matchingRow(final Cell left, final byte[] buf) {<a name="line.461"></a> <span class="sourceLineNo">462</span> if (buf == null) {<a name="line.462"></a> -<span class="sourceLineNo">463</span> return left.getQualifierLength() == 0;<a name="line.463"></a> +<span class="sourceLineNo">463</span> return left.getRowLength() == 0;<a name="line.463"></a> <span class="sourceLineNo">464</span> }<a name="line.464"></a> <span class="sourceLineNo">465</span> return matchingRow(left, buf, 0, buf.length);<a name="line.465"></a> <span class="sourceLineNo">466</span> }<a name="line.466"></a> http://git-wip-us.apache.org/repos/asf/hbase-site/blob/526c7822/devapidocs/src-html/org/apache/hadoop/hbase/regionserver/AbstractMemStore.html ---------------------------------------------------------------------- diff --git a/devapidocs/src-html/org/apache/hadoop/hbase/regionserver/AbstractMemStore.html b/devapidocs/src-html/org/apache/hadoop/hbase/regionserver/AbstractMemStore.html new file mode 100644 index 0000000..7e80faa --- /dev/null +++ b/devapidocs/src-html/org/apache/hadoop/hbase/regionserver/AbstractMemStore.html @@ -0,0 +1,569 @@ +<!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> *<a name="line.2"></a> +<span class="sourceLineNo">003</span> * Licensed to the Apache Software Foundation (ASF) under one<a name="line.3"></a> +<span class="sourceLineNo">004</span> * or more contributor license agreements. See the NOTICE file<a name="line.4"></a> +<span class="sourceLineNo">005</span> * distributed with this work for additional information<a name="line.5"></a> +<span class="sourceLineNo">006</span> * regarding copyright ownership. The ASF licenses this file<a name="line.6"></a> +<span class="sourceLineNo">007</span> * to you under the Apache License, Version 2.0 (the<a name="line.7"></a> +<span class="sourceLineNo">008</span> * "License"); you may not use this file except in compliance<a name="line.8"></a> +<span class="sourceLineNo">009</span> * with the License. You may obtain a copy of the License at<a name="line.9"></a> +<span class="sourceLineNo">010</span> *<a name="line.10"></a> +<span class="sourceLineNo">011</span> * http://www.apache.org/licenses/LICENSE-2.0<a name="line.11"></a> +<span class="sourceLineNo">012</span> *<a name="line.12"></a> +<span class="sourceLineNo">013</span> * Unless required by applicable law or agreed to in writing, software<a name="line.13"></a> +<span class="sourceLineNo">014</span> * distributed under the License is distributed on an "AS IS" BASIS,<a name="line.14"></a> +<span class="sourceLineNo">015</span> * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.<a name="line.15"></a> +<span class="sourceLineNo">016</span> * See the License for the specific language governing permissions and<a name="line.16"></a> +<span class="sourceLineNo">017</span> * limitations under the License.<a name="line.17"></a> +<span class="sourceLineNo">018</span> */<a name="line.18"></a> +<span class="sourceLineNo">019</span>package org.apache.hadoop.hbase.regionserver;<a name="line.19"></a> +<span class="sourceLineNo">020</span><a name="line.20"></a> +<span class="sourceLineNo">021</span>import com.google.common.annotations.VisibleForTesting;<a name="line.21"></a> +<span class="sourceLineNo">022</span>import java.io.IOException;<a name="line.22"></a> +<span class="sourceLineNo">023</span>import java.util.ArrayList;<a name="line.23"></a> +<span class="sourceLineNo">024</span>import java.util.Collections;<a name="line.24"></a> +<span class="sourceLineNo">025</span>import java.util.Iterator;<a name="line.25"></a> +<span class="sourceLineNo">026</span>import java.util.List;<a name="line.26"></a> +<span class="sourceLineNo">027</span>import java.util.NavigableSet;<a name="line.27"></a> +<span class="sourceLineNo">028</span>import java.util.SortedSet;<a name="line.28"></a> +<span class="sourceLineNo">029</span><a name="line.29"></a> +<span class="sourceLineNo">030</span>import org.apache.commons.logging.Log;<a name="line.30"></a> +<span class="sourceLineNo">031</span>import org.apache.hadoop.conf.Configuration;<a name="line.31"></a> +<span class="sourceLineNo">032</span>import org.apache.hadoop.hbase.Cell;<a name="line.32"></a> +<span class="sourceLineNo">033</span>import org.apache.hadoop.hbase.CellComparator;<a name="line.33"></a> +<span class="sourceLineNo">034</span>import org.apache.hadoop.hbase.CellUtil;<a name="line.34"></a> +<span class="sourceLineNo">035</span>import org.apache.hadoop.hbase.KeyValue;<a name="line.35"></a> +<span class="sourceLineNo">036</span>import org.apache.hadoop.hbase.KeyValueUtil;<a name="line.36"></a> +<span class="sourceLineNo">037</span>import org.apache.hadoop.hbase.classification.InterfaceAudience;<a name="line.37"></a> +<span class="sourceLineNo">038</span>import org.apache.hadoop.hbase.util.Bytes;<a name="line.38"></a> +<span class="sourceLineNo">039</span>import org.apache.hadoop.hbase.util.ClassSize;<a name="line.39"></a> +<span class="sourceLineNo">040</span>import org.apache.hadoop.hbase.util.EnvironmentEdgeManager;<a name="line.40"></a> +<span class="sourceLineNo">041</span><a name="line.41"></a> +<span class="sourceLineNo">042</span>/**<a name="line.42"></a> +<span class="sourceLineNo">043</span> * An abstract class, which implements the behaviour shared by all concrete memstore instances.<a name="line.43"></a> +<span class="sourceLineNo">044</span> */<a name="line.44"></a> +<span class="sourceLineNo">045</span>@InterfaceAudience.Private<a name="line.45"></a> +<span class="sourceLineNo">046</span>public abstract class AbstractMemStore implements MemStore {<a name="line.46"></a> +<span class="sourceLineNo">047</span><a name="line.47"></a> +<span class="sourceLineNo">048</span> private static final long NO_SNAPSHOT_ID = -1;<a name="line.48"></a> +<span class="sourceLineNo">049</span><a name="line.49"></a> +<span class="sourceLineNo">050</span> private final Configuration conf;<a name="line.50"></a> +<span class="sourceLineNo">051</span> private final CellComparator comparator;<a name="line.51"></a> +<span class="sourceLineNo">052</span><a name="line.52"></a> +<span class="sourceLineNo">053</span> // active segment absorbs write operations<a name="line.53"></a> +<span class="sourceLineNo">054</span> private volatile MutableSegment active;<a name="line.54"></a> +<span class="sourceLineNo">055</span> // Snapshot of memstore. Made for flusher.<a name="line.55"></a> +<span class="sourceLineNo">056</span> private volatile ImmutableSegment snapshot;<a name="line.56"></a> +<span class="sourceLineNo">057</span> protected volatile long snapshotId;<a name="line.57"></a> +<span class="sourceLineNo">058</span> // Used to track when to flush<a name="line.58"></a> +<span class="sourceLineNo">059</span> private volatile long timeOfOldestEdit;<a name="line.59"></a> +<span class="sourceLineNo">060</span><a name="line.60"></a> +<span class="sourceLineNo">061</span> public final static long FIXED_OVERHEAD = ClassSize.align(<a name="line.61"></a> +<span class="sourceLineNo">062</span> ClassSize.OBJECT +<a name="line.62"></a> +<span class="sourceLineNo">063</span> (4 * ClassSize.REFERENCE) +<a name="line.63"></a> +<span class="sourceLineNo">064</span> (2 * Bytes.SIZEOF_LONG));<a name="line.64"></a> +<span class="sourceLineNo">065</span><a name="line.65"></a> +<span class="sourceLineNo">066</span> public final static long DEEP_OVERHEAD = ClassSize.align(FIXED_OVERHEAD +<a name="line.66"></a> +<span class="sourceLineNo">067</span> 2 * (ClassSize.ATOMIC_LONG + ClassSize.TIMERANGE_TRACKER +<a name="line.67"></a> +<span class="sourceLineNo">068</span> ClassSize.CELL_SKIPLIST_SET + ClassSize.CONCURRENT_SKIPLISTMAP));<a name="line.68"></a> +<span class="sourceLineNo">069</span><a name="line.69"></a> +<span class="sourceLineNo">070</span><a name="line.70"></a> +<span class="sourceLineNo">071</span> protected AbstractMemStore(final Configuration conf, final CellComparator c) {<a name="line.71"></a> +<span class="sourceLineNo">072</span> this.conf = conf;<a name="line.72"></a> +<span class="sourceLineNo">073</span> this.comparator = c;<a name="line.73"></a> +<span class="sourceLineNo">074</span> resetCellSet();<a name="line.74"></a> +<span class="sourceLineNo">075</span> this.snapshot = SegmentFactory.instance().createImmutableSegment(conf, c, 0);<a name="line.75"></a> +<span class="sourceLineNo">076</span> this.snapshotId = NO_SNAPSHOT_ID;<a name="line.76"></a> +<span class="sourceLineNo">077</span> }<a name="line.77"></a> +<span class="sourceLineNo">078</span><a name="line.78"></a> +<span class="sourceLineNo">079</span> protected void resetCellSet() {<a name="line.79"></a> +<span class="sourceLineNo">080</span> // Reset heap to not include any keys<a name="line.80"></a> +<span class="sourceLineNo">081</span> this.active = SegmentFactory.instance().createMutableSegment(<a name="line.81"></a> +<span class="sourceLineNo">082</span> conf, comparator, DEEP_OVERHEAD);<a name="line.82"></a> +<span class="sourceLineNo">083</span> this.timeOfOldestEdit = Long.MAX_VALUE;<a name="line.83"></a> +<span class="sourceLineNo">084</span> }<a name="line.84"></a> +<span class="sourceLineNo">085</span><a name="line.85"></a> +<span class="sourceLineNo">086</span> /*<a name="line.86"></a> +<span class="sourceLineNo">087</span> * Calculate how the MemStore size has changed. Includes overhead of the<a name="line.87"></a> +<span class="sourceLineNo">088</span> * backing Map.<a name="line.88"></a> +<span class="sourceLineNo">089</span> * @param cell<a name="line.89"></a> +<span class="sourceLineNo">090</span> * @param notPresent True if the cell was NOT present in the set.<a name="line.90"></a> +<span class="sourceLineNo">091</span> * @return change in size<a name="line.91"></a> +<span class="sourceLineNo">092</span> */<a name="line.92"></a> +<span class="sourceLineNo">093</span> static long heapSizeChange(final Cell cell, final boolean notPresent) {<a name="line.93"></a> +<span class="sourceLineNo">094</span> return notPresent ? ClassSize.align(ClassSize.CONCURRENT_SKIPLISTMAP_ENTRY<a name="line.94"></a> +<span class="sourceLineNo">095</span> + CellUtil.estimatedHeapSizeOf(cell)) : 0;<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> /**<a name="line.98"></a> +<span class="sourceLineNo">099</span> * Updates the wal with the lowest sequence id (oldest entry) that is still in memory<a name="line.99"></a> +<span class="sourceLineNo">100</span> * @param onlyIfMoreRecent a flag that marks whether to update the sequence id no matter what or<a name="line.100"></a> +<span class="sourceLineNo">101</span> * only if it is greater than the previous sequence id<a name="line.101"></a> +<span class="sourceLineNo">102</span> */<a name="line.102"></a> +<span class="sourceLineNo">103</span> public abstract void updateLowestUnflushedSequenceIdInWal(boolean onlyIfMoreRecent);<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> * Write an update<a name="line.106"></a> +<span class="sourceLineNo">107</span> * @param cell the cell to be added<a name="line.107"></a> +<span class="sourceLineNo">108</span> * @return approximate size of the passed cell & newly added cell which maybe different than the<a name="line.108"></a> +<span class="sourceLineNo">109</span> * passed-in cell<a name="line.109"></a> +<span class="sourceLineNo">110</span> */<a name="line.110"></a> +<span class="sourceLineNo">111</span> @Override<a name="line.111"></a> +<span class="sourceLineNo">112</span> public long add(Cell cell) {<a name="line.112"></a> +<span class="sourceLineNo">113</span> Cell toAdd = maybeCloneWithAllocator(cell);<a name="line.113"></a> +<span class="sourceLineNo">114</span> return internalAdd(toAdd);<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> /**<a name="line.117"></a> +<span class="sourceLineNo">118</span> * Update or insert the specified Cells.<a name="line.118"></a> +<span class="sourceLineNo">119</span> * <p><a name="line.119"></a> +<span class="sourceLineNo">120</span> * For each Cell, insert into MemStore. This will atomically upsert the<a name="line.120"></a> +<span class="sourceLineNo">121</span> * value for that row/family/qualifier. If a Cell did already exist,<a name="line.121"></a> +<span class="sourceLineNo">122</span> * it will then be removed.<a name="line.122"></a> +<span class="sourceLineNo">123</span> * <p><a name="line.123"></a> +<span class="sourceLineNo">124</span> * Currently the memstoreTS is kept at 0 so as each insert happens, it will<a name="line.124"></a> +<span class="sourceLineNo">125</span> * be immediately visible. May want to change this so it is atomic across<a name="line.125"></a> +<span class="sourceLineNo">126</span> * all Cells.<a name="line.126"></a> +<span class="sourceLineNo">127</span> * <p><a name="line.127"></a> +<span class="sourceLineNo">128</span> * This is called under row lock, so Get operations will still see updates<a name="line.128"></a> +<span class="sourceLineNo">129</span> * atomically. Scans will only see each Cell update as atomic.<a name="line.129"></a> +<span class="sourceLineNo">130</span> *<a name="line.130"></a> +<span class="sourceLineNo">131</span> * @param cells the cells to be updated<a name="line.131"></a> +<span class="sourceLineNo">132</span> * @param readpoint readpoint below which we can safely remove duplicate KVs<a name="line.132"></a> +<span class="sourceLineNo">133</span> * @return change in memstore size<a name="line.133"></a> +<span class="sourceLineNo">134</span> */<a name="line.134"></a> +<span class="sourceLineNo">135</span> @Override<a name="line.135"></a> +<span class="sourceLineNo">136</span> public long upsert(Iterable<Cell> cells, long readpoint) {<a name="line.136"></a> +<span class="sourceLineNo">137</span> long size = 0;<a name="line.137"></a> +<span class="sourceLineNo">138</span> for (Cell cell : cells) {<a name="line.138"></a> +<span class="sourceLineNo">139</span> size += upsert(cell, readpoint);<a name="line.139"></a> +<span class="sourceLineNo">140</span> }<a name="line.140"></a> +<span class="sourceLineNo">141</span> return size;<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> /**<a name="line.144"></a> +<span class="sourceLineNo">145</span> * @return Oldest timestamp of all the Cells in the MemStore<a name="line.145"></a> +<span class="sourceLineNo">146</span> */<a name="line.146"></a> +<span class="sourceLineNo">147</span> @Override<a name="line.147"></a> +<span class="sourceLineNo">148</span> public long timeOfOldestEdit() {<a name="line.148"></a> +<span class="sourceLineNo">149</span> return timeOfOldestEdit;<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><a name="line.152"></a> +<span class="sourceLineNo">153</span> /**<a name="line.153"></a> +<span class="sourceLineNo">154</span> * Write a delete<a name="line.154"></a> +<span class="sourceLineNo">155</span> * @param deleteCell the cell to be deleted<a name="line.155"></a> +<span class="sourceLineNo">156</span> * @return approximate size of the passed key and value.<a name="line.156"></a> +<span class="sourceLineNo">157</span> */<a name="line.157"></a> +<span class="sourceLineNo">158</span> @Override<a name="line.158"></a> +<span class="sourceLineNo">159</span> public long delete(Cell deleteCell) {<a name="line.159"></a> +<span class="sourceLineNo">160</span> Cell toAdd = maybeCloneWithAllocator(deleteCell);<a name="line.160"></a> +<span class="sourceLineNo">161</span> long s = internalAdd(toAdd);<a name="line.161"></a> +<span class="sourceLineNo">162</span> return s;<a name="line.162"></a> +<span class="sourceLineNo">163</span> }<a name="line.163"></a> +<span class="sourceLineNo">164</span><a name="line.164"></a> +<span class="sourceLineNo">165</span> /**<a name="line.165"></a> +<span class="sourceLineNo">166</span> * An override on snapshot so the no arg version of the method implies zero seq num,<a name="line.166"></a> +<span class="sourceLineNo">167</span> * like for cases without wal<a name="line.167"></a> +<span class="sourceLineNo">168</span> */<a name="line.168"></a> +<span class="sourceLineNo">169</span> public MemStoreSnapshot snapshot() {<a name="line.169"></a> +<span class="sourceLineNo">170</span> return snapshot(0);<a name="line.170"></a> +<span class="sourceLineNo">171</span> }<a name="line.171"></a> +<span class="sourceLineNo">172</span><a name="line.172"></a> +<span class="sourceLineNo">173</span> /**<a name="line.173"></a> +<span class="sourceLineNo">174</span> * The passed snapshot was successfully persisted; it can be let go.<a name="line.174"></a> +<span class="sourceLineNo">175</span> * @param id Id of the snapshot to clean out.<a name="line.175"></a> +<span class="sourceLineNo">176</span> * @see MemStore#snapshot(long)<a name="line.176"></a> +<span class="sourceLineNo">177</span> */<a name="line.177"></a> +<span class="sourceLineNo">178</span> @Override<a name="line.178"></a> +<span class="sourceLineNo">179</span> public void clearSnapshot(long id) throws UnexpectedStateException {<a name="line.179"></a> +<span class="sourceLineNo">180</span> if (this.snapshotId != id) {<a name="line.180"></a> +<span class="sourceLineNo">181</span> throw new UnexpectedStateException("Current snapshot id is " + this.snapshotId + ",passed "<a name="line.181"></a> +<span class="sourceLineNo">182</span> + id);<a name="line.182"></a> +<span class="sourceLineNo">183</span> }<a name="line.183"></a> +<span class="sourceLineNo">184</span> // OK. Passed in snapshot is same as current snapshot. If not-empty,<a name="line.184"></a> +<span class="sourceLineNo">185</span> // create a new snapshot and let the old one go.<a name="line.185"></a> +<span class="sourceLineNo">186</span> Segment oldSnapshot = this.snapshot;<a name="line.186"></a> +<span class="sourceLineNo">187</span> if (!this.snapshot.isEmpty()) {<a name="line.187"></a> +<span class="sourceLineNo">188</span> this.snapshot = SegmentFactory.instance().createImmutableSegment(<a name="line.188"></a> +<span class="sourceLineNo">189</span> getComparator(), 0);<a name="line.189"></a> +<span class="sourceLineNo">190</span> }<a name="line.190"></a> +<span class="sourceLineNo">191</span> this.snapshotId = NO_SNAPSHOT_ID;<a name="line.191"></a> +<span class="sourceLineNo">192</span> oldSnapshot.close();<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> * Get the entire heap usage for this MemStore not including keys in the<a name="line.196"></a> +<span class="sourceLineNo">197</span> * snapshot.<a name="line.197"></a> +<span class="sourceLineNo">198</span> */<a name="line.198"></a> +<span class="sourceLineNo">199</span> @Override<a name="line.199"></a> +<span class="sourceLineNo">200</span> public long heapSize() {<a name="line.200"></a> +<span class="sourceLineNo">201</span> return getActive().getSize();<a name="line.201"></a> +<span class="sourceLineNo">202</span> }<a name="line.202"></a> +<span class="sourceLineNo">203</span><a name="line.203"></a> +<span class="sourceLineNo">204</span> /**<a name="line.204"></a> +<span class="sourceLineNo">205</span> * On flush, how much memory we will clear from the active cell set.<a name="line.205"></a> +<span class="sourceLineNo">206</span> *<a name="line.206"></a> +<span class="sourceLineNo">207</span> * @return size of data that is going to be flushed from active set<a name="line.207"></a> +<span class="sourceLineNo">208</span> */<a name="line.208"></a> +<span class="sourceLineNo">209</span> @Override<a name="line.209"></a> +<span class="sourceLineNo">210</span> public long getFlushableSize() {<a name="line.210"></a> +<span class="sourceLineNo">211</span> long snapshotSize = getSnapshot().getSize();<a name="line.211"></a> +<span class="sourceLineNo">212</span> return snapshotSize > 0 ? snapshotSize : keySize();<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><a name="line.215"></a> +<span class="sourceLineNo">216</span> /**<a name="line.216"></a> +<span class="sourceLineNo">217</span> * @return a list containing a single memstore scanner.<a name="line.217"></a> +<span class="sourceLineNo">218</span> */<a name="line.218"></a> +<span class="sourceLineNo">219</span> @Override<a name="line.219"></a> +<span class="sourceLineNo">220</span> public List<KeyValueScanner> getScanners(long readPt) throws IOException {<a name="line.220"></a> +<span class="sourceLineNo">221</span> return Collections.<KeyValueScanner> singletonList(new MemStoreScanner(this, readPt));<a name="line.221"></a> +<span class="sourceLineNo">222</span> }<a name="line.222"></a> +<span class="sourceLineNo">223</span><a name="line.223"></a> +<span class="sourceLineNo">224</span> @Override<a name="line.224"></a> +<span class="sourceLineNo">225</span> public long getSnapshotSize() {<a name="line.225"></a> +<span class="sourceLineNo">226</span> return getSnapshot().getSize();<a name="line.226"></a> +<span class="sourceLineNo">227</span> }<a name="line.227"></a> +<span class="sourceLineNo">228</span><a name="line.228"></a> +<span class="sourceLineNo">229</span> @Override<a name="line.229"></a> +<span class="sourceLineNo">230</span> public String toString() {<a name="line.230"></a> +<span class="sourceLineNo">231</span> StringBuffer buf = new StringBuffer();<a name="line.231"></a> +<span class="sourceLineNo">232</span> int i = 1;<a name="line.232"></a> +<span class="sourceLineNo">233</span> try {<a name="line.233"></a> +<span class="sourceLineNo">234</span> for (Segment segment : getListOfSegments()) {<a name="line.234"></a> +<span class="sourceLineNo">235</span> buf.append("Segment (" + i + ") " + segment.toString() + "; ");<a name="line.235"></a> +<span class="sourceLineNo">236</span> i++;<a name="line.236"></a> +<span class="sourceLineNo">237</span> }<a name="line.237"></a> +<span class="sourceLineNo">238</span> } catch (IOException e){<a name="line.238"></a> +<span class="sourceLineNo">239</span> return e.toString();<a name="line.239"></a> +<span class="sourceLineNo">240</span> }<a name="line.240"></a> +<span class="sourceLineNo">241</span> return buf.toString();<a name="line.241"></a> +<span class="sourceLineNo">242</span> }<a name="line.242"></a> +<span class="sourceLineNo">243</span><a name="line.243"></a> +<span class="sourceLineNo">244</span> protected void rollbackInSnapshot(Cell cell) {<a name="line.244"></a> +<span class="sourceLineNo">245</span> // If the key is in the snapshot, delete it. We should not update<a name="line.245"></a> +<span class="sourceLineNo">246</span> // this.size, because that tracks the size of only the memstore and<a name="line.246"></a> +<span class="sourceLineNo">247</span> // not the snapshot. The flush of this snapshot to disk has not<a name="line.247"></a> +<span class="sourceLineNo">248</span> // yet started because Store.flush() waits for all rwcc transactions to<a name="line.248"></a> +<span class="sourceLineNo">249</span> // commit before starting the flush to disk.<a name="line.249"></a> +<span class="sourceLineNo">250</span> snapshot.rollback(cell);<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> protected void rollbackInActive(Cell cell) {<a name="line.253"></a> +<span class="sourceLineNo">254</span> // If the key is in the memstore, delete it. Update this.size.<a name="line.254"></a> +<span class="sourceLineNo">255</span> long sz = active.rollback(cell);<a name="line.255"></a> +<span class="sourceLineNo">256</span> if (sz != 0) {<a name="line.256"></a> +<span class="sourceLineNo">257</span> setOldestEditTimeToNow();<a name="line.257"></a> +<span class="sourceLineNo">258</span> }<a name="line.258"></a> +<span class="sourceLineNo">259</span> }<a name="line.259"></a> +<span class="sourceLineNo">260</span><a name="line.260"></a> +<span class="sourceLineNo">261</span> protected Configuration getConfiguration() {<a name="line.261"></a> +<span class="sourceLineNo">262</span> return conf;<a name="line.262"></a> +<span class="sourceLineNo">263</span> }<a name="line.263"></a> +<span class="sourceLineNo">264</span><a name="line.264"></a> +<span class="sourceLineNo">265</span> protected void dump(Log log) {<a name="line.265"></a> +<span class="sourceLineNo">266</span> active.dump(log);<a name="line.266"></a> +<span class="sourceLineNo">267</span> snapshot.dump(log);<a name="line.267"></a> +<span class="sourceLineNo">268</span> }<a name="line.268"></a> +<span class="sourceLineNo">269</span><a name="line.269"></a> +<span class="sourceLineNo">270</span><a name="line.270"></a> +<span class="sourceLineNo">271</span> /**<a name="line.271"></a> +<span class="sourceLineNo">272</span> * Inserts the specified Cell into MemStore and deletes any existing<a name="line.272"></a> +<span class="sourceLineNo">273</span> * versions of the same row/family/qualifier as the specified Cell.<a name="line.273"></a> +<span class="sourceLineNo">274</span> * <p><a name="line.274"></a> +<span class="sourceLineNo">275</span> * First, the specified Cell is inserted into the Memstore.<a name="line.275"></a> +<span class="sourceLineNo">276</span> * <p><a name="line.276"></a> +<span class="sourceLineNo">277</span> * If there are any existing Cell in this MemStore with the same row,<a name="line.277"></a> +<span class="sourceLineNo">278</span> * family, and qualifier, they are removed.<a name="line.278"></a> +<span class="sourceLineNo">279</span> * <p><a name="line.279"></a> +<span class="sourceLineNo">280</span> * Callers must hold the read lock.<a name="line.280"></a> +<span class="sourceLineNo">281</span> *<a name="line.281"></a> +<span class="sourceLineNo">282</span> * @param cell the cell to be updated<a name="line.282"></a> +<span class="sourceLineNo">283</span> * @param readpoint readpoint below which we can safely remove duplicate KVs<a name="line.283"></a> +<span class="sourceLineNo">284</span> * @return change in size of MemStore<a name="line.284"></a> +<span class="sourceLineNo">285</span> */<a name="line.285"></a> +<span class="sourceLineNo">286</span> private long upsert(Cell cell, long readpoint) {<a name="line.286"></a> +<span class="sourceLineNo">287</span> // Add the Cell to the MemStore<a name="line.287"></a> +<span class="sourceLineNo">288</span> // Use the internalAdd method here since we (a) already have a lock<a name="line.288"></a> +<span class="sourceLineNo">289</span> // and (b) cannot safely use the MSLAB here without potentially<a name="line.289"></a> +<span class="sourceLineNo">290</span> // hitting OOME - see TestMemStore.testUpsertMSLAB for a<a name="line.290"></a> +<span class="sourceLineNo">291</span> // test that triggers the pathological case if we don't avoid MSLAB<a name="line.291"></a> +<span class="sourceLineNo">292</span> // here.<a name="line.292"></a> +<span class="sourceLineNo">293</span> long addedSize = internalAdd(cell);<a name="line.293"></a> +<span class="sourceLineNo">294</span><a name="line.294"></a> +<span class="sourceLineNo">295</span> // Get the Cells for the row/family/qualifier regardless of timestamp.<a name="line.295"></a> +<span class="sourceLineNo">296</span> // For this case we want to clean up any other puts<a name="line.296"></a> +<span class="sourceLineNo">297</span> Cell firstCell = KeyValueUtil.createFirstOnRow(<a name="line.297"></a> +<span class="sourceLineNo">298</span> cell.getRowArray(), cell.getRowOffset(), cell.getRowLength(),<a name="line.298"></a> +<span class="sourceLineNo">299</span> cell.getFamilyArray(), cell.getFamilyOffset(), cell.getFamilyLength(),<a name="line.299"></a> +<span class="sourceLineNo">300</span> cell.getQualifierArray(), cell.getQualifierOffset(), cell.getQualifierLength());<a name="line.300"></a> +<span class="sourceLineNo">301</span> SortedSet<Cell> ss = active.tailSet(firstCell);<a name="line.301"></a> +<span class="sourceLineNo">302</span> Iterator<Cell> it = ss.iterator();<a name="line.302"></a> +<span class="sourceLineNo">303</span> // versions visible to oldest scanner<a name="line.303"></a> +<span class="sourceLineNo">304</span> int versionsVisible = 0;<a name="line.304"></a> +<span class="sourceLineNo">305</span> while (it.hasNext()) {<a name="line.305"></a> +<span class="sourceLineNo">306</span> Cell cur = it.next();<a name="line.306"></a> +<span class="sourceLineNo">307</span><a name="line.307"></a> +<span class="sourceLineNo">308</span> if (cell == cur) {<a name="line.308"></a> +<span class="sourceLineNo">309</span> // ignore the one just put in<a name="line.309"></a> +<span class="sourceLineNo">310</span> continue;<a name="line.310"></a> +<span class="sourceLineNo">311</span> }<a name="line.311"></a> +<span class="sourceLineNo">312</span> // check that this is the row and column we are interested in, otherwise bail<a name="line.312"></a> +<span class="sourceLineNo">313</span> if (CellUtil.matchingRow(cell, cur) && CellUtil.matchingQualifier(cell, cur)) {<a name="line.313"></a> +<span class="sourceLineNo">314</span> // only remove Puts that concurrent scanners cannot possibly see<a name="line.314"></a> +<span class="sourceLineNo">315</span> if (cur.getTypeByte() == KeyValue.Type.Put.getCode() &&<a name="line.315"></a> +<span class="sourceLineNo">316</span> cur.getSequenceId() <= readpoint) {<a name="line.316"></a> +<span class="sourceLineNo">317</span> if (versionsVisible >= 1) {<a name="line.317"></a> +<span class="sourceLineNo">318</span> // if we get here we have seen at least one version visible to the oldest scanner,<a name="line.318"></a> +<span class="sourceLineNo">319</span> // which means we can prove that no scanner will see this version<a name="line.319"></a> +<span class="sourceLineNo">320</span><a name="line.320"></a> +<span class="sourceLineNo">321</span> // false means there was a change, so give us the size.<a name="line.321"></a> +<span class="sourceLineNo">322</span> long delta = heapSizeChange(cur, true);<a name="line.322"></a> +<span class="sourceLineNo">323</span> addedSize -= delta;<a name="line.323"></a> +<span class="sourceLineNo">324</span> active.incSize(-delta);<a name="line.324"></a> +<span class="sourceLineNo">325</span> it.remove();<a name="line.325"></a> +<span class="sourceLineNo">326</span> setOldestEditTimeToNow();<a name="line.326"></a> +<span class="sourceLineNo">327</span> } else {<a name="line.327"></a> +<span class="sourceLineNo">328</span> versionsVisible++;<a name="line.328"></a> +<span class="sourceLineNo">329</span> }<a name="line.329"></a> +<span class="sourceLineNo">330</span> }<a name="line.330"></a> +<span class="sourceLineNo">331</span> } else {<a name="line.331"></a> +<span class="sourceLineNo">332</span> // past the row or column, done<a name="line.332"></a> +<span class="sourceLineNo">333</span> break;<a name="line.333"></a> +<span class="sourceLineNo">334</span> }<a name="line.334"></a> +<span class="sourceLineNo">335</span> }<a name="line.335"></a> +<span class="sourceLineNo">336</span> return addedSize;<a name="line.336"></a> +<span class="sourceLineNo">337</span> }<a name="line.337"></a> +<span class="sourceLineNo">338</span><a name="line.338"></a> +<span class="sourceLineNo">339</span> /*<a name="line.339"></a> +<span class="sourceLineNo">340</span> * @param a<a name="line.340"></a> +<span class="sourceLineNo">341</span> * @param b<a name="line.341"></a> +<span class="sourceLineNo">342</span> * @return Return lowest of a or b or null if both a and b are null<a name="line.342"></a> +<span class="sourceLineNo">343</span> */<a name="line.343"></a> +<span class="sourceLineNo">344</span> protected Cell getLowest(final Cell a, final Cell b) {<a name="line.344"></a> +<span class="sourceLineNo">345</span> if (a == null) {<a name="line.345"></a> +<span class="sourceLineNo">346</span> return b;<a name="line.346"></a> +<span class="sourceLineNo">347</span> }<a name="line.347"></a> +<span class="sourceLineNo">348</span> if (b == null) {<a name="line.348"></a> +<span class="sourceLineNo">349</span> return a;<a name="line.349"></a> +<span class="sourceLineNo">350</span> }<a name="line.350"></a> +<span class="sourceLineNo">351</span> return comparator.compareRows(a, b) <= 0? a: b;<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> /*<a name="line.354"></a> +<span class="sourceLineNo">355</span> * @param key Find row that follows this one. If null, return first.<a name="line.355"></a> +<span class="sourceLineNo">356</span> * @param set Set to look in for a row beyond <code>row</code>.<a name="line.356"></a> +<span class="sourceLineNo">357</span> * @return Next row or null if none found. If one found, will be a new<a name="line.357"></a> +<span class="sourceLineNo">358</span> * KeyValue -- can be destroyed by subsequent calls to this method.<a name="line.358"></a> +<span class="sourceLineNo">359</span> */<a name="line.359"></a> +<span class="sourceLineNo">360</span> protected Cell getNextRow(final Cell key,<a name="line.360"></a> +<span class="sourceLineNo">361</span> final NavigableSet<Cell> set) {<a name="line.361"></a> +<span class="sourceLineNo">362</span> Cell result = null;<a name="line.362"></a> +<span class="sourceLineNo">363</span> SortedSet<Cell> tail = key == null? set: set.tailSet(key);<a name="line.363"></a> +<span class="sourceLineNo">364</span> // Iterate until we fall into the next row; i.e. move off current row<a name="line.364"></a> +<span class="sourceLineNo">365</span> for (Cell cell: tail) {<a name="line.365"></a> +<span class="sourceLineNo">366</span> if (comparator.compareRows(cell, key) <= 0) {<a name="line.366"></a> +<span class="sourceLineNo">367</span> continue;<a name="line.367"></a> +<span class="sourceLineNo">368</span> }<a name="line.368"></a> +<span class="sourceLineNo">369</span> // Note: Not suppressing deletes or expired cells. Needs to be handled<a name="line.369"></a> +<span class="sourceLineNo">370</span> // by higher up functions.<a name="line.370"></a> +<span class="sourceLineNo">371</span> result = cell;<a name="line.371"></a> +<span class="sourceLineNo">372</span> break;<a name="line.372"></a> +<span class="sourceLineNo">373</span> }<a name="line.373"></a> +<span class="sourceLineNo">374</span> return result;<a name="line.374"></a> +<span class="sourceLineNo">375</span> }<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> * Given the specs of a column, update it, first by inserting a new record,<a name="line.378"></a> +<span class="sourceLineNo">379</span> * then removing the old one. Since there is only 1 KeyValue involved, the memstoreTS<a name="line.379"></a> +<span class="sourceLineNo">380</span> * will be set to 0, thus ensuring that they instantly appear to anyone. The underlying<a name="line.380"></a> +<span class="sourceLineNo">381</span> * store will ensure that the insert/delete each are atomic. A scanner/reader will either<a name="line.381"></a> +<span class="sourceLineNo">382</span> * get the new value, or the old value and all readers will eventually only see the new<a name="line.382"></a> +<span class="sourceLineNo">383</span> * value after the old was removed.<a name="line.383"></a> +<span class="sourceLineNo">384</span> */<a name="line.384"></a> +<span class="sourceLineNo">385</span> @VisibleForTesting<a name="line.385"></a> +<span class="sourceLineNo">386</span> @Override<a name="line.386"></a> +<span class="sourceLineNo">387</span> public long updateColumnValue(byte[] row, byte[] family, byte[] qualifier,<a name="line.387"></a> +<span class="sourceLineNo">388</span> long newValue, long now) {<a name="line.388"></a> +<span class="sourceLineNo">389</span> Cell firstCell = KeyValueUtil.createFirstOnRow(row, family, qualifier);<a name="line.389"></a> +<span class="sourceLineNo">390</span> // Is there a Cell in 'snapshot' with the same TS? If so, upgrade the timestamp a bit.<a name="line.390"></a> +<span class="sourceLineNo">391</span> Cell snc = snapshot.getFirstAfter(firstCell);<a name="line.391"></a> +<span class="sourceLineNo">392</span> if(snc != null) {<a name="line.392"></a> +<span class="sourceLineNo">393</span> // is there a matching Cell in the snapshot?<a name="line.393"></a> +<span class="sourceLineNo">394</span> if (CellUtil.matchingRow(snc, firstCell) && CellUtil.matchingQualifier(snc, firstCell)) {<a name="line.394"></a> +<span class="sourceLineNo">395</span> if (snc.getTimestamp() == now) {<a name="line.395"></a> +<span class="sourceLineNo">396</span> now += 1;<a name="line.396"></a> +<span class="sourceLineNo">397</span> }<a name="line.397"></a> +<span class="sourceLineNo">398</span> }<a name="line.398"></a> +<span class="sourceLineNo">399</span> }<a name="line.399"></a> +<span class="sourceLineNo">400</span> // logic here: the new ts MUST be at least 'now'. But it could be larger if necessary.<a name="line.400"></a> +<span class="sourceLineNo">401</span> // But the timestamp should also be max(now, mostRecentTsInMemstore)<a name="line.401"></a> +<span class="sourceLineNo">402</span><a name="line.402"></a> +<span class="sourceLineNo">403</span> // so we cant add the new Cell w/o knowing what's there already, but we also<a name="line.403"></a> +<span class="sourceLineNo">404</span> // want to take this chance to delete some cells. So two loops (sad)<a name="line.404"></a> +<span class="sourceLineNo">405</span><a name="line.405"></a> +<span class="sourceLineNo">406</span> SortedSet<Cell> ss = getActive().tailSet(firstCell);<a name="line.406"></a> +<span class="sourceLineNo">407</span> for (Cell cell : ss) {<a name="line.407"></a> +<span class="sourceLineNo">408</span> // if this isnt the row we are interested in, then bail:<a name="line.408"></a> +<span class="sourceLineNo">409</span> if (!CellUtil.matchingColumn(cell, family, qualifier)<a name="line.409"></a> +<span class="sourceLineNo">410</span> || !CellUtil.matchingRow(cell, firstCell)) {<a name="line.410"></a> +<span class="sourceLineNo">411</span> break; // rows dont match, bail.<a name="line.411"></a> +<span class="sourceLineNo">412</span> }<a name="line.412"></a> +<span class="sourceLineNo">413</span><a name="line.413"></a> +<span class="sourceLineNo">414</span> // if the qualifier matches and it's a put, just RM it out of the active.<a name="line.414"></a> +<span class="sourceLineNo">415</span> if (cell.getTypeByte() == KeyValue.Type.Put.getCode() &&<a name="line.415"></a> +<span class="sourceLineNo">416</span> cell.getTimestamp() > now && CellUtil.matchingQualifier(firstCell, cell)) {<a name="line.416"></a> +<span class="sourceLineNo">417</span> now = cell.getTimestamp();<a name="line.417"></a> +<span class="sourceLineNo">418</span> }<a name="line.418"></a> +<span class="sourceLineNo">419</span> }<a name="line.419"></a> +<span class="sourceLineNo">420</span><a name="line.420"></a> +<span class="sourceLineNo">421</span> // create or update (upsert) a new Cell with<a name="line.421"></a> +<span class="sourceLineNo">422</span> // 'now' and a 0 memstoreTS == immediately visible<a name="line.422"></a> +<span class="sourceLineNo">423</span> List<Cell> cells = new ArrayList<Cell>(1);<a name="line.423"></a> +<span class="sourceLineNo">424</span> cells.add(new KeyValue(row, family, qualifier, now, Bytes.toBytes(newValue)));<a name="line.424"></a> +<span class="sourceLineNo">425</span> return upsert(cells, 1L);<a name="line.425"></a> +<span class="sourceLineNo">426</span> }<a name="line.426"></a> +<span class="sourceLineNo">427</span><a name="line.427"></a> +<span class="sourceLineNo">428</span> private Cell maybeCloneWithAllocator(Cell cell) {<a name="line.428"></a> +<span class="sourceLineNo">429</span> return active.maybeCloneWithAllocator(cell);<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> /**<a name="line.432"></a> +<span class="sourceLineNo">433</span> * Internal version of add() that doesn't clone Cells with the<a name="line.433"></a> +<span class="sourceLineNo">434</span> * allocator, and doesn't take the lock.<a name="line.434"></a> +<span class="sourceLineNo">435</span> *<a name="line.435"></a> +<span class="sourceLineNo">436</span> * Callers should ensure they already have the read lock taken<a name="line.436"></a> +<span class="sourceLineNo">437</span> */<a name="line.437"></a> +<span class="sourceLineNo">438</span> private long internalAdd(final Cell toAdd) {<a name="line.438"></a> +<span class="sourceLineNo">439</span> long s = active.add(toAdd);<a name="line.439"></a> +<span class="sourceLineNo">440</span> setOldestEditTimeToNow();<a name="line.440"></a> +<span class="sourceLineNo">441</span> checkActiveSize();<a name="line.441"></a> +<span class="sourceLineNo">442</span> return s;<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> private void setOldestEditTimeToNow() {<a name="line.445"></a> +<span class="sourceLineNo">446</span> if (timeOfOldestEdit == Long.MAX_VALUE) {<a name="line.446"></a> +<span class="sourceLineNo">447</span> timeOfOldestEdit = EnvironmentEdgeManager.currentTime();<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> protected long keySize() {<a name="line.451"></a> +<span class="sourceLineNo">452</span> return heapSize() - DEEP_OVERHEAD;<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> protected CellComparator getComparator() {<a name="line.455"></a> +<span class="sourceLineNo">456</span> return comparator;<a name="line.456"></a> +<span class="sourceLineNo">457</span> }<a name="line.457"></a> +<span class="sourceLineNo">458</span><a name="line.458"></a> +<span class="sourceLineNo">459</span> protected MutableSegment getActive() {<a name="line.459"></a> +<span class="sourceLineNo">460</span> return active;<a name="line.460"></a> +<span class="sourceLineNo">461</span> }<a name="line.461"></a> +<span class="sourceLineNo">462</span><a name="line.462"></a> +<span class="sourceLineNo">463</span> protected ImmutableSegment getSnapshot() {<a name="line.463"></a> +<span class="sourceLineNo">464</span> return snapshot;<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> protected AbstractMemStore setSnapshot(ImmutableSegment snapshot) {<a name="line.467"></a> +<span class="sourceLineNo">468</span> this.snapshot = snapshot;<a name="line.468"></a> +<span class="sourceLineNo">469</span> return this;<a name="line.469"></a> +<span class="sourceLineNo">470</span> }<a name="line.470"></a> +<span class="sourceLineNo">471</span><a name="line.471"></a> +<span class="sourceLineNo">472</span> protected void setSnapshotSize(long snapshotSize) {<a name="line.472"></a> +<span class="sourceLineNo">473</span> getSnapshot().setSize(snapshotSize);<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> /**<a name="line.476"></a> +<span class="sourceLineNo">477</span> * Check whether anything need to be done based on the current active set size<a name="line.477"></a> +<span class="sourceLineNo">478</span> */<a name="line.478"></a> +<span class="sourceLineNo">479</span> protected abstract void checkActiveSize();<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> * Returns a list of Store segment scanners, one per each store segment<a name="line.482"></a> +<span class="sourceLineNo">483</span> * @param readPt the version number required to initialize the scanners<a name="line.483"></a> +<span class="sourceLineNo">484</span> * @return a list of Store segment scanners, one per each store segment<a name="line.484"></a> +<span class="sourceLineNo">485</span> */<a name="line.485"></a> +<span class="sourceLineNo">486</span> protected abstract List<SegmentScanner> getListOfScanners(long readPt) throws IOException;<a name="line.486"></a> +<span class="sourceLineNo">487</span><a name="line.487"></a> +<span class="sourceLineNo">488</span> /**<a name="line.488"></a> +<span class="sourceLineNo">489</span> * Returns an ordered list of segments from most recent to oldest in memstore<a name="line.489"></a> +<span class="sourceLineNo">490</span> * @return an ordered list of segments from most recent to oldest in memstore<a name="line.490"></a> +<span class="sourceLineNo">491</span> */<a name="line.491"></a> +<span class="sourceLineNo">492</span> protected abstract List<Segment> getListOfSegments() throws IOException;<a name="line.492"></a> +<span class="sourceLineNo">493</span><a name="line.493"></a> +<span class="sourceLineNo">494</span> public long getActiveSize() {<a name="line.494"></a> +<span class="sourceLineNo">495</span> return getActive().getSize();<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> + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +</pre> +</div> +</body> +</html> http://git-wip-us.apache.org/repos/asf/hbase-site/blob/526c7822/devapidocs/src-html/org/apache/hadoop/hbase/regionserver/CellSet.html ---------------------------------------------------------------------- diff --git a/devapidocs/src-html/org/apache/hadoop/hbase/regionserver/CellSet.html b/devapidocs/src-html/org/apache/hadoop/hbase/regionserver/CellSet.html new file mode 100644 index 0000000..3140fa1 --- /dev/null +++ b/devapidocs/src-html/org/apache/hadoop/hbase/regionserver/CellSet.html @@ -0,0 +1,255 @@ +<!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> *<a name="line.2"></a> +<span class="sourceLineNo">003</span> * Licensed to the Apache Software Foundation (ASF) under one<a name="line.3"></a> +<span class="sourceLineNo">004</span> * or more contributor license agreements. See the NOTICE file<a name="line.4"></a> +<span class="sourceLineNo">005</span> * distributed with this work for additional information<a name="line.5"></a> +<span class="sourceLineNo">006</span> * regarding copyright ownership. The ASF licenses this file<a name="line.6"></a> +<span class="sourceLineNo">007</span> * to you under the Apache License, Version 2.0 (the<a name="line.7"></a> +<span class="sourceLineNo">008</span> * "License"); you may not use this file except in compliance<a name="line.8"></a> +<span class="sourceLineNo">009</span> * with the License. You may obtain a copy of the License at<a name="line.9"></a> +<span class="sourceLineNo">010</span> *<a name="line.10"></a> +<span class="sourceLineNo">011</span> * http://www.apache.org/licenses/LICENSE-2.0<a name="line.11"></a> +<span class="sourceLineNo">012</span> *<a name="line.12"></a> +<span class="sourceLineNo">013</span> * Unless required by applicable law or agreed to in writing, software<a name="line.13"></a> +<span class="sourceLineNo">014</span> * distributed under the License is distributed on an "AS IS" BASIS,<a name="line.14"></a> +<span class="sourceLineNo">015</span> * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.<a name="line.15"></a> +<span class="sourceLineNo">016</span> * See the License for the specific language governing permissions and<a name="line.16"></a> +<span class="sourceLineNo">017</span> * limitations under the License.<a name="line.17"></a> +<span class="sourceLineNo">018</span> */<a name="line.18"></a> +<span class="sourceLineNo">019</span>package org.apache.hadoop.hbase.regionserver;<a name="line.19"></a> +<span class="sourceLineNo">020</span><a name="line.20"></a> +<span class="sourceLineNo">021</span>import java.util.Collection;<a name="line.21"></a> +<span class="sourceLineNo">022</span>import java.util.Comparator;<a name="line.22"></a> +<span class="sourceLineNo">023</span>import java.util.Iterator;<a name="line.23"></a> +<span class="sourceLineNo">024</span>import java.util.NavigableSet;<a name="line.24"></a> +<span class="sourceLineNo">025</span>import java.util.SortedSet;<a name="line.25"></a> +<span class="sourceLineNo">026</span>import java.util.concurrent.ConcurrentNavigableMap;<a name="line.26"></a> +<span class="sourceLineNo">027</span>import java.util.concurrent.ConcurrentSkipListMap;<a name="line.27"></a> +<span class="sourceLineNo">028</span><a name="line.28"></a> +<span class="sourceLineNo">029</span>import org.apache.hadoop.hbase.Cell;<a name="line.29"></a> +<span class="sourceLineNo">030</span>import org.apache.hadoop.hbase.CellComparator;<a name="line.30"></a> +<span class="sourceLineNo">031</span>import org.apache.hadoop.hbase.classification.InterfaceAudience;<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> * A {@link java.util.Set} of {@link Cell}s, where an add will overwrite the entry if already<a name="line.34"></a> +<span class="sourceLineNo">035</span> * exists in the set. The call to add returns true if no value in the backing map or false if<a name="line.35"></a> +<span class="sourceLineNo">036</span> * there was an entry with same key (though value may be different).<a name="line.36"></a> +<span class="sourceLineNo">037</span> * implementation is tolerant of concurrent get and set and won't throw<a name="line.37"></a> +<span class="sourceLineNo">038</span> * ConcurrentModificationException when iterating.<a name="line.38"></a> +<span class="sourceLineNo">039</span> */<a name="line.39"></a> +<span class="sourceLineNo">040</span>@InterfaceAudience.Private<a name="line.40"></a> +<span class="sourceLineNo">041</span>public class CellSet implements NavigableSet<Cell> {<a name="line.41"></a> +<span class="sourceLineNo">042</span> // Implemented on top of a {@link java.util.concurrent.ConcurrentSkipListMap}<a name="line.42"></a> +<span class="sourceLineNo">043</span> // Differ from CSLS in one respect, where CSLS does "Adds the specified element to this set if it<a name="line.43"></a> +<span class="sourceLineNo">044</span> // is not already present.", this implementation "Adds the specified element to this set EVEN<a name="line.44"></a> +<span class="sourceLineNo">045</span> // if it is already present overwriting what was there previous".<a name="line.45"></a> +<span class="sourceLineNo">046</span> // Otherwise, has same attributes as ConcurrentSkipListSet<a name="line.46"></a> +<span class="sourceLineNo">047</span> private final ConcurrentNavigableMap<Cell, Cell> delegatee;<a name="line.47"></a> +<span class="sourceLineNo">048</span><a name="line.48"></a> +<span class="sourceLineNo">049</span> CellSet(final CellComparator c) {<a name="line.49"></a> +<span class="sourceLineNo">050</span> this.delegatee = new ConcurrentSkipListMap<Cell, Cell>(c);<a name="line.50"></a> +<span class="sourceLineNo">051</span> }<a name="line.51"></a> +<span class="sourceLineNo">052</span><a name="line.52"></a> +<span class="sourceLineNo">053</span> CellSet(final ConcurrentNavigableMap<Cell, Cell> m) {<a name="line.53"></a> +<span class="sourceLineNo">054</span> this.delegatee = m;<a name="line.54"></a> +<span class="sourceLineNo">055</span> }<a name="line.55"></a> +<span class="sourceLineNo">056</span><a name="line.56"></a> +<span class="sourceLineNo">057</span> public Cell ceiling(Cell e) {<a name="line.57"></a> +<span class="sourceLineNo">058</span> throw new UnsupportedOperationException("Not implemented");<a name="line.58"></a> +<span class="sourceLineNo">059</span> }<a name="line.59"></a> +<span class="sourceLineNo">060</span><a name="line.60"></a> +<span class="sourceLineNo">061</span> public Iterator<Cell> descendingIterator() {<a name="line.61"></a> +<span class="sourceLineNo">062</span> return this.delegatee.descendingMap().values().iterator();<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> public NavigableSet<Cell> descendingSet() {<a name="line.65"></a> +<span class="sourceLineNo">066</span> throw new UnsupportedOperationException("Not implemented");<a name="line.66"></a> +<span class="sourceLineNo">067</span> }<a name="line.67"></a> +<span class="sourceLineNo">068</span><a name="line.68"></a> +<span class="sourceLineNo">069</span> public Cell floor(Cell e) {<a name="line.69"></a> +<span class="sourceLineNo">070</span> throw new UnsupportedOperationException("Not implemented");<a name="line.70"></a> +<span class="sourceLineNo">071</span> }<a name="line.71"></a> +<span class="sourceLineNo">072</span><a name="line.72"></a> +<span class="sourceLineNo">073</span> public SortedSet<Cell> headSet(final Cell toElement) {<a name="line.73"></a> +<span class="sourceLineNo">074</span> return headSet(toElement, false);<a name="line.74"></a> +<span class="sourceLineNo">075</span> }<a name="line.75"></a> +<span class="sourceLineNo">076</span><a name="line.76"></a> +<span class="sourceLineNo">077</span> public NavigableSet<Cell> headSet(final Cell toElement,<a name="line.77"></a> +<span class="sourceLineNo">078</span> boolean inclusive) {<a name="line.78"></a> +<span class="sourceLineNo">079</span> return new CellSet(this.delegatee.headMap(toElement, inclusive));<a name="line.79"></a> +<span class="sourceLineNo">080</span> }<a name="line.80"></a> +<span class="sourceLineNo">081</span><a name="line.81"></a> +<span class="sourceLineNo">082</span> public Cell higher(Cell e) {<a name="line.82"></a> +<span class="sourceLineNo">083</span> throw new UnsupportedOperationException("Not implemented");<a name="line.83"></a> +<span class="sourceLineNo">084</span> }<a name="line.84"></a> +<span class="sourceLineNo">085</span><a name="line.85"></a> +<span class="sourceLineNo">086</span> public Iterator<Cell> iterator() {<a name="line.86"></a> +<span class="sourceLineNo">087</span> return this.delegatee.values().iterator();<a name="line.87"></a> +<span class="sourceLineNo">088</span> }<a name="line.88"></a> +<span class="sourceLineNo">089</span><a name="line.89"></a> +<span class="sourceLineNo">090</span> public Cell lower(Cell e) {<a name="line.90"></a> +<span class="sourceLineNo">091</span> throw new UnsupportedOperationException("Not implemented");<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> public Cell pollFirst() {<a name="line.94"></a> +<span class="sourceLineNo">095</span> throw new UnsupportedOperationException("Not implemented");<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> public Cell pollLast() {<a name="line.98"></a> +<span class="sourceLineNo">099</span> throw new UnsupportedOperationException("Not implemented");<a name="line.99"></a> +<span class="sourceLineNo">100</span> }<a name="line.100"></a> +<span class="sourceLineNo">101</span><a name="line.101"></a> +<span class="sourceLineNo">102</span> public SortedSet<Cell> subSet(Cell fromElement, Cell toElement) {<a name="line.102"></a> +<span class="sourceLineNo">103</span> throw new UnsupportedOperationException("Not implemented");<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 NavigableSet<Cell> subSet(Cell fromElement,<a name="line.106"></a> +<span class="sourceLineNo">107</span> boolean fromInclusive, Cell toElement, boolean toInclusive) {<a name="line.107"></a> +<span class="sourceLineNo">108</span> throw new UnsupportedOperationException("Not implemented");<a name="line.108"></a> +<span class="sourceLineNo">109</span> }<a name="line.109"></a> +<span class="sourceLineNo">110</span><a name="line.110"></a> +<span class="sourceLineNo">111</span> public SortedSet<Cell> tailSet(Cell fromElement) {<a name="line.111"></a> +<span class="sourceLineNo">112</span> return tailSet(fromElement, true);<a name="line.112"></a> +<span class="sourceLineNo">113</span> }<a name="line.113"></a> +<span class="sourceLineNo">114</span><a name="line.114"></a> +<span class="sourceLineNo">115</span> public NavigableSet<Cell> tailSet(Cell fromElement, boolean inclusive) {<a name="line.115"></a> +<span class="sourceLineNo">116</span> return new CellSet(this.delegatee.tailMap(fromElement, inclusive));<a name="line.116"></a> +<span class="sourceLineNo">117</span> }<a name="line.117"></a> +<span class="sourceLineNo">118</span><a name="line.118"></a> +<span class="sourceLineNo">119</span> public Comparator<? super Cell> comparator() {<a name="line.119"></a> +<span class="sourceLineNo">120</span> throw new UnsupportedOperationException("Not implemented");<a name="line.120"></a> +<span class="sourceLineNo">121</span> }<a name="line.121"></a> +<span class="sourceLineNo">122</span><a name="line.122"></a> +<span class="sourceLineNo">123</span> public Cell first() {<a name="line.123"></a> +<span class="sourceLineNo">124</span> return this.delegatee.get(this.delegatee.firstKey());<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> public Cell last() {<a name="line.127"></a> +<span class="sourceLineNo">128</span> return this.delegatee.get(this.delegatee.lastKey());<a name="line.128"></a> +<span class="sourceLineNo">129</span> }<a name="line.129"></a> +<span class="sourceLineNo">130</span><a name="line.130"></a> +<span class="sourceLineNo">131</span> public boolean add(Cell e) {<a name="line.131"></a> +<span class="sourceLineNo">132</span> return this.delegatee.put(e, e) == null;<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> public boolean addAll(Collection<? extends Cell> c) {<a name="line.135"></a> +<span class="sourceLineNo">136</span> throw new UnsupportedOperationException("Not implemented");<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> public void clear() {<a name="line.139"></a> +<span class="sourceLineNo">140</span> this.delegatee.clear();<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 contains(Object o) {<a name="line.143"></a> +<span class="sourceLineNo">144</span> //noinspection SuspiciousMethodCalls<a name="line.144"></a> +<span class="sourceLineNo">145</span> return this.delegatee.containsKey(o);<a name="line.145"></a> +<span class="sourceLineNo">146</span> }<a name="line.146"></a> +<span class="sourceLineNo">147</span><a name="line.147"></a> +<span class="sourceLineNo">148</span> public boolean containsAll(Collection<?> c) {<a name="line.148"></a> +<span class="sourceLineNo">149</span> throw new UnsupportedOperationException("Not implemented");<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> public boolean isEmpty() {<a name="line.152"></a> +<span class="sourceLineNo">153</span> return this.delegatee.isEmpty();<a name="line.153"></a> +<span class="sourceLineNo">154</span> }<a name="line.154"></a> +<span class="sourceLineNo">155</span><a name="line.155"></a> +<span class="sourceLineNo">156</span> public boolean remove(Object o) {<a name="line.156"></a> +<span class="sourceLineNo">157</span> return this.delegatee.remove(o) != null;<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> public boolean removeAll(Collection<?> c) {<a name="line.160"></a> +<span class="sourceLineNo">161</span> throw new UnsupportedOperationException("Not implemented");<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 boolean retainAll(Collection<?> c) {<a name="line.164"></a> +<span class="sourceLineNo">165</span> throw new UnsupportedOperationException("Not implemented");<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> public Cell get(Cell kv) {<a name="line.168"></a> +<span class="sourceLineNo">169</span> return this.delegatee.get(kv);<a name="line.169"></a> +<span class="sourceLineNo">170</span> }<a name="line.170"></a> +<span class="sourceLineNo">171</span><a name="line.171"></a> +<span class="sourceLineNo">172</span> public int size() {<a name="line.172"></a> +<span class="sourceLineNo">173</span> return this.delegatee.size();<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 Object[] toArray() {<a name="line.176"></a> +<span class="sourceLineNo">177</span> throw new UnsupportedOperationException("Not implemented");<a name="line.177"></a> +<span class="sourceLineNo">178</span> }<a name="line.178"></a> +<span class="sourceLineNo">179</span><a name="line.179"></a> +<span class="sourceLineNo">180</span> public <T> T[] toArray(T[] a) {<a name="line.180"></a> +<span class="sourceLineNo">181</span> throw new UnsupportedOperationException("Not implemented");<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> + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +</pre> +</div> +</body> +</html> http://git-wip-us.apache.org/repos/asf/hbase-site/blob/526c7822/devapidocs/src-html/org/apache/hadoop/hbase/regionserver/CellSkipListSet.html ---------------------------------------------------------------------- diff --git a/devapidocs/src-html/org/apache/hadoop/hbase/regionserver/CellSkipListSet.html b/devapidocs/src-html/org/apache/hadoop/hbase/regionserver/CellSkipListSet.html deleted file mode 100644 index 931e3d0..0000000 --- a/devapidocs/src-html/org/apache/hadoop/hbase/regionserver/CellSkipListSet.html +++ /dev/null @@ -1,257 +0,0 @@ -<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html4/loose.dtd";> -<html lang="en"> -<head> -<title>Source code</title> -<link rel="stylesheet" type="text/css" href="../../../../../../stylesheet.css" title="Style"> -</head> -<body> -<div class="sourceContainer"> -<pre><span class="sourceLineNo">001</span>/**<a name="line.1"></a> -<span class="sourceLineNo">002</span> *<a name="line.2"></a> -<span class="sourceLineNo">003</span> * Licensed to the Apache Software Foundation (ASF) under one<a name="line.3"></a> -<span class="sourceLineNo">004</span> * or more contributor license agreements. See the NOTICE file<a name="line.4"></a> -<span class="sourceLineNo">005</span> * distributed with this work for additional information<a name="line.5"></a> -<span class="sourceLineNo">006</span> * regarding copyright ownership. The ASF licenses this file<a name="line.6"></a> -<span class="sourceLineNo">007</span> * to you under the Apache License, Version 2.0 (the<a name="line.7"></a> -<span class="sourceLineNo">008</span> * "License"); you may not use this file except in compliance<a name="line.8"></a> -<span class="sourceLineNo">009</span> * with the License. You may obtain a copy of the License at<a name="line.9"></a> -<span class="sourceLineNo">010</span> *<a name="line.10"></a> -<span class="sourceLineNo">011</span> * http://www.apache.org/licenses/LICENSE-2.0<a name="line.11"></a> -<span class="sourceLineNo">012</span> *<a name="line.12"></a> -<span class="sourceLineNo">013</span> * Unless required by applicable law or agreed to in writing, software<a name="line.13"></a> -<span class="sourceLineNo">014</span> * distributed under the License is distributed on an "AS IS" BASIS,<a name="line.14"></a> -<span class="sourceLineNo">015</span> * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.<a name="line.15"></a> -<span class="sourceLineNo">016</span> * See the License for the specific language governing permissions and<a name="line.16"></a> -<span class="sourceLineNo">017</span> * limitations under the License.<a name="line.17"></a> -<span class="sourceLineNo">018</span> */<a name="line.18"></a> -<span class="sourceLineNo">019</span>package org.apache.hadoop.hbase.regionserver;<a name="line.19"></a> -<span class="sourceLineNo">020</span><a name="line.20"></a> -<span class="sourceLineNo">021</span>import java.util.Collection;<a name="line.21"></a> -<span class="sourceLineNo">022</span>import java.util.Comparator;<a name="line.22"></a> -<span class="sourceLineNo">023</span>import java.util.Iterator;<a name="line.23"></a> -<span class="sourceLineNo">024</span>import java.util.NavigableSet;<a name="line.24"></a> -<span class="sourceLineNo">025</span>import java.util.SortedSet;<a name="line.25"></a> -<span class="sourceLineNo">026</span>import java.util.concurrent.ConcurrentNavigableMap;<a name="line.26"></a> -<span class="sourceLineNo">027</span>import java.util.concurrent.ConcurrentSkipListMap;<a name="line.27"></a> -<span class="sourceLineNo">028</span><a name="line.28"></a> -<span class="sourceLineNo">029</span>import org.apache.hadoop.hbase.Cell;<a name="line.29"></a> -<span class="sourceLineNo">030</span>import org.apache.hadoop.hbase.CellComparator;<a name="line.30"></a> -<span class="sourceLineNo">031</span>import org.apache.hadoop.hbase.classification.InterfaceAudience;<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> * A {@link java.util.Set} of {@link Cell}s implemented on top of a<a name="line.34"></a> -<span class="sourceLineNo">035</span> * {@link java.util.concurrent.ConcurrentSkipListMap}. Works like a<a name="line.35"></a> -<span class="sourceLineNo">036</span> * {@link java.util.concurrent.ConcurrentSkipListSet} in all but one regard:<a name="line.36"></a> -<span class="sourceLineNo">037</span> * An add will overwrite if already an entry for the added key. In other words,<a name="line.37"></a> -<span class="sourceLineNo">038</span> * where CSLS does "Adds the specified element to this set if it is not already<a name="line.38"></a> -<span class="sourceLineNo">039</span> * present.", this implementation "Adds the specified element to this set EVEN<a name="line.39"></a> -<span class="sourceLineNo">040</span> * if it is already present overwriting what was there previous". The call to<a name="line.40"></a> -<span class="sourceLineNo">041</span> * add returns true if no value in the backing map or false if there was an<a name="line.41"></a> -<span class="sourceLineNo">042</span> * entry with same key (though value may be different).<a name="line.42"></a> -<span class="sourceLineNo">043</span> * <p>Otherwise,<a name="line.43"></a> -<span class="sourceLineNo">044</span> * has same attributes as ConcurrentSkipListSet: e.g. tolerant of concurrent<a name="line.44"></a> -<span class="sourceLineNo">045</span> * get and set and won't throw ConcurrentModificationException when iterating.<a name="line.45"></a> -<span class="sourceLineNo">046</span> */<a name="line.46"></a> -<span class="sourceLineNo">047</span>@InterfaceAudience.Private<a name="line.47"></a> -<span class="sourceLineNo">048</span>public class CellSkipListSet implements NavigableSet<Cell> {<a name="line.48"></a> -<span class="sourceLineNo">049</span> private final ConcurrentNavigableMap<Cell, Cell> delegatee;<a name="line.49"></a> -<span class="sourceLineNo">050</span><a name="line.50"></a> -<span class="sourceLineNo">051</span> CellSkipListSet(final CellComparator c) {<a name="line.51"></a> -<span class="sourceLineNo">052</span> this.delegatee = new ConcurrentSkipListMap<Cell, Cell>(c);<a name="line.52"></a> -<span class="sourceLineNo">053</span> }<a name="line.53"></a> -<span class="sourceLineNo">054</span><a name="line.54"></a> -<span class="sourceLineNo">055</span> CellSkipListSet(final ConcurrentNavigableMap<Cell, Cell> m) {<a name="line.55"></a> -<span class="sourceLineNo">056</span> this.delegatee = m;<a name="line.56"></a> -<span class="sourceLineNo">057</span> }<a name="line.57"></a> -<span class="sourceLineNo">058</span><a name="line.58"></a> -<span class="sourceLineNo">059</span> public Cell ceiling(Cell e) {<a name="line.59"></a> -<span class="sourceLineNo">060</span> throw new UnsupportedOperationException("Not implemented");<a name="line.60"></a> -<span class="sourceLineNo">061</span> }<a name="line.61"></a> -<span class="sourceLineNo">062</span><a name="line.62"></a> -<span class="sourceLineNo">063</span> public Iterator<Cell> descendingIterator() {<a name="line.63"></a> -<span class="sourceLineNo">064</span> return this.delegatee.descendingMap().values().iterator();<a name="line.64"></a> -<span class="sourceLineNo">065</span> }<a name="line.65"></a> -<span class="sourceLineNo">066</span><a name="line.66"></a> -<span class="sourceLineNo">067</span> public NavigableSet<Cell> descendingSet() {<a name="line.67"></a> -<span class="sourceLineNo">068</span> throw new UnsupportedOperationException("Not implemented");<a name="line.68"></a> -<span class="sourceLineNo">069</span> }<a name="line.69"></a> -<span class="sourceLineNo">070</span><a name="line.70"></a> -<span class="sourceLineNo">071</span> public Cell floor(Cell e) {<a name="line.71"></a> -<span class="sourceLineNo">072</span> throw new UnsupportedOperationException("Not implemented");<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> public SortedSet<Cell> headSet(final Cell toElement) {<a name="line.75"></a> -<span class="sourceLineNo">076</span> return headSet(toElement, false);<a name="line.76"></a> -<span class="sourceLineNo">077</span> }<a name="line.77"></a> -<span class="sourceLineNo">078</span><a name="line.78"></a> -<span class="sourceLineNo">079</span> public NavigableSet<Cell> headSet(final Cell toElement,<a name="line.79"></a> -<span class="sourceLineNo">080</span> boolean inclusive) {<a name="line.80"></a> -<span class="sourceLineNo">081</span> return new CellSkipListSet(this.delegatee.headMap(toElement, inclusive));<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 Cell higher(Cell e) {<a name="line.84"></a> -<span class="sourceLineNo">085</span> throw new UnsupportedOperationException("Not implemented");<a name="line.85"></a> -<span class="sourceLineNo">086</span> }<a name="line.86"></a> -<span class="sourceLineNo">087</span><a name="line.87"></a> -<span class="sourceLineNo">088</span> public Iterator<Cell> iterator() {<a name="line.88"></a> -<span class="sourceLineNo">089</span> return this.delegatee.values().iterator();<a name="line.89"></a> -<span class="sourceLineNo">090</span> }<a name="line.90"></a> -<span class="sourceLineNo">091</span><a name="line.91"></a> -<span class="sourceLineNo">092</span> public Cell lower(Cell e) {<a name="line.92"></a> -<span class="sourceLineNo">093</span> throw new UnsupportedOperationException("Not implemented");<a name="line.93"></a> -<span class="sourceLineNo">094</span> }<a name="line.94"></a> -<span class="sourceLineNo">095</span><a name="line.95"></a> -<span class="sourceLineNo">096</span> public Cell pollFirst() {<a name="line.96"></a> -<span class="sourceLineNo">097</span> throw new UnsupportedOperationException("Not implemented");<a name="line.97"></a> -<span class="sourceLineNo">098</span> }<a name="line.98"></a> -<span class="sourceLineNo">099</span><a name="line.99"></a> -<span class="sourceLineNo">100</span> public Cell pollLast() {<a name="line.100"></a> -<span class="sourceLineNo">101</span> throw new UnsupportedOperationException("Not implemented");<a name="line.101"></a> -<span class="sourceLineNo">102</span> }<a name="line.102"></a> -<span class="sourceLineNo">103</span><a name="line.103"></a> -<span class="sourceLineNo">104</span> public SortedSet<Cell> subSet(Cell fromElement, Cell toElement) {<a name="line.104"></a> -<span class="sourceLineNo">105</span> throw new UnsupportedOperationException("Not implemented");<a name="line.105"></a> -<span class="sourceLineNo">106</span> }<a name="line.106"></a> -<span class="sourceLineNo">107</span><a name="line.107"></a> -<span class="sourceLineNo">108</span> public NavigableSet<Cell> subSet(Cell fromElement,<a name="line.108"></a> -<span class="sourceLineNo">109</span> boolean fromInclusive, Cell toElement, boolean toInclusive) {<a name="line.109"></a> -<span class="sourceLineNo">110</span> throw new UnsupportedOperationException("Not implemented");<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 SortedSet<Cell> tailSet(Cell fromElement) {<a name="line.113"></a> -<span class="sourceLineNo">114</span> return tailSet(fromElement, true);<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 NavigableSet<Cell> tailSet(Cell fromElement, boolean inclusive) {<a name="line.117"></a> -<span class="sourceLineNo">118</span> return new CellSkipListSet(this.delegatee.tailMap(fromElement, inclusive));<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 Comparator<? super Cell> comparator() {<a name="line.121"></a> -<span class="sourceLineNo">122</span> throw new UnsupportedOperationException("Not implemented");<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 Cell first() {<a name="line.125"></a> -<span class="sourceLineNo">126</span> return this.delegatee.get(this.delegatee.firstKey());<a name="line.126"></a> -<span class="sourceLineNo">127</span> }<a name="line.127"></a> -<span class="sourceLineNo">128</span><a name="line.128"></a> -<span class="sourceLineNo">129</span> public Cell last() {<a name="line.129"></a> -<span class="sourceLineNo">130</span> return this.delegatee.get(this.delegatee.lastKey());<a name="line.130"></a> -<span class="sourceLineNo">131</span> }<a name="line.131"></a> -<span class="sourceLineNo">132</span><a name="line.132"></a> -<span class="sourceLineNo">133</span> public boolean add(Cell e) {<a name="line.133"></a> -<span class="sourceLineNo">134</span> return this.delegatee.put(e, e) == null;<a name="line.134"></a> -<span class="sourceLineNo">135</span> }<a name="line.135"></a> -<span class="sourceLineNo">136</span><a name="line.136"></a> -<span class="sourceLineNo">137</span> public boolean addAll(Collection<? extends Cell> c) {<a name="line.137"></a> -<span class="sourceLineNo">138</span> throw new UnsupportedOperationException("Not implemented");<a name="line.138"></a> -<span class="sourceLineNo">139</span> }<a name="line.139"></a> -<span class="sourceLineNo">140</span><a name="line.140"></a> -<span class="sourceLineNo">141</span> public void clear() {<a name="line.141"></a> -<span class="sourceLineNo">142</span> this.delegatee.clear();<a name="line.142"></a> -<span class="sourceLineNo">143</span> }<a name="line.143"></a> -<span class="sourceLineNo">144</span><a name="line.144"></a> -<span class="sourceLineNo">145</span> public boolean contains(Object o) {<a name="line.145"></a> -<span class="sourceLineNo">146</span> //noinspection SuspiciousMethodCalls<a name="line.146"></a> -<span class="sourceLineNo">147</span> return this.delegatee.containsKey(o);<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> public boolean containsAll(Collection<?> c) {<a name="line.150"></a> -<span class="sourceLineNo">151</span> throw new UnsupportedOperationException("Not implemented");<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> return this.delegatee.isEmpty();<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> public boolean remove(Object o) {<a name="line.158"></a> -<span class="sourceLineNo">159</span> return this.delegatee.remove(o) != null;<a name="line.159"></a> -<span class="sourceLineNo">160</span> }<a name="line.160"></a> -<span class="sourceLineNo">161</span><a name="line.161"></a> -<span class="sourceLineNo">162</span> public boolean removeAll(Collection<?> c) {<a name="line.162"></a> -<span class="sourceLineNo">163</span> throw new UnsupportedOperationException("Not implemented");<a name="line.163"></a> -<span class="sourceLineNo">164</span> }<a name="line.164"></a> -<span class="sourceLineNo">165</span><a name="line.165"></a> -<span class="sourceLineNo">166</span> public boolean retainAll(Collection<?> c) {<a name="line.166"></a> -<span class="sourceLineNo">167</span> throw new UnsupportedOperationException("Not implemented");<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 Cell get(Cell kv) {<a name="line.170"></a> -<span class="sourceLineNo">171</span> return this.delegatee.get(kv);<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> public int size() {<a name="line.174"></a> -<span class="sourceLineNo">175</span> return this.delegatee.size();<a name="line.175"></a> -<span class="sourceLineNo">176</span> }<a name="line.176"></a> -<span class="sourceLineNo">177</span><a name="line.177"></a> -<span class="sourceLineNo">178</span> public Object[] toArray() {<a name="line.178"></a> -<span class="sourceLineNo">179</span> throw new UnsupportedOperationException("Not implemented");<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> public <T> T[] toArray(T[] a) {<a name="line.182"></a> -<span class="sourceLineNo">183</span> throw new UnsupportedOperationException("Not implemented");<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> - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -</pre> -</div> -</body> -</html>
