/**
* @brief Convenience method to construct a logical tile wrapping a tile group.
* @param tile_group Tile group to be wrapped.
*
* @return Logical tile wrapping tile group.
*/
LogicalTile *LogicalTileFactory::WrapTileGroup(
const std::shared_ptr<storage::TileGroup> &tile_group) {
std::unique_ptr<LogicalTile> new_tile(new LogicalTile());
const int position_list_idx = 0;
new_tile->AddPositionList(
CreateIdentityPositionList(tile_group->GetActiveTupleCount()));
// Construct schema.
std::vector<catalog::Schema> &schemas = tile_group->GetTileSchemas();
PELOTON_ASSERT(schemas.size() == tile_group->NumTiles());
for (unsigned int i = 0; i < schemas.size(); i++) {
auto base_tile_ref = tile_group->GetTileReference(i);
for (oid_t col_id = 0; col_id < schemas[i].GetColumnCount(); col_id++) {
new_tile->AddColumn(base_tile_ref, col_id, position_list_idx);
}
}
return new_tile.release();
}
/**
* @brief Convenience method to construct a logical tile wrapping a tile group.
* @param tile_group Tile group to be wrapped.
*
* @return Logical tile wrapping tile group.
*/
LogicalTile *LogicalTileFactory::WrapTileGroup(
const std::shared_ptr<storage::TileGroup> &tile_group) {
std::unique_ptr<LogicalTile> new_tile(new LogicalTile());
const int position_list_idx = 0;
new_tile->AddPositionList(
CreateIdentityPositionList(tile_group->GetActiveTupleCount()));
// Construct schema.
unsigned int num_tiles = tile_group->NumTiles();
for (unsigned int i = 0; i < num_tiles; i++) {
auto base_tile_ref = tile_group->GetTileReference(i);
auto schema = base_tile_ref->GetSchema();
for (oid_t col_id = 0; col_id < schema->GetColumnCount(); col_id++) {
new_tile->AddColumn(base_tile_ref, col_id, position_list_idx);
}
}
return new_tile.release();
}
/**
* @brief Convenience method to construct a logical tile wrapping base tiles.
* @param base_tiles Base tiles to be represented as a logical tile.
*
* @return Pointer to newly created logical tile.
*/
LogicalTile *LogicalTileFactory::WrapTiles(
const std::vector<std::shared_ptr<storage::Tile>> &base_tile_refs) {
PELOTON_ASSERT(base_tile_refs.size() > 0);
// TODO ASSERT all base tiles have the same height.
std::unique_ptr<LogicalTile> new_tile(new LogicalTile());
// First, we build a position list to be shared by all the tiles.
const oid_t position_list_idx = 0;
new_tile->AddPositionList(CreateIdentityPositionList(
base_tile_refs[0].get()->GetActiveTupleCount()));
for (unsigned int i = 0; i < base_tile_refs.size(); i++) {
// Next, we construct the schema.
int column_count = base_tile_refs[i].get()->GetColumnCount();
for (int col_id = 0; col_id < column_count; col_id++) {
new_tile->AddColumn(base_tile_refs[i], col_id, position_list_idx);
}
}
// Drop reference because we created the base tile
return new_tile.release();
}
