public long unsharedHeapSizeExcludingData() { long heapSize = EMPTY_SIZE + clustering.unsharedHeapSizeExcludingData() + BTree.sizeOfStructureOnHeap(btree); for (ColumnData cd : this) heapSize += cd.unsharedHeapSizeExcludingData(); return heapSize; }
public long unsharedHeapSizeExcludingData() { long heapSize = EMPTY_SIZE + clustering.unsharedHeapSizeExcludingData() + BTree.sizeOfStructureOnHeap(btree); for (ColumnData cd : this) heapSize += cd.unsharedHeapSizeExcludingData(); return heapSize; }
public long unsharedHeapSizeExcludingData() { long heapSize = EMPTY_SIZE + clustering.unsharedHeapSizeExcludingData() + BTree.sizeOfStructureOnHeap(btree); for (ColumnData cd : this) heapSize += cd.unsharedHeapSizeExcludingData(); return heapSize; }
public long unsharedHeapSizeExcludingData() { long heapSize = EMPTY_SIZE + clustering.unsharedHeapSizeExcludingData() + BTree.sizeOfStructureOnHeap(btree); for (ColumnData cd : this) heapSize += cd.unsharedHeapSizeExcludingData(); return heapSize; }
public static long sizeOfStructureOnHeap(Object[] tree) { long size = ObjectSizes.sizeOfArray(tree); if (isLeaf(tree)) return size; for (int i = getChildStart(tree) ; i < getChildEnd(tree) ; i++) size += sizeOfStructureOnHeap((Object[]) tree[i]); return size; }
public static long sizeOfStructureOnHeap(Object[] tree) { long size = ObjectSizes.sizeOfArray(tree); if (isLeaf(tree)) return size; for (int i = getChildStart(tree) ; i < getChildEnd(tree) ; i++) size += sizeOfStructureOnHeap((Object[]) tree[i]); return size; }
public static long sizeOfStructureOnHeap(Object[] tree) { long size = ObjectSizes.sizeOfArray(tree); if (isLeaf(tree)) return size; for (int i = getChildStart(tree) ; i < getChildEnd(tree) ; i++) size += sizeOfStructureOnHeap((Object[]) tree[i]); return size; }
public static long sizeOfStructureOnHeap(Object[] tree) { long size = ObjectSizes.sizeOfArray(tree); if (isLeaf(tree)) return size; for (int i = getChildStart(tree) ; i < getChildEnd(tree) ; i++) size += sizeOfStructureOnHeap((Object[]) tree[i]); return size; }