LayoutTableDetails.cpp 22 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664
  1. /*
  2. * This source file is part of RmlUi, the HTML/CSS Interface Middleware
  3. *
  4. * For the latest information, see http://github.com/mikke89/RmlUi
  5. *
  6. * Copyright (c) 2008-2010 CodePoint Ltd, Shift Technology Ltd
  7. * Copyright (c) 2019 The RmlUi Team, and contributors
  8. *
  9. * Permission is hereby granted, free of charge, to any person obtaining a copy
  10. * of this software and associated documentation files (the "Software"), to deal
  11. * in the Software without restriction, including without limitation the rights
  12. * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
  13. * copies of the Software, and to permit persons to whom the Software is
  14. * furnished to do so, subject to the following conditions:
  15. *
  16. * The above copyright notice and this permission notice shall be included in
  17. * all copies or substantial portions of the Software.
  18. *
  19. * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
  20. * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
  21. * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
  22. * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
  23. * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
  24. * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
  25. * THE SOFTWARE.
  26. *
  27. */
  28. #include "LayoutTableDetails.h"
  29. #include "../../Include/RmlUi/Core/ComputedValues.h"
  30. #include "../../Include/RmlUi/Core/Element.h"
  31. #include "LayoutDetails.h"
  32. #include <algorithm>
  33. #include <float.h>
  34. namespace Rml {
  35. bool TableGrid::Build(Element* element_table)
  36. {
  37. ElementList non_parented_cell_elements;
  38. const int num_table_children = element_table->GetNumChildren();
  39. for (int i = 0; i < num_table_children; i++)
  40. {
  41. using Display = Style::Display;
  42. Element* element = element_table->GetChild(i);
  43. const Display display = element->GetDisplay();
  44. if (display == Display::None)
  45. continue;
  46. if (!non_parented_cell_elements.empty() && display != Display::TableCell)
  47. {
  48. PushRow(nullptr, std::move(non_parented_cell_elements));
  49. non_parented_cell_elements.clear();
  50. }
  51. if (display == Display::TableCell)
  52. {
  53. non_parented_cell_elements.push_back(element);
  54. }
  55. else if (display == Display::TableRow)
  56. {
  57. PushRow(element, {});
  58. }
  59. else if (display == Display::TableRowGroup)
  60. {
  61. const int num_row_group_children = element->GetNumChildren();
  62. const int row_group_index = (int)rows.size();
  63. int num_rows_added = 0;
  64. for (int j = 0; j < num_row_group_children; j++)
  65. {
  66. using Display = Style::Display;
  67. Element* element_row = element->GetChild(j);
  68. const Display display_row = element_row->GetDisplay();
  69. if (display_row != Display::TableRow)
  70. {
  71. if (display_row != Display::None)
  72. {
  73. Log::Message(Log::LT_WARNING, "Only table rows are valid children of table row groups. Ignoring element %s.", element_row->GetAddress().c_str());
  74. }
  75. continue;
  76. }
  77. PushRow(element_row, {});
  78. num_rows_added += 1;
  79. }
  80. if (num_rows_added > 0)
  81. {
  82. rows[row_group_index].element_group = element;
  83. rows[row_group_index].group_span = num_rows_added;
  84. }
  85. }
  86. else if (rows.empty() && display == Display::TableColumn)
  87. {
  88. const int span = Math::Max(1, element->GetAttribute("span", 1));
  89. PushColumn(element, span);
  90. }
  91. else if (rows.empty() && display == Display::TableColumnGroup)
  92. {
  93. PushColumnGroup(element);
  94. }
  95. else
  96. {
  97. if (display == Display::TableColumn || display == Display::TableColumnGroup)
  98. Log::Message(Log::LT_WARNING, "Table columns and column groups must precede any table rows. Ignoring element %s.", element->GetAddress().c_str());
  99. else
  100. Log::Message(Log::LT_WARNING, "Only table columns, column groups, rows, row groups, and cells are valid children of tables. Ignoring element %s.", element->GetAddress().c_str());
  101. }
  102. }
  103. if (!non_parented_cell_elements.empty())
  104. {
  105. PushRow(nullptr, std::move(non_parented_cell_elements));
  106. non_parented_cell_elements.clear();
  107. }
  108. // Sort cells by the last row they span.
  109. std::sort(cells.begin(), cells.end(), [](const Cell& a, const Cell& b) {
  110. return a.row_last < b.row_last;
  111. });
  112. if (!open_cells.empty())
  113. {
  114. Log::Message(Log::LT_WARNING, "One or more cells span below the last row in table %s. They will not be formatted. Add additional rows, or adjust the rowspan attribute.", element_table->GetAddress().c_str());
  115. }
  116. open_cells.clear();
  117. open_cells.shrink_to_fit();
  118. return true;
  119. }
  120. void TableGrid::PushColumn(Element* element_column, int span)
  121. {
  122. Column column;
  123. column.element_column = element_column;
  124. column.column_span = span;
  125. columns.push_back(column);
  126. for (int j = 1; j < span; j++)
  127. columns.push_back({});
  128. }
  129. void TableGrid::PushColumnGroup(Element* element_column_group)
  130. {
  131. const int column_begin = (int)columns.size();
  132. int group_span = Math::Max(0, element_column_group->GetAttribute("span", 0));
  133. if (group_span == 0)
  134. {
  135. // Look through the column group to find all its column children.
  136. const int num_column_group_children = element_column_group->GetNumChildren();
  137. for (int j = 0; j < num_column_group_children; j++)
  138. {
  139. Element* child = element_column_group->GetChild(j);
  140. if (child->GetDisplay() == Style::Display::TableColumn)
  141. {
  142. const int column_span = Math::Max(1, child->GetAttribute("span", 1));
  143. PushColumn(child, column_span);
  144. group_span += column_span;
  145. }
  146. }
  147. }
  148. else
  149. {
  150. // Push empty columns, the group properties are filled below.
  151. for (int j = 0; j < group_span; j++)
  152. columns.push_back({});
  153. }
  154. if (group_span > 0)
  155. {
  156. columns[column_begin].element_group = element_column_group;
  157. columns[column_begin].group_span = group_span;
  158. }
  159. }
  160. void TableGrid::PushOrMergeColumnsFromFirstRow(Element* element_cell, int column_begin, int span)
  161. {
  162. for (int column_index = column_begin; column_index < column_begin + span; column_index++)
  163. {
  164. Column* column = nullptr;
  165. if (column_index < (int)columns.size())
  166. {
  167. column = &columns[column_index];
  168. }
  169. else
  170. {
  171. RMLUI_ASSERT(column_index == (int)columns.size());
  172. columns.push_back({});
  173. column = &columns.back();
  174. }
  175. if (column_index == column_begin)
  176. {
  177. column->element_cell = element_cell;
  178. column->cell_span = span;
  179. }
  180. }
  181. }
  182. void TableGrid::PushRow(Element* element_row, ElementList cell_elements)
  183. {
  184. const int row_index = (int)rows.size();
  185. if (element_row)
  186. {
  187. RMLUI_ASSERT(cell_elements.empty());
  188. const int num_row_children = element_row->GetNumChildren();
  189. cell_elements.reserve(num_row_children);
  190. for (int j = 0; j < num_row_children; j++)
  191. {
  192. Element* element_cell = element_row->GetChild(j);
  193. const Style::Display cell_display = element_cell->GetComputedValues().display();
  194. if (cell_display == Style::Display::TableCell)
  195. {
  196. cell_elements.push_back(element_cell);
  197. }
  198. else if (cell_display != Style::Display::None)
  199. {
  200. Log::Message(Log::LT_WARNING, "Only table cells are allowed as children of table rows. %s", element_cell->GetAddress().c_str());
  201. }
  202. }
  203. }
  204. rows.push_back(Row{ element_row, nullptr, 0 });
  205. const int num_cells_spanning_this_row = (int)open_cells.size();
  206. // For all child cell elements of this row, add them to the list of open cells.
  207. for (int j = 0, column = 0; j < (int)cell_elements.size(); j++)
  208. {
  209. Element* element_cell = cell_elements[j];
  210. const int row_span = Math::Max(1, element_cell->GetAttribute("rowspan", 1));
  211. const int col_span = Math::Max(1, element_cell->GetAttribute("colspan", 1));
  212. if (row_index == 0)
  213. {
  214. // This is the first row. The cells of this row along with previous <col> elements define the columns.
  215. PushOrMergeColumnsFromFirstRow(element_cell, column, col_span);
  216. }
  217. // Offset the column if we have any rowspan elements from previous rows overlapping with the current column.
  218. for (bool continue_offset_column = true; continue_offset_column; )
  219. {
  220. continue_offset_column = false;
  221. for (int k = 0; k < num_cells_spanning_this_row; k++)
  222. {
  223. if (column >= open_cells[k].column_begin && column <= open_cells[k].column_last)
  224. {
  225. column = open_cells[k].column_last + 1;
  226. continue_offset_column = true;
  227. break;
  228. }
  229. }
  230. }
  231. const int column_last = column + col_span - 1;
  232. if (column_last >= (int)columns.size())
  233. {
  234. Log::Message(Log::LT_WARNING, "Too many columns in table row %d while encountering cell: %s\nThe number of columns is %d, as determined by the table columns or the first table row.",
  235. row_index + 1, element_cell->GetAddress().c_str(), (int)columns.size());
  236. break;
  237. }
  238. // Add the new cell to our list.
  239. open_cells.emplace_back();
  240. Cell& cell = open_cells.back();
  241. cell.element_cell = element_cell;
  242. cell.row_begin = row_index;
  243. cell.row_last = row_index + row_span - 1;
  244. cell.column_begin = column;
  245. cell.column_last = column_last;
  246. column += col_span;
  247. }
  248. // Partition the cells to determine those who end at this row.
  249. const auto it_cells_in_row_end = std::partition(open_cells.begin(), open_cells.end(), [row_index](const Cell& cell) { return cell.row_last == row_index; });
  250. // Close cells ending at this row.
  251. cells.insert(cells.end(), open_cells.begin(), it_cells_in_row_end);
  252. open_cells.erase(open_cells.begin(), it_cells_in_row_end);
  253. }
  254. void TracksSizing::GetEdgeSizes(float& margin_a, float& margin_b, float& padding_border_a, float& padding_border_b, const ComputedAxisSize& computed) const
  255. {
  256. LayoutDetails::GetEdgeSizes(margin_a, margin_b, padding_border_a, padding_border_b, computed, table_initial_content_size);
  257. }
  258. void TracksSizing::ApplyGroupElement(const int index, const int span, const ComputedAxisSize& computed)
  259. {
  260. RMLUI_ASSERT(span >= 1 && index + span - 1 < (int)metrics.size());
  261. float margin_a, margin_b;
  262. float padding_border_a, padding_border_b;
  263. GetEdgeSizes(margin_a, margin_b, padding_border_a, padding_border_b, computed);
  264. // Add left/top edges.
  265. TrackMetric& metric_begin = metrics[index];
  266. metric_begin.group_padding_border_a = padding_border_a;
  267. metric_begin.sum_margin_a = margin_a;
  268. // Add right/bottom edges.
  269. TrackMetric& metric_last = metrics[index + span - 1];
  270. metric_last.group_padding_border_b = padding_border_b;
  271. metric_last.sum_margin_b = margin_b;
  272. }
  273. void TracksSizing::ApplyTrackElement(const int index, const int span, const ComputedAxisSize& computed)
  274. {
  275. RMLUI_ASSERT(span >= 1 && index + span - 1 < (int)metrics.size());
  276. float margin_a, margin_b;
  277. float padding_border_a, padding_border_b;
  278. TrackMetric& metric_begin = metrics[index];
  279. // We target the content box because track sizes are defined in terms of the border box of cells, equal to the content size of tracks.
  280. InitializeSize(metric_begin, margin_a, margin_b, padding_border_a, padding_border_b, computed, span, Style::BoxSizing::ContentBox);
  281. // Add left/top edges. Increment the values because we are merging with any previously set edges.
  282. metric_begin.column_padding_border_a += padding_border_a;
  283. metric_begin.sum_margin_a += margin_a;
  284. // Add right/bottom edges.
  285. TrackMetric& metric_last = metrics[index + span - 1];
  286. metric_last.column_padding_border_b += padding_border_b;
  287. metric_last.sum_margin_b += margin_b;
  288. // The size of all spanning tracks are distributed equally.
  289. for (int j = 1; j < span; j++)
  290. {
  291. TrackMetric& metric = metrics[index + j];
  292. metric.sizing_mode = metric_begin.sizing_mode;
  293. metric.fixed_size = metric_begin.fixed_size;
  294. metric.flex_size = metric_begin.flex_size;
  295. metric.min_size = metric_begin.min_size;
  296. metric.max_size = metric_begin.max_size;
  297. }
  298. }
  299. void TracksSizing::ApplyCellElement(const int index, const int span, const ComputedAxisSize& computed)
  300. {
  301. // Merge the metrics of the cell with the existing track: If the existing track
  302. // has auto min-/max-/size, we use the cell's min-/max-/size if it has any.
  303. RMLUI_ASSERT(span >= 1 && index + span - 1 < (int)metrics.size());
  304. float margin_a, margin_b;
  305. float padding_border_a, padding_border_b;
  306. TrackMetric cell_metric;
  307. // We target the border box because track sizes are defined in terms of the border box of cells.
  308. InitializeSize(cell_metric, margin_a, margin_b, padding_border_a, padding_border_b, computed, span, Style::BoxSizing::BorderBox);
  309. cell_metric.sum_margin_a = margin_a;
  310. // Merge the size determined by this cell with any existing track sizes.
  311. for (int j = 0; j < span; j++)
  312. {
  313. if (j == 1)
  314. cell_metric.sum_margin_a = 0;
  315. if (j == span - 1)
  316. cell_metric.sum_margin_b = margin_b;
  317. // Merge the existing track metrics with the cell sizing data.
  318. TrackMetric& destination = metrics[index + j];
  319. if (destination.sizing_mode != TrackSizingMode::Fixed && cell_metric.sizing_mode == TrackSizingMode::Fixed)
  320. {
  321. destination.fixed_size = cell_metric.fixed_size;
  322. destination.flex_size = 0;
  323. destination.sizing_mode = TrackSizingMode::Fixed;
  324. }
  325. if (destination.min_size == 0)
  326. destination.min_size = cell_metric.min_size;
  327. if (destination.max_size == FLT_MAX)
  328. destination.max_size = cell_metric.max_size;
  329. destination.sum_margin_a += cell_metric.sum_margin_a;
  330. destination.sum_margin_b += cell_metric.sum_margin_b;
  331. }
  332. }
  333. void TracksSizing::InitializeSize(TrackMetric& metric, float& margin_a, float& margin_b, float& padding_border_a, float& padding_border_b, const ComputedAxisSize& computed, const int span, const Style::BoxSizing target_box) const
  334. {
  335. RMLUI_ASSERT(span >= 1);
  336. GetEdgeSizes(margin_a, margin_b, padding_border_a, padding_border_b, computed);
  337. const float padding_border_sum = padding_border_a + padding_border_b;
  338. // Find the min/max size.
  339. metric.min_size = ResolveValue(computed.min_size, table_initial_content_size);
  340. metric.max_size = (computed.max_size.value < 0.f ? FLT_MAX : ResolveValue(computed.max_size, table_initial_content_size));
  341. if (target_box == Style::BoxSizing::ContentBox && computed.box_sizing == Style::BoxSizing::BorderBox)
  342. {
  343. metric.min_size = Math::Max(0.0f, metric.min_size - padding_border_sum);
  344. if (metric.max_size < FLT_MAX)
  345. metric.max_size = Math::Max(0.0f, metric.max_size - padding_border_sum);
  346. }
  347. else if (target_box == Style::BoxSizing::BorderBox && computed.box_sizing == Style::BoxSizing::ContentBox)
  348. {
  349. if (metric.min_size > 0)
  350. metric.min_size += padding_border_sum;
  351. if (metric.max_size < FLT_MAX)
  352. metric.max_size += padding_border_sum;
  353. }
  354. // Find fixed and flexible sizes.
  355. if (computed.size.type == Style::LengthPercentageAuto::Auto)
  356. {
  357. metric.sizing_mode = TrackSizingMode::Auto;
  358. }
  359. else if (computed.size.type == Style::LengthPercentageAuto::Percentage && computed.size.value >= 100.f)
  360. {
  361. // Percentages >= 100% are resolved as flexible size.
  362. metric.sizing_mode = TrackSizingMode::Flexible;
  363. metric.flex_size = Math::Max(0.01f * computed.size.value / float(span), 0.f);
  364. }
  365. else
  366. {
  367. float width = ResolveValue(computed.size, table_initial_content_size);
  368. if (target_box == Style::BoxSizing::ContentBox && computed.box_sizing == Style::BoxSizing::BorderBox)
  369. width = Math::Max(0.f, width - padding_border_sum);
  370. else if (target_box == Style::BoxSizing::BorderBox && computed.box_sizing == Style::BoxSizing::ContentBox)
  371. width += padding_border_sum;
  372. metric.sizing_mode = TrackSizingMode::Fixed;
  373. metric.flex_size = 0;
  374. metric.fixed_size = Math::Clamp(width, metric.min_size, metric.max_size);
  375. metric.min_size = metric.fixed_size;
  376. metric.max_size = metric.fixed_size;
  377. }
  378. if (span > 1)
  379. {
  380. // Account for distribution of fixed size over the tracks we are spanning.
  381. const float width_factor = 1.f / float(span);
  382. metric.fixed_size *= width_factor;
  383. metric.min_size *= width_factor;
  384. if (metric.max_size < FLT_MAX)
  385. metric.max_size *= width_factor;
  386. }
  387. }
  388. void TracksSizing::ResolveFlexibleSize()
  389. {
  390. // The fixed spacing includes the table gaps, and the track and track-group elements' padding, border, and margins.
  391. float sum_fixed_spacing = table_gap * float((int)metrics.size() - 1);
  392. for (const TrackMetric& metric : metrics)
  393. {
  394. // Any auto size must have been resolved to either fixed or flexible before running this algorithm.
  395. RMLUI_ASSERT(metric.sizing_mode == TrackSizingMode::Fixed || metric.sizing_mode == TrackSizingMode::Flexible);
  396. sum_fixed_spacing += metric.column_padding_border_a + metric.column_padding_border_b;
  397. sum_fixed_spacing += metric.group_padding_border_a + metric.group_padding_border_a;
  398. sum_fixed_spacing += metric.sum_margin_a + metric.sum_margin_b;
  399. }
  400. float table_available_size = 0.0f;
  401. // Convert any flexible sizes to fixed sizes by filling up the size of the table.
  402. for (bool continue_iteration = true; continue_iteration; )
  403. {
  404. continue_iteration = false;
  405. float fr_to_px_ratio = 0;
  406. // Calculate the fr/px-ratio. [fr] is here the unit for flexible width.
  407. {
  408. float sum_fixed_size = sum_fixed_spacing; // [px]
  409. float sum_flex_size = 0; // [fr]
  410. for (const TrackMetric& metric : metrics)
  411. {
  412. sum_flex_size += metric.flex_size;
  413. sum_fixed_size += (metric.flex_size == 0.f ? metric.fixed_size : 0.0f);
  414. }
  415. sum_flex_size = Math::Max(1.f, sum_flex_size);
  416. table_available_size = table_initial_content_size - sum_fixed_size;
  417. fr_to_px_ratio = Math::Max(0.0f, table_available_size) / sum_flex_size;
  418. }
  419. // Iterate through each track and convert flexible size to fixed size.
  420. for (auto& metric : metrics)
  421. {
  422. if (metric.flex_size > 0)
  423. {
  424. const float fixed_flex_size = metric.flex_size * fr_to_px_ratio;
  425. metric.fixed_size = Math::Clamp(fixed_flex_size, metric.min_size, metric.max_size);
  426. table_available_size -= metric.fixed_size;
  427. if (metric.fixed_size != fixed_flex_size)
  428. {
  429. // We met a min/max-constraint, fix the size of this track. Start over with the procedure once we are done with all the tracks.
  430. metric.flex_size = 0.0f;
  431. continue_iteration = true;
  432. }
  433. }
  434. }
  435. }
  436. // If we have distributed all the flexible space, and there is still space available, then distribute the available space over
  437. // the track sizes while respecting max-widths.
  438. if (table_available_size > 0.5f)
  439. {
  440. const int num_tracks = (int)metrics.size();
  441. struct TrackAvailableSize {
  442. int track;
  443. float available_size;
  444. };
  445. Vector<TrackAvailableSize> track_available_sizes(num_tracks);
  446. // Find the available size of all tracks.
  447. for (int i = 0; i < num_tracks; i++)
  448. {
  449. track_available_sizes[i].track = i;
  450. track_available_sizes[i].available_size = metrics[i].max_size - metrics[i].fixed_size;
  451. }
  452. // Sort the tracks by available size, smallest to largest. This lets us "fill up" the most constrained tracks first.
  453. std::sort(track_available_sizes.begin(), track_available_sizes.end(), [](const TrackAvailableSize& c1, const TrackAvailableSize& c2) {
  454. return c1.available_size < c2.available_size;
  455. });
  456. for (int i = 0; i < num_tracks; i++)
  457. {
  458. const int track = track_available_sizes[i].track;
  459. const int num_tracks_remaining = num_tracks - i;
  460. const float ideal_add_track_size = table_available_size / float(num_tracks_remaining);
  461. const float add_track_size = Math::Min(ideal_add_track_size, track_available_sizes[i].available_size);
  462. if (add_track_size > 0)
  463. {
  464. metrics[track].fixed_size += add_track_size;
  465. table_available_size = Math::Max(0.0f, table_available_size - add_track_size);
  466. }
  467. }
  468. }
  469. }
  470. static float InitializeTrackBoxes(TrackBoxList& boxes, const TrackMetricList& metrics, const float table_gap)
  471. {
  472. boxes.resize(metrics.size());
  473. float cursor = 0;
  474. // Walk through all the metrics and populate the track box accordingly.
  475. for (size_t i = 0; i < metrics.size(); i++)
  476. {
  477. TrackBox& box = boxes[i];
  478. const TrackMetric& metric = metrics[i];
  479. box.group_offset = cursor + metric.sum_margin_a;
  480. box.track_offset = box.group_offset + metric.group_padding_border_a;
  481. box.cell_offset = box.track_offset + metric.column_padding_border_a;
  482. // The group and column width will be extended if they span multiple columns (see next loop).
  483. box.group_size = metric.fixed_size + metric.column_padding_border_a + metric.column_padding_border_b;
  484. box.cell_size = metric.fixed_size;
  485. box.track_size = metric.fixed_size;
  486. cursor = box.cell_offset + metric.fixed_size + metric.column_padding_border_b + metric.group_padding_border_b + metric.sum_margin_b;
  487. if (i != metrics.size() - 1)
  488. cursor += table_gap;
  489. }
  490. return cursor;
  491. }
  492. static void SnapTrackBoxesToPixelGrid(TrackBoxList& boxes)
  493. {
  494. for (TrackBox& box : boxes)
  495. {
  496. Math::SnapToPixelGrid(box.cell_offset, box.cell_size);
  497. Math::SnapToPixelGrid(box.track_offset, box.track_size);
  498. Math::SnapToPixelGrid(box.group_offset, box.group_size);
  499. }
  500. }
  501. float BuildColumnBoxes(TrackBoxList& column_boxes, const TrackMetricList& column_metrics, const TableGrid::ColumnList& grid_columns, const float table_gap_x)
  502. {
  503. const float columns_width = InitializeTrackBoxes(column_boxes, column_metrics, table_gap_x);
  504. const int num_columns = (int)column_metrics.size();
  505. // Extend column and column group widths to cover all the columns they span.
  506. for (int i = 0; i < num_columns; i++)
  507. {
  508. const int column_span = grid_columns[i].column_span;
  509. const int group_span = grid_columns[i].group_span;
  510. if (column_span > 1 && i + column_span - 1 < num_columns)
  511. {
  512. TrackBox& metric = column_boxes[i];
  513. TrackBox& metric_last_span = column_boxes[i + column_span - 1];
  514. metric.track_size = metric_last_span.cell_size + (metric_last_span.cell_offset - metric.cell_offset);
  515. }
  516. if (group_span > 1 && i + group_span - 1 < num_columns)
  517. {
  518. TrackBox& metric = column_boxes[i];
  519. TrackBox& metric_last_span = column_boxes[i + group_span - 1];
  520. metric.group_size = metric_last_span.group_size + (metric_last_span.track_offset - metric.track_offset);
  521. }
  522. }
  523. SnapTrackBoxesToPixelGrid(column_boxes);
  524. return columns_width;
  525. }
  526. float BuildRowBoxes(TrackBoxList& row_boxes, const TrackMetricList& row_metrics, const TableGrid::RowList& grid_rows, const float table_gap_y)
  527. {
  528. const float rows_height = InitializeTrackBoxes(row_boxes, row_metrics, table_gap_y);
  529. const int num_rows = (int)row_metrics.size();
  530. // Extend row group heights to cover the all rows they span.
  531. for (int i = 0; i < num_rows; i++)
  532. {
  533. const int group_span = grid_rows[i].group_span;
  534. if (group_span > 1 && i + group_span - 1 < num_rows)
  535. {
  536. TrackBox& metric = row_boxes[i];
  537. TrackBox& metric_last_span = row_boxes[i + group_span - 1];
  538. metric.group_size = metric_last_span.group_size + (metric_last_span.track_offset - metric.track_offset);
  539. }
  540. }
  541. SnapTrackBoxesToPixelGrid(row_boxes);
  542. return rows_height;
  543. }
  544. } // namespace Rml