本文整理了Java中org.apache.hadoop.hbase.KeyValue.heapSize()
方法的一些代码示例,展示了KeyValue.heapSize()
的具体用法。这些代码示例主要来源于Github
/Stackoverflow
/Maven
等平台,是从一些精选项目中提取出来的代码,具有较强的参考意义,能在一定程度帮忙到你。KeyValue.heapSize()
方法的具体详情如下:
包路径:org.apache.hadoop.hbase.KeyValue
类名称:KeyValue
方法名:heapSize
[英]HeapSize implementation We do not count the bytes in the rowCache because it should be empty for a KeyValue in the MemStore.
[中]HeapSize实现我们不计算行缓存中的字节数,因为它对于MemStore中的KeyValue应该为空。
代码示例来源:origin: apache/hbase
@Override
public long heapSize() {
return super.heapSize() + Bytes.SIZEOF_SHORT;
}
代码示例来源:origin: apache/hbase
@Override
public long heapSize() {
return super.heapSize() + FIXED_OVERHEAD;
}
代码示例来源:origin: apache/hbase
@Override
public long heapSize() {
return this.kv.heapSize();
}
}
代码示例来源:origin: apache/hbase
for (Cell cell : entry.getValue()) {
KeyValue kv = KeyValueUtil.ensureKeyValue(cell);
curSize += kv.heapSize();
if (kvs != null) {
kvs.add(kv);
代码示例来源:origin: apache/hbase
KeyValue kv = KeyValueUtil.ensureKeyValue(cell);
kvs.add(kv);
curSize += kv.heapSize();
代码示例来源:origin: apache/hbase
curSize += kv.heapSize();
代码示例来源:origin: apache/hbase
(long) ClassSize.CELL_CHUNK_MAP_ENTRY + ClassSize.align(kv.getSerializedSize());
long oneCellOnCSLMHeapSize =
ClassSize.align(ClassSize.CONCURRENT_SKIPLISTMAP_ENTRY + kv.heapSize());
long totalHeapSize = MutableSegment.DEEP_OVERHEAD;
for (int i = 0; i < keysList.size(); i++) {
代码示例来源:origin: apache/hbase
ClassSize.CONCURRENT_SKIPLISTMAP_ENTRY + kv.heapSize());
代码示例来源:origin: apache/hbase
ClassSize.CONCURRENT_SKIPLISTMAP_ENTRY + kv.heapSize());
代码示例来源:origin: org.apache.hbase/hbase-common
@Override
public long heapSize() {
return super.heapSize() + FIXED_OVERHEAD;
}
}
代码示例来源:origin: com.aliyun.hbase/alihbase-common
@Override
public long heapSize() {
return super.heapSize() + FIXED_OVERHEAD;
}
}
代码示例来源:origin: org.apache.hbase/hbase-common
@Override
public long heapSize() {
return super.heapSize() + Bytes.SIZEOF_SHORT;
}
代码示例来源:origin: com.aliyun.hbase/alihbase-common
@Override
public long heapSize() {
return super.heapSize() + Bytes.SIZEOF_SHORT;
}
代码示例来源:origin: co.cask.hbase/hbase
public long heapSize() {
long ret = 0;
for (KeyValue kv : kvs) {
ret += kv.heapSize();
}
if (scopes != null) {
ret += ClassSize.TREEMAP;
ret += ClassSize.align(scopes.size() * ClassSize.MAP_ENTRY);
// TODO this isn't quite right, need help here
}
return ret;
}
代码示例来源:origin: co.cask.hbase/hbase
long heapSizeChange(final KeyValue kv, final boolean notpresent) {
return notpresent ?
ClassSize.align(ClassSize.CONCURRENT_SKIPLISTMAP_ENTRY + kv.heapSize()):
0;
}
代码示例来源:origin: org.apache.hbase/hbase-mapreduce
for (Cell cell : entry.getValue()) {
KeyValue kv = KeyValueUtil.ensureKeyValue(cell);
curSize += kv.heapSize();
if (kvs != null) {
kvs.add(kv);
代码示例来源:origin: com.aliyun.hbase/alihbase-mapreduce
for (Cell cell : entry.getValue()) {
KeyValue kv = KeyValueUtil.ensureKeyValue(cell);
curSize += kv.heapSize();
if (kvs != null) {
kvs.add(kv);
代码示例来源:origin: harbby/presto-connectors
KeyValue kv = KeyValueUtil.ensureKeyValueTypeForMR(cell);
map.add(kv);
curSize += kv.heapSize();
代码示例来源:origin: co.cask.hbase/hbase
public long heapSize() {
long heapsize = OVERHEAD;
//Adding row
heapsize += ClassSize.align(ClassSize.ARRAY + this.row.length);
//Adding map overhead
heapsize +=
ClassSize.align(this.familyMap.size() * ClassSize.MAP_ENTRY);
for(Map.Entry<byte [], List<KeyValue>> entry : this.familyMap.entrySet()) {
//Adding key overhead
heapsize +=
ClassSize.align(ClassSize.ARRAY + entry.getKey().length);
//This part is kinds tricky since the JVM can reuse references if you
//store the same value, but have a good match with SizeOf at the moment
//Adding value overhead
heapsize += ClassSize.align(ClassSize.ARRAYLIST);
int size = entry.getValue().size();
heapsize += ClassSize.align(ClassSize.ARRAY +
size * ClassSize.REFERENCE);
for(KeyValue kv : entry.getValue()) {
heapsize += kv.heapSize();
}
}
heapsize += getAttributeSize();
return ClassSize.align((int)heapsize);
}
代码示例来源:origin: apache/hbase
expected = ClassSize.estimateBase(cl, false);
KeyValue kv = new KeyValue();
actual = kv.heapSize();
if(expected != actual) {
ClassSize.estimateBase(cl, true);
内容来源于网络,如有侵权,请联系作者删除!