List.cpp 3.2 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133
  1. /*
  2. * Copyright (c) 2019-2020, Sergey Bugaev <bugaevc@serenityos.org>
  3. *
  4. * SPDX-License-Identifier: BSD-2-Clause
  5. */
  6. #include <AK/StringBuilder.h>
  7. #include <LibMarkdown/List.h>
  8. namespace Markdown {
  9. String List::render_to_html() const
  10. {
  11. StringBuilder builder;
  12. const char* tag = m_is_ordered ? "ol" : "ul";
  13. builder.appendff("<{}>\n", tag);
  14. for (auto& item : m_items) {
  15. builder.append("<li>");
  16. builder.append(item.render_to_html());
  17. builder.append("</li>\n");
  18. }
  19. builder.appendff("</{}>\n", tag);
  20. return builder.build();
  21. }
  22. String List::render_for_terminal(size_t) const
  23. {
  24. StringBuilder builder;
  25. int i = 0;
  26. for (auto& item : m_items) {
  27. builder.append(" ");
  28. if (m_is_ordered)
  29. builder.appendff("{}. ", ++i);
  30. else
  31. builder.append("* ");
  32. builder.append(item.render_for_terminal());
  33. builder.append("\n");
  34. }
  35. builder.append("\n");
  36. return builder.build();
  37. }
  38. OwnPtr<List> List::parse(Vector<StringView>::ConstIterator& lines)
  39. {
  40. Vector<Text> items;
  41. bool is_ordered = false;
  42. bool first = true;
  43. size_t offset = 0;
  44. StringBuilder item_builder;
  45. auto flush_item_if_needed = [&] {
  46. if (first)
  47. return true;
  48. auto text = Text::parse(item_builder.string_view());
  49. items.append(move(text));
  50. item_builder.clear();
  51. return true;
  52. };
  53. while (true) {
  54. if (lines.is_end())
  55. break;
  56. const StringView& line = *lines;
  57. if (line.is_empty())
  58. break;
  59. bool appears_unordered = false;
  60. if (line.length() > 2) {
  61. if (line[1] == ' ' && (line[0] == '*' || line[0] == '-')) {
  62. appears_unordered = true;
  63. offset = 2;
  64. }
  65. }
  66. bool appears_ordered = false;
  67. for (size_t i = 0; i < 10 && i < line.length(); i++) {
  68. char ch = line[i];
  69. if ('0' <= ch && ch <= '9')
  70. continue;
  71. if (ch == '.' || ch == ')')
  72. if (i + 1 < line.length() && line[i + 1] == ' ') {
  73. appears_ordered = true;
  74. offset = i + 1;
  75. }
  76. break;
  77. }
  78. VERIFY(!(appears_unordered && appears_ordered));
  79. if (appears_unordered || appears_ordered) {
  80. if (first)
  81. is_ordered = appears_ordered;
  82. else if (is_ordered != appears_ordered)
  83. return {};
  84. if (!flush_item_if_needed())
  85. return {};
  86. while (offset + 1 < line.length() && line[offset + 1] == ' ')
  87. offset++;
  88. } else {
  89. if (first)
  90. return {};
  91. for (size_t i = 0; i < offset; i++) {
  92. if (line[i] != ' ')
  93. return {};
  94. }
  95. }
  96. first = false;
  97. if (!item_builder.is_empty())
  98. item_builder.append(' ');
  99. VERIFY(offset <= line.length());
  100. item_builder.append(line.substring_view(offset, line.length() - offset));
  101. ++lines;
  102. offset = 0;
  103. }
  104. if (!flush_item_if_needed() || first)
  105. return {};
  106. return make<List>(move(items), is_ordered);
  107. }
  108. }