public void apply(Consumer<ColumnData> function, boolean reversed) { BTree.apply(btree, function, reversed); }
/** * Apply a function to each column definition in forwards or reversed order. * @param function * @param reversed */ public void apply(Consumer<ColumnDefinition> function, boolean reversed) { BTree.apply(columns, function, reversed); }
/** * Apply a function to each column definition in forwards or reversed order. * @param function * @param reversed */ public void apply(Consumer<ColumnDefinition> function, boolean reversed) { BTree.apply(columns, function, reversed); }
public void apply(Consumer<ColumnData> function, boolean reversed) { BTree.apply(btree, function, reversed); }
public void apply(Consumer<ColumnData> function, boolean reversed) { BTree.apply(btree, function, reversed); }
/** * Apply a function to each column definition in forwards or reversed order. * @param function * @param reversed */ public void apply(Consumer<ColumnDefinition> function, boolean reversed) { BTree.apply(columns, function, reversed); }
/** * Apply a function to each column definition in forwards or reversed order. * @param function * @param reversed */ public void apply(Consumer<ColumnDefinition> function, boolean reversed) { BTree.apply(columns, function, reversed); }
public void apply(Consumer<ColumnData> funtion, com.google.common.base.Predicate<ColumnData> stopCondition, boolean reversed) { BTree.apply(btree, funtion, stopCondition, reversed); }
public void apply(Consumer<ColumnData> funtion, com.google.common.base.Predicate<ColumnData> stopCondition, boolean reversed) { BTree.apply(btree, funtion, stopCondition, reversed); }
public void apply(Consumer<ColumnData> funtion, com.google.common.base.Predicate<ColumnData> stopCondition, boolean reversed) { BTree.apply(btree, funtion, stopCondition, reversed); }
public void apply(Consumer<ColumnData> funtion, com.google.common.base.Predicate<ColumnData> stopCondition, boolean reversed) { BTree.apply(btree, funtion, stopCondition, reversed); }
public void apply(Consumer<ColumnData> function, boolean reversed) { BTree.apply(btree, function, reversed); }
private static int minDeletionTime(Object[] btree, LivenessInfo info, DeletionTime rowDeletion) { //we have to wrap this for the lambda final WrappedInt min = new WrappedInt(Math.min(minDeletionTime(info), minDeletionTime(rowDeletion))); BTree.<ColumnData>apply(btree, cd -> min.set( Math.min(min.get(), minDeletionTime(cd)) ), cd -> min.get() == Integer.MIN_VALUE, false); return min.get(); }
private static int minDeletionTime(Object[] btree, LivenessInfo info, DeletionTime rowDeletion) { //we have to wrap this for the lambda final WrappedInt min = new WrappedInt(Math.min(minDeletionTime(info), minDeletionTime(rowDeletion))); BTree.<ColumnData>apply(btree, cd -> min.set( Math.min(min.get(), minDeletionTime(cd)) ), cd -> min.get() == Integer.MIN_VALUE, false); return min.get(); }
private static int minDeletionTime(Object[] btree, LivenessInfo info, DeletionTime rowDeletion) { //we have to wrap this for the lambda final WrappedInt min = new WrappedInt(Math.min(minDeletionTime(info), minDeletionTime(rowDeletion))); BTree.<ColumnData>apply(btree, cd -> min.set( Math.min(min.get(), minDeletionTime(cd)) ), cd -> min.get() == Integer.MIN_VALUE, false); return min.get(); }
private static int minDeletionTime(Object[] btree, LivenessInfo info, DeletionTime rowDeletion) { //we have to wrap this for the lambda final WrappedInt min = new WrappedInt(Math.min(minDeletionTime(info), minDeletionTime(rowDeletion))); BTree.<ColumnData>apply(btree, cd -> min.set( Math.min(min.get(), minDeletionTime(cd)) ), cd -> min.get() == Integer.MIN_VALUE, false); return min.get(); }