/** * Whether this columns is empty. * * @return whether this columns is empty. */ public boolean isEmpty() { return BTree.isEmpty(columns); }
@Override public boolean isEmpty() { return BTree.isEmpty(tree); }
@Override public boolean isEmpty() { return BTree.isEmpty(tree); }
/** * Whether this columns is empty. * * @return whether this columns is empty. */ public boolean isEmpty() { return BTree.isEmpty(columns); }
public boolean hasRows() { Holder holder = holder(); return !BTree.isEmpty(holder.tree); }
public boolean hasRows() { Holder holder = holder(); return !BTree.isEmpty(holder.tree); }
public boolean hasRows() { Holder holder = holder(); return !BTree.isEmpty(holder.tree); }
public boolean hasRows() { Holder holder = holder(); return !BTree.isEmpty(holder.tree); }
private ComplexColumnData transformAndFilter(DeletionTime newDeletion, Function<? super Cell, ? extends Cell> function) { Object[] transformed = BTree.transformAndFilter(cells, function); if (cells == transformed && newDeletion == complexDeletion) return this; if (newDeletion == DeletionTime.LIVE && BTree.isEmpty(transformed)) return null; return new ComplexColumnData(column, transformed, newDeletion); }
private ComplexColumnData transformAndFilter(DeletionTime newDeletion, Function<? super Cell, ? extends Cell> function) { Object[] transformed = BTree.transformAndFilter(cells, function); if (cells == transformed && newDeletion == complexDeletion) return this; if (newDeletion == DeletionTime.LIVE && BTree.isEmpty(transformed)) return null; return new ComplexColumnData(column, transformed, newDeletion); }
private ComplexColumnData transformAndFilter(DeletionTime newDeletion, Function<? super Cell, ? extends Cell> function) { Object[] transformed = BTree.transformAndFilter(cells, function); if (cells == transformed && newDeletion == complexDeletion) return this; if (newDeletion == DeletionTime.LIVE && BTree.isEmpty(transformed)) return null; return new ComplexColumnData(column, transformed, newDeletion); }
public boolean isEmpty() { Holder holder = holder(); return holder.deletionInfo.isLive() && BTree.isEmpty(holder.tree) && holder.staticRow.isEmpty(); }
public boolean isEmpty() { Holder holder = holder(); return holder.deletionInfo.isLive() && BTree.isEmpty(holder.tree) && holder.staticRow.isEmpty(); }
public Row lastRow() { Object[] tree = holder().tree; if (BTree.isEmpty(tree)) return null; return BTree.findByIndex(tree, BTree.size(tree) - 1); } }
private static int findFirstComplexIdx(Object[] tree) { // have fast path for common no-complex case int size = BTree.size(tree); if (!BTree.isEmpty(tree) && BTree.<ColumnDefinition>findByIndex(tree, size - 1).isSimple()) return size; return BTree.ceilIndex(tree, Comparator.naturalOrder(), FIRST_COMPLEX); }
private static int findFirstComplexIdx(Object[] tree) { // have fast path for common no-complex case int size = BTree.size(tree); if (!BTree.isEmpty(tree) && BTree.<ColumnDefinition>findByIndex(tree, size - 1).isSimple()) return size; return BTree.ceilIndex(tree, Comparator.naturalOrder(), FIRST_COMPLEX); }
public boolean isEmpty() { return primaryKeyLivenessInfo().isEmpty() && deletion().isLive() && BTree.isEmpty(btree); }
public boolean isEmpty() { return primaryKeyLivenessInfo().isEmpty() && deletion().isLive() && BTree.isEmpty(btree); }
private Row transformAndFilter(LivenessInfo info, Deletion deletion, Function<ColumnData, ColumnData> function) { Object[] transformed = BTree.transformAndFilter(btree, function); if (btree == transformed && info == this.primaryKeyLivenessInfo && deletion == this.deletion) return this; if (info.isEmpty() && deletion.isLive() && BTree.isEmpty(transformed)) return null; int minDeletionTime = minDeletionTime(transformed, info, deletion.time()); return BTreeRow.create(clustering, info, deletion, transformed, minDeletionTime); }
private Row transformAndFilter(LivenessInfo info, Deletion deletion, Function<ColumnData, ColumnData> function) { Object[] transformed = BTree.transformAndFilter(btree, function); if (btree == transformed && info == this.primaryKeyLivenessInfo && deletion == this.deletion) return this; if (info.isEmpty() && deletion.isLive() && BTree.isEmpty(transformed)) return null; int minDeletionTime = minDeletionTime(transformed, info, deletion.time()); return BTreeRow.create(clustering, info, deletion, transformed, minDeletionTime); }