Modifier and Type | Method and Description |
---|---|
Row |
Table.RowPair.getFirst() |
Row |
Table.RowPair.getSecond() |
Row |
Row.next() |
Modifier and Type | Method and Description |
---|---|
Iterator<Row> |
Table.iterator() |
Modifier and Type | Method and Description |
---|---|
void |
Table.addRow(Row row) |
void |
ColumnType.copyFromRows(it.unimi.dsi.fastutil.ints.IntArrayList rows,
Column newColumn,
Row row) |
Modifier and Type | Method and Description |
---|---|
boolean |
Table.detect(Predicate<Row> predicate)
Applies the predicate to each row, and return true if any row returns true
|
void |
Table.doWithRows(Consumer<Row> doable)
Applies the operation in
doable to every row in the table |
Table |
Table.sortOn(Comparator<Row> rowComparator)
Returns a copy of this table sorted using the given comparator
|
Constructor and Description |
---|
RowPair(Row first,
Row second) |
Modifier and Type | Method and Description |
---|---|
void |
SkipColumnType.copyFromRows(it.unimi.dsi.fastutil.ints.IntArrayList rows,
Column newColumn,
Row row) |
Modifier and Type | Method and Description |
---|---|
void |
BooleanColumnType.copyFromRows(it.unimi.dsi.fastutil.ints.IntArrayList rows,
Column newColumn,
Row row) |
Modifier and Type | Method and Description |
---|---|
void |
DateColumnType.copyFromRows(it.unimi.dsi.fastutil.ints.IntArrayList rows,
Column newColumn,
Row row) |
Modifier and Type | Method and Description |
---|---|
void |
DateTimeColumnType.copyFromRows(it.unimi.dsi.fastutil.ints.IntArrayList rows,
Column newColumn,
Row row) |
Modifier and Type | Method and Description |
---|---|
void |
DoubleColumnType.copyFromRows(it.unimi.dsi.fastutil.ints.IntArrayList rows,
Column newColumn,
Row row) |
Modifier and Type | Method and Description |
---|---|
void |
StringColumnType.copyFromRows(it.unimi.dsi.fastutil.ints.IntArrayList rows,
Column newColumn,
Row row) |
Modifier and Type | Method and Description |
---|---|
void |
TimeColumnType.copyFromRows(it.unimi.dsi.fastutil.ints.IntArrayList rows,
Column newColumn,
Row row) |
Copyright © 2018. All rights reserved.