Table.cpp 7.5 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257
  1. /*
  2. * Copyright (c) 2020, the SerenityOS developers.
  3. *
  4. * SPDX-License-Identifier: BSD-2-Clause
  5. */
  6. #include <AK/Debug.h>
  7. #include <AK/StringBuilder.h>
  8. #include <LibMarkdown/Table.h>
  9. #include <LibMarkdown/Visitor.h>
  10. namespace Markdown {
  11. String Table::render_for_terminal(size_t view_width) const
  12. {
  13. auto unit_width_length = view_width == 0 ? 4 : ((float)(view_width - m_columns.size()) / (float)m_total_width);
  14. StringBuilder builder;
  15. auto write_aligned = [&](const auto& text, auto width, auto alignment) {
  16. size_t original_length = text.terminal_length();
  17. auto string = text.render_for_terminal();
  18. if (alignment == Alignment::Center) {
  19. auto padding_length = (width - original_length) / 2;
  20. // FIXME: We're using a StringView literal to bypass the compile-time AK::Format checking here, since it can't handle the "}}"
  21. builder.appendff("{:{1}}"sv, "", (int)padding_length);
  22. builder.append(string);
  23. builder.appendff("{:{1}}"sv, "", (int)padding_length);
  24. if ((width - original_length) % 2)
  25. builder.append(' ');
  26. } else {
  27. // FIXME: We're using StringView literals to bypass the compile-time AK::Format checking here, since it can't handle the "}}"
  28. builder.appendff(alignment == Alignment::Left ? "{:<{1}}"sv : "{:>{1}}"sv, string, (int)(width + (string.length() - original_length)));
  29. }
  30. };
  31. bool first = true;
  32. for (auto& col : m_columns) {
  33. if (!first)
  34. builder.append('|');
  35. first = false;
  36. size_t width = col.relative_width * unit_width_length;
  37. write_aligned(col.header, width, col.alignment);
  38. }
  39. builder.append("\n");
  40. for (size_t i = 0; i < view_width; ++i)
  41. builder.append('-');
  42. builder.append("\n");
  43. for (size_t i = 0; i < m_row_count; ++i) {
  44. bool first = true;
  45. for (auto& col : m_columns) {
  46. VERIFY(i < col.rows.size());
  47. auto& cell = col.rows[i];
  48. if (!first)
  49. builder.append('|');
  50. first = false;
  51. size_t width = col.relative_width * unit_width_length;
  52. write_aligned(cell, width, col.alignment);
  53. }
  54. builder.append("\n");
  55. }
  56. return builder.to_string();
  57. }
  58. String Table::render_to_html(bool) const
  59. {
  60. auto alignment_string = [](Alignment alignment) {
  61. switch (alignment) {
  62. case Alignment::Center:
  63. return "center"sv;
  64. case Alignment::Left:
  65. return "left"sv;
  66. case Alignment::Right:
  67. return "right"sv;
  68. }
  69. VERIFY_NOT_REACHED();
  70. };
  71. StringBuilder builder;
  72. builder.append("<table>");
  73. builder.append("<thead>");
  74. builder.append("<tr>");
  75. for (auto& column : m_columns) {
  76. builder.appendff("<th style='text-align: {}'>", alignment_string(column.alignment));
  77. builder.append(column.header.render_to_html());
  78. builder.append("</th>");
  79. }
  80. builder.append("</tr>");
  81. builder.append("</thead>");
  82. builder.append("<tbody>");
  83. for (size_t i = 0; i < m_row_count; ++i) {
  84. builder.append("<tr>");
  85. for (auto& column : m_columns) {
  86. VERIFY(i < column.rows.size());
  87. builder.appendff("<td style='text-align: {}'>", alignment_string(column.alignment));
  88. builder.append(column.rows[i].render_to_html());
  89. builder.append("</td>");
  90. }
  91. builder.append("</tr>");
  92. }
  93. builder.append("</tbody>");
  94. builder.append("</table>");
  95. return builder.to_string();
  96. }
  97. RecursionDecision Table::walk(Visitor& visitor) const
  98. {
  99. RecursionDecision rd = visitor.visit(*this);
  100. if (rd != RecursionDecision::Recurse)
  101. return rd;
  102. for (auto const& column : m_columns) {
  103. rd = column.walk(visitor);
  104. if (rd == RecursionDecision::Break)
  105. return rd;
  106. }
  107. return RecursionDecision::Continue;
  108. }
  109. OwnPtr<Table> Table::parse(LineIterator& lines)
  110. {
  111. auto peek_it = lines;
  112. auto first_line = *peek_it;
  113. if (!first_line.starts_with('|'))
  114. return {};
  115. ++peek_it;
  116. if (peek_it.is_end())
  117. return {};
  118. auto header_segments = first_line.split_view('|', true);
  119. auto header_delimiters = peek_it->split_view('|', true);
  120. if (!header_segments.is_empty())
  121. header_segments.take_first();
  122. if (!header_segments.is_empty() && header_segments.last().is_empty())
  123. header_segments.take_last();
  124. if (!header_delimiters.is_empty())
  125. header_delimiters.take_first();
  126. if (!header_delimiters.is_empty() && header_delimiters.last().is_empty())
  127. header_delimiters.take_last();
  128. ++peek_it;
  129. if (header_delimiters.size() != header_segments.size())
  130. return {};
  131. if (header_delimiters.is_empty())
  132. return {};
  133. size_t total_width = 0;
  134. auto table = make<Table>();
  135. table->m_columns.resize(header_delimiters.size());
  136. for (size_t i = 0; i < header_segments.size(); ++i) {
  137. auto text = Text::parse(header_segments[i]);
  138. auto& column = table->m_columns[i];
  139. column.header = move(text);
  140. auto delimiter = header_delimiters[i].trim_whitespace();
  141. auto align_left = delimiter.starts_with(':');
  142. auto align_right = delimiter != ":" && delimiter.ends_with(':');
  143. if (align_left)
  144. delimiter = delimiter.substring_view(1, delimiter.length() - 1);
  145. if (align_right)
  146. delimiter = delimiter.substring_view(0, delimiter.length() - 1);
  147. if (align_left && align_right)
  148. column.alignment = Alignment::Center;
  149. else if (align_right)
  150. column.alignment = Alignment::Right;
  151. else
  152. column.alignment = Alignment::Left;
  153. size_t relative_width = delimiter.length();
  154. for (auto ch : delimiter) {
  155. if (ch != '-') {
  156. dbgln_if(MARKDOWN_DEBUG, "Invalid character _{}_ in table heading delimiter (ignored)", ch);
  157. --relative_width;
  158. }
  159. }
  160. column.relative_width = relative_width;
  161. total_width += relative_width;
  162. }
  163. table->m_total_width = total_width;
  164. for (off_t i = 0; i < peek_it - lines; ++i)
  165. ++lines;
  166. size_t row_count = 0;
  167. ++lines;
  168. while (!lines.is_end()) {
  169. auto line = *lines;
  170. if (!line.starts_with('|'))
  171. break;
  172. ++lines;
  173. auto segments = line.split_view('|', true);
  174. segments.take_first();
  175. if (!segments.is_empty() && segments.last().is_empty())
  176. segments.take_last();
  177. ++row_count;
  178. for (size_t i = 0; i < header_segments.size(); ++i) {
  179. if (i >= segments.size()) {
  180. // Ran out of segments, but still have headers.
  181. // Just make an empty cell.
  182. table->m_columns[i].rows.append(Text::parse(""));
  183. } else {
  184. auto text = Text::parse(segments[i]);
  185. table->m_columns[i].rows.append(move(text));
  186. }
  187. }
  188. }
  189. table->m_row_count = row_count;
  190. return table;
  191. }
  192. RecursionDecision Table::Column::walk(Visitor& visitor) const
  193. {
  194. RecursionDecision rd = visitor.visit(*this);
  195. if (rd != RecursionDecision::Recurse)
  196. return rd;
  197. rd = header.walk(visitor);
  198. if (rd != RecursionDecision::Recurse)
  199. return rd;
  200. for (auto const& row : rows) {
  201. rd = row.walk(visitor);
  202. if (rd == RecursionDecision::Break)
  203. return rd;
  204. }
  205. return RecursionDecision::Continue;
  206. }
  207. }