| /** |
| * Licensed to the Apache Software Foundation (ASF) under one |
| * or more contributor license agreements. See the NOTICE file |
| * distributed with this work for additional information |
| * regarding copyright ownership. The ASF licenses this file |
| * to you under the Apache License, Version 2.0 (the |
| * "License"); you may not use this file except in compliance |
| * with the License. You may obtain a copy of the License at |
| * |
| * http://www.apache.org/licenses/LICENSE-2.0 |
| * |
| * Unless required by applicable law or agreed to in writing, software |
| * distributed under the License is distributed on an "AS IS" BASIS, |
| * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. |
| * See the License for the specific language governing permissions and |
| * limitations under the License. |
| */ |
| package org.apache.hadoop.hbase.client; |
| |
| import java.util.Arrays; |
| import org.apache.hadoop.hbase.HConstants; |
| import org.apache.hadoop.hbase.util.Bytes; |
| import org.apache.yetus.audience.InterfaceAudience; |
| |
| @InterfaceAudience.Private |
| public class ClientUtil { |
| |
| |
| public static boolean areScanStartRowAndStopRowEqual(byte[] startRow, byte[] stopRow) { |
| return startRow != null && startRow.length > 0 && Bytes.equals(startRow, stopRow); |
| } |
| |
| public static Cursor createCursor(byte[] row) { |
| return new Cursor(row); |
| } |
| |
| /** |
| * <p>When scanning for a prefix the scan should stop immediately after the the last row that |
| * has the specified prefix. This method calculates the closest next rowKey immediately following |
| * the given rowKeyPrefix.</p> |
| * <p><b>IMPORTANT: This converts a rowKey<u>Prefix</u> into a rowKey</b>.</p> |
| * <p>If the prefix is an 'ASCII' string put into a byte[] then this is easy because you can |
| * simply increment the last byte of the array. |
| * But if your application uses real binary rowids you may run into the scenario that your |
| * prefix is something like:</p> |
| * <b>{ 0x12, 0x23, 0xFF, 0xFF }</b><br/> |
| * Then this stopRow needs to be fed into the actual scan<br/> |
| * <b>{ 0x12, 0x24 }</b> (Notice that it is shorter now)<br/> |
| * This method calculates the correct stop row value for this usecase. |
| * |
| * @param rowKeyPrefix the rowKey<u>Prefix</u>. |
| * @return the closest next rowKey immediately following the given rowKeyPrefix. |
| */ |
| public static byte[] calculateTheClosestNextRowKeyForPrefix(byte[] rowKeyPrefix) { |
| // Essentially we are treating it like an 'unsigned very very long' and doing +1 manually. |
| // Search for the place where the trailing 0xFFs start |
| int offset = rowKeyPrefix.length; |
| while (offset > 0) { |
| if (rowKeyPrefix[offset - 1] != (byte) 0xFF) { |
| break; |
| } |
| offset--; |
| } |
| |
| if (offset == 0) { |
| // We got an 0xFFFF... (only FFs) stopRow value which is |
| // the last possible prefix before the end of the table. |
| // So set it to stop at the 'end of the table' |
| return HConstants.EMPTY_END_ROW; |
| } |
| |
| // Copy the right length of the original |
| byte[] newStopRow = Arrays.copyOfRange(rowKeyPrefix, 0, offset); |
| // And increment the last one |
| newStopRow[newStopRow.length - 1]++; |
| return newStopRow; |
| } |
| } |