62893a54cc
Table row layout is now split into two phases: 1. Compute all the column widths (even taking colspan into account!) 2. Place all cells at the correct x,y offsets based on column widths. Both phases visit all rows and all cells.
94 lines
3.1 KiB
C++
94 lines
3.1 KiB
C++
/*
|
|
* Copyright (c) 2018-2020, Andreas Kling <kling@serenityos.org>
|
|
* All rights reserved.
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted provided that the following conditions are met:
|
|
*
|
|
* 1. Redistributions of source code must retain the above copyright notice, this
|
|
* list of conditions and the following disclaimer.
|
|
*
|
|
* 2. Redistributions in binary form must reproduce the above copyright notice,
|
|
* this list of conditions and the following disclaimer in the documentation
|
|
* and/or other materials provided with the distribution.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
|
|
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
|
|
* DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
|
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
|
|
* SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
|
|
* CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
|
|
* OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
|
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
*/
|
|
|
|
#include <LibWeb/DOM/Element.h>
|
|
#include <LibWeb/Layout/LayoutTableCell.h>
|
|
#include <LibWeb/Layout/LayoutTableRow.h>
|
|
|
|
namespace Web {
|
|
|
|
LayoutTableRow::LayoutTableRow(const Element& element, NonnullRefPtr<StyleProperties> style)
|
|
: LayoutBox(&element, move(style))
|
|
{
|
|
}
|
|
|
|
LayoutTableRow::~LayoutTableRow()
|
|
{
|
|
}
|
|
|
|
void LayoutTableRow::layout(LayoutMode)
|
|
{
|
|
}
|
|
|
|
void LayoutTableRow::calculate_column_widths(Vector<float>& column_widths)
|
|
{
|
|
size_t column_index = 0;
|
|
for_each_child_of_type<LayoutTableCell>([&](auto& cell) {
|
|
cell.layout(LayoutMode::OnlyRequiredLineBreaks);
|
|
column_widths[column_index] = max(column_widths[column_index], cell.width());
|
|
column_index += cell.colspan();
|
|
});
|
|
}
|
|
|
|
void LayoutTableRow::layout_row(const Vector<float>& column_widths)
|
|
{
|
|
size_t column_index = 0;
|
|
float tallest_cell_height = 0;
|
|
float content_width = 0;
|
|
|
|
for_each_child_of_type<LayoutTableCell>([&](auto& cell) {
|
|
cell.set_offset(effective_offset().translated(content_width, 0));
|
|
|
|
size_t cell_colspan = cell.colspan();
|
|
for (size_t i = 0; i < cell_colspan; ++i)
|
|
content_width += column_widths[column_index++];
|
|
tallest_cell_height = max(tallest_cell_height, cell.height());
|
|
});
|
|
set_width(content_width);
|
|
set_height(tallest_cell_height);
|
|
}
|
|
|
|
LayoutTableCell* LayoutTableRow::first_cell()
|
|
{
|
|
return first_child_of_type<LayoutTableCell>();
|
|
}
|
|
|
|
const LayoutTableCell* LayoutTableRow::first_cell() const
|
|
{
|
|
return first_child_of_type<LayoutTableCell>();
|
|
}
|
|
|
|
LayoutTableRow* LayoutTableRow::next_row()
|
|
{
|
|
return next_sibling_of_type<LayoutTableRow>();
|
|
}
|
|
|
|
const LayoutTableRow* LayoutTableRow::next_row() const
|
|
{
|
|
return next_sibling_of_type<LayoutTableRow>();
|
|
}
|
|
|
|
}
|