TextDocument.cpp 35 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119
  1. /*
  2. * Copyright (c) 2018-2020, Andreas Kling <kling@serenityos.org>
  3. * Copyright (c) 2022, the SerenityOS developers.
  4. *
  5. * SPDX-License-Identifier: BSD-2-Clause
  6. */
  7. #include <AK/Badge.h>
  8. #include <AK/CharacterTypes.h>
  9. #include <AK/QuickSort.h>
  10. #include <AK/ScopeGuard.h>
  11. #include <AK/StdLibExtras.h>
  12. #include <AK/StringBuilder.h>
  13. #include <AK/Utf8View.h>
  14. #include <LibCore/Timer.h>
  15. #include <LibGUI/TextDocument.h>
  16. #include <LibRegex/Regex.h>
  17. namespace GUI {
  18. NonnullRefPtr<TextDocument> TextDocument::create(Client* client)
  19. {
  20. return adopt_ref(*new TextDocument(client));
  21. }
  22. TextDocument::TextDocument(Client* client)
  23. {
  24. if (client)
  25. m_clients.set(client);
  26. append_line(make<TextDocumentLine>(*this));
  27. set_unmodified();
  28. m_undo_stack.on_state_change = [this] {
  29. if (m_client_notifications_enabled) {
  30. for (auto* client : m_clients)
  31. client->document_did_update_undo_stack();
  32. }
  33. };
  34. }
  35. bool TextDocument::set_text(StringView text, AllowCallback allow_callback)
  36. {
  37. m_client_notifications_enabled = false;
  38. m_undo_stack.clear();
  39. m_spans.clear();
  40. remove_all_lines();
  41. ArmedScopeGuard clear_text_guard([this]() {
  42. set_text({});
  43. });
  44. size_t start_of_current_line = 0;
  45. auto add_line = [&](size_t current_position) -> bool {
  46. size_t line_length = current_position - start_of_current_line;
  47. auto line = make<TextDocumentLine>(*this);
  48. bool success = true;
  49. if (line_length)
  50. success = line->set_text(*this, text.substring_view(start_of_current_line, current_position - start_of_current_line));
  51. if (!success)
  52. return false;
  53. append_line(move(line));
  54. start_of_current_line = current_position + 1;
  55. return true;
  56. };
  57. size_t i = 0;
  58. for (i = 0; i < text.length(); ++i) {
  59. if (text[i] != '\n')
  60. continue;
  61. auto success = add_line(i);
  62. if (!success)
  63. return false;
  64. }
  65. auto success = add_line(i);
  66. if (!success)
  67. return false;
  68. // Don't show the file's trailing newline as an actual new line.
  69. if (line_count() > 1 && line(line_count() - 1).is_empty())
  70. (void)m_lines.take_last();
  71. m_client_notifications_enabled = true;
  72. for (auto* client : m_clients)
  73. client->document_did_set_text(allow_callback);
  74. clear_text_guard.disarm();
  75. // FIXME: Should the modified state be cleared on some of the earlier returns as well?
  76. set_unmodified();
  77. return true;
  78. }
  79. size_t TextDocumentLine::first_non_whitespace_column() const
  80. {
  81. for (size_t i = 0; i < length(); ++i) {
  82. auto code_point = code_points()[i];
  83. if (!is_ascii_space(code_point))
  84. return i;
  85. }
  86. return length();
  87. }
  88. Optional<size_t> TextDocumentLine::last_non_whitespace_column() const
  89. {
  90. for (ssize_t i = length() - 1; i >= 0; --i) {
  91. auto code_point = code_points()[i];
  92. if (!is_ascii_space(code_point))
  93. return i;
  94. }
  95. return {};
  96. }
  97. bool TextDocumentLine::ends_in_whitespace() const
  98. {
  99. if (!length())
  100. return false;
  101. return is_ascii_space(code_points()[length() - 1]);
  102. }
  103. bool TextDocumentLine::can_select() const
  104. {
  105. if (is_empty())
  106. return false;
  107. for (size_t i = 0; i < length(); ++i) {
  108. auto code_point = code_points()[i];
  109. if (code_point != '\n' && code_point != '\r' && code_point != '\f' && code_point != '\v')
  110. return true;
  111. }
  112. return false;
  113. }
  114. size_t TextDocumentLine::leading_spaces() const
  115. {
  116. size_t count = 0;
  117. for (; count < m_text.size(); ++count) {
  118. if (m_text[count] != ' ') {
  119. break;
  120. }
  121. }
  122. return count;
  123. }
  124. String TextDocumentLine::to_utf8() const
  125. {
  126. StringBuilder builder;
  127. builder.append(view());
  128. return builder.to_string();
  129. }
  130. TextDocumentLine::TextDocumentLine(TextDocument& document)
  131. {
  132. clear(document);
  133. }
  134. TextDocumentLine::TextDocumentLine(TextDocument& document, StringView text)
  135. {
  136. set_text(document, text);
  137. }
  138. void TextDocumentLine::clear(TextDocument& document)
  139. {
  140. m_text.clear();
  141. document.update_views({});
  142. }
  143. void TextDocumentLine::set_text(TextDocument& document, Vector<u32> const text)
  144. {
  145. m_text = move(text);
  146. document.update_views({});
  147. }
  148. bool TextDocumentLine::set_text(TextDocument& document, StringView text)
  149. {
  150. if (text.is_empty()) {
  151. clear(document);
  152. return true;
  153. }
  154. m_text.clear();
  155. Utf8View utf8_view(text);
  156. if (!utf8_view.validate()) {
  157. return false;
  158. }
  159. for (auto code_point : utf8_view)
  160. m_text.append(code_point);
  161. document.update_views({});
  162. return true;
  163. }
  164. void TextDocumentLine::append(TextDocument& document, u32 const* code_points, size_t length)
  165. {
  166. if (length == 0)
  167. return;
  168. m_text.append(code_points, length);
  169. document.update_views({});
  170. }
  171. void TextDocumentLine::append(TextDocument& document, u32 code_point)
  172. {
  173. insert(document, length(), code_point);
  174. }
  175. void TextDocumentLine::prepend(TextDocument& document, u32 code_point)
  176. {
  177. insert(document, 0, code_point);
  178. }
  179. void TextDocumentLine::insert(TextDocument& document, size_t index, u32 code_point)
  180. {
  181. if (index == length()) {
  182. m_text.append(code_point);
  183. } else {
  184. m_text.insert(index, code_point);
  185. }
  186. document.update_views({});
  187. }
  188. void TextDocumentLine::remove(TextDocument& document, size_t index)
  189. {
  190. if (index == length()) {
  191. m_text.take_last();
  192. } else {
  193. m_text.remove(index);
  194. }
  195. document.update_views({});
  196. }
  197. void TextDocumentLine::remove_range(TextDocument& document, size_t start, size_t length)
  198. {
  199. VERIFY(length <= m_text.size());
  200. Vector<u32> new_data;
  201. new_data.ensure_capacity(m_text.size() - length);
  202. for (size_t i = 0; i < start; ++i)
  203. new_data.append(m_text[i]);
  204. for (size_t i = (start + length); i < m_text.size(); ++i)
  205. new_data.append(m_text[i]);
  206. m_text = move(new_data);
  207. document.update_views({});
  208. }
  209. void TextDocumentLine::truncate(TextDocument& document, size_t length)
  210. {
  211. m_text.resize(length);
  212. document.update_views({});
  213. }
  214. void TextDocument::append_line(NonnullOwnPtr<TextDocumentLine> line)
  215. {
  216. lines().append(move(line));
  217. if (m_client_notifications_enabled) {
  218. for (auto* client : m_clients)
  219. client->document_did_append_line();
  220. }
  221. }
  222. void TextDocument::insert_line(size_t line_index, NonnullOwnPtr<TextDocumentLine> line)
  223. {
  224. lines().insert((int)line_index, move(line));
  225. if (m_client_notifications_enabled) {
  226. for (auto* client : m_clients)
  227. client->document_did_insert_line(line_index);
  228. }
  229. }
  230. void TextDocument::remove_line(size_t line_index)
  231. {
  232. lines().remove((int)line_index);
  233. if (m_client_notifications_enabled) {
  234. for (auto* client : m_clients)
  235. client->document_did_remove_line(line_index);
  236. }
  237. }
  238. void TextDocument::remove_all_lines()
  239. {
  240. lines().clear();
  241. if (m_client_notifications_enabled) {
  242. for (auto* client : m_clients)
  243. client->document_did_remove_all_lines();
  244. }
  245. }
  246. void TextDocument::register_client(Client& client)
  247. {
  248. m_clients.set(&client);
  249. }
  250. void TextDocument::unregister_client(Client& client)
  251. {
  252. m_clients.remove(&client);
  253. }
  254. void TextDocument::update_views(Badge<TextDocumentLine>)
  255. {
  256. notify_did_change();
  257. }
  258. void TextDocument::notify_did_change()
  259. {
  260. if (m_client_notifications_enabled) {
  261. for (auto* client : m_clients)
  262. client->document_did_change();
  263. }
  264. m_regex_needs_update = true;
  265. }
  266. void TextDocument::set_all_cursors(TextPosition const& position)
  267. {
  268. if (m_client_notifications_enabled) {
  269. for (auto* client : m_clients)
  270. client->document_did_set_cursor(position);
  271. }
  272. }
  273. String TextDocument::text() const
  274. {
  275. StringBuilder builder;
  276. for (size_t i = 0; i < line_count(); ++i) {
  277. auto& line = this->line(i);
  278. builder.append(line.view());
  279. if (i != line_count() - 1)
  280. builder.append('\n');
  281. }
  282. return builder.to_string();
  283. }
  284. String TextDocument::text_in_range(TextRange const& a_range) const
  285. {
  286. auto range = a_range.normalized();
  287. if (is_empty() || line_count() < range.end().line() - range.start().line())
  288. return String("");
  289. StringBuilder builder;
  290. for (size_t i = range.start().line(); i <= range.end().line(); ++i) {
  291. auto& line = this->line(i);
  292. size_t selection_start_column_on_line = range.start().line() == i ? range.start().column() : 0;
  293. size_t selection_end_column_on_line = range.end().line() == i ? range.end().column() : line.length();
  294. if (!line.is_empty()) {
  295. builder.append(
  296. Utf32View(
  297. line.code_points() + selection_start_column_on_line,
  298. selection_end_column_on_line - selection_start_column_on_line));
  299. }
  300. if (i != range.end().line())
  301. builder.append('\n');
  302. }
  303. return builder.to_string();
  304. }
  305. u32 TextDocument::code_point_at(TextPosition const& position) const
  306. {
  307. VERIFY(position.line() < line_count());
  308. auto& line = this->line(position.line());
  309. if (position.column() == line.length())
  310. return '\n';
  311. return line.code_points()[position.column()];
  312. }
  313. TextPosition TextDocument::next_position_after(TextPosition const& position, SearchShouldWrap should_wrap) const
  314. {
  315. auto& line = this->line(position.line());
  316. if (position.column() == line.length()) {
  317. if (position.line() == line_count() - 1) {
  318. if (should_wrap == SearchShouldWrap::Yes)
  319. return { 0, 0 };
  320. return {};
  321. }
  322. return { position.line() + 1, 0 };
  323. }
  324. return { position.line(), position.column() + 1 };
  325. }
  326. TextPosition TextDocument::previous_position_before(TextPosition const& position, SearchShouldWrap should_wrap) const
  327. {
  328. if (position.column() == 0) {
  329. if (position.line() == 0) {
  330. if (should_wrap == SearchShouldWrap::Yes) {
  331. auto& last_line = this->line(line_count() - 1);
  332. return { line_count() - 1, last_line.length() };
  333. }
  334. return {};
  335. }
  336. auto& prev_line = this->line(position.line() - 1);
  337. return { position.line() - 1, prev_line.length() };
  338. }
  339. return { position.line(), position.column() - 1 };
  340. }
  341. void TextDocument::update_regex_matches(StringView needle)
  342. {
  343. if (m_regex_needs_update || needle != m_regex_needle) {
  344. Regex<PosixExtended> re(needle);
  345. Vector<RegexStringView> views;
  346. for (size_t line = 0; line < m_lines.size(); ++line) {
  347. views.append(m_lines.at(line).view());
  348. }
  349. re.search(views, m_regex_result);
  350. m_regex_needs_update = false;
  351. m_regex_needle = String { needle };
  352. m_regex_result_match_index = -1;
  353. m_regex_result_match_capture_group_index = -1;
  354. }
  355. }
  356. TextRange TextDocument::find_next(StringView needle, TextPosition const& start, SearchShouldWrap should_wrap, bool regmatch, bool match_case)
  357. {
  358. if (needle.is_empty())
  359. return {};
  360. if (regmatch) {
  361. if (!m_regex_result.matches.size())
  362. return {};
  363. regex::Match match;
  364. bool use_whole_match { false };
  365. auto next_match = [&] {
  366. m_regex_result_match_capture_group_index = 0;
  367. if (m_regex_result_match_index == m_regex_result.matches.size() - 1) {
  368. if (should_wrap == SearchShouldWrap::Yes)
  369. m_regex_result_match_index = 0;
  370. else
  371. ++m_regex_result_match_index;
  372. } else
  373. ++m_regex_result_match_index;
  374. };
  375. if (m_regex_result.n_capture_groups) {
  376. if (m_regex_result_match_index >= m_regex_result.capture_group_matches.size())
  377. next_match();
  378. else {
  379. // check if last capture group has been reached
  380. if (m_regex_result_match_capture_group_index >= m_regex_result.capture_group_matches.at(m_regex_result_match_index).size()) {
  381. next_match();
  382. } else {
  383. // get to the next capture group item
  384. ++m_regex_result_match_capture_group_index;
  385. }
  386. }
  387. // use whole match, if there is no capture group for current index
  388. if (m_regex_result_match_index >= m_regex_result.capture_group_matches.size())
  389. use_whole_match = true;
  390. else if (m_regex_result_match_capture_group_index >= m_regex_result.capture_group_matches.at(m_regex_result_match_index).size())
  391. next_match();
  392. } else {
  393. next_match();
  394. }
  395. if (use_whole_match || !m_regex_result.capture_group_matches.at(m_regex_result_match_index).size())
  396. match = m_regex_result.matches.at(m_regex_result_match_index);
  397. else
  398. match = m_regex_result.capture_group_matches.at(m_regex_result_match_index).at(m_regex_result_match_capture_group_index);
  399. return TextRange { { match.line, match.column }, { match.line, match.column + match.view.length() } };
  400. }
  401. TextPosition position = start.is_valid() ? start : TextPosition(0, 0);
  402. TextPosition original_position = position;
  403. TextPosition start_of_potential_match;
  404. size_t needle_index = 0;
  405. do {
  406. auto ch = code_point_at(position);
  407. // FIXME: This is not the right way to use a Unicode needle!
  408. if (match_case ? ch == (u32)needle[needle_index] : tolower(ch) == tolower((u32)needle[needle_index])) {
  409. if (needle_index == 0)
  410. start_of_potential_match = position;
  411. ++needle_index;
  412. if (needle_index >= needle.length())
  413. return { start_of_potential_match, next_position_after(position, should_wrap) };
  414. } else {
  415. if (needle_index > 0)
  416. position = start_of_potential_match;
  417. needle_index = 0;
  418. }
  419. position = next_position_after(position, should_wrap);
  420. } while (position.is_valid() && position != original_position);
  421. return {};
  422. }
  423. TextRange TextDocument::find_previous(StringView needle, TextPosition const& start, SearchShouldWrap should_wrap, bool regmatch, bool match_case)
  424. {
  425. if (needle.is_empty())
  426. return {};
  427. if (regmatch) {
  428. if (!m_regex_result.matches.size())
  429. return {};
  430. regex::Match match;
  431. bool use_whole_match { false };
  432. auto next_match = [&] {
  433. if (m_regex_result_match_index == 0) {
  434. if (should_wrap == SearchShouldWrap::Yes)
  435. m_regex_result_match_index = m_regex_result.matches.size() - 1;
  436. else
  437. --m_regex_result_match_index;
  438. } else
  439. --m_regex_result_match_index;
  440. m_regex_result_match_capture_group_index = m_regex_result.capture_group_matches.at(m_regex_result_match_index).size() - 1;
  441. };
  442. if (m_regex_result.n_capture_groups) {
  443. if (m_regex_result_match_index >= m_regex_result.capture_group_matches.size())
  444. next_match();
  445. else {
  446. // check if last capture group has been reached
  447. if (m_regex_result_match_capture_group_index >= m_regex_result.capture_group_matches.at(m_regex_result_match_index).size()) {
  448. next_match();
  449. } else {
  450. // get to the next capture group item
  451. --m_regex_result_match_capture_group_index;
  452. }
  453. }
  454. // use whole match, if there is no capture group for current index
  455. if (m_regex_result_match_index >= m_regex_result.capture_group_matches.size())
  456. use_whole_match = true;
  457. else if (m_regex_result_match_capture_group_index >= m_regex_result.capture_group_matches.at(m_regex_result_match_index).size())
  458. next_match();
  459. } else {
  460. next_match();
  461. }
  462. if (use_whole_match || !m_regex_result.capture_group_matches.at(m_regex_result_match_index).size())
  463. match = m_regex_result.matches.at(m_regex_result_match_index);
  464. else
  465. match = m_regex_result.capture_group_matches.at(m_regex_result_match_index).at(m_regex_result_match_capture_group_index);
  466. return TextRange { { match.line, match.column }, { match.line, match.column + match.view.length() } };
  467. }
  468. TextPosition position = start.is_valid() ? start : TextPosition(0, 0);
  469. position = previous_position_before(position, should_wrap);
  470. if (position.line() >= line_count())
  471. return {};
  472. TextPosition original_position = position;
  473. TextPosition end_of_potential_match;
  474. size_t needle_index = needle.length() - 1;
  475. do {
  476. auto ch = code_point_at(position);
  477. // FIXME: This is not the right way to use a Unicode needle!
  478. if (match_case ? ch == (u32)needle[needle_index] : tolower(ch) == tolower((u32)needle[needle_index])) {
  479. if (needle_index == needle.length() - 1)
  480. end_of_potential_match = position;
  481. if (needle_index == 0)
  482. return { position, next_position_after(end_of_potential_match, should_wrap) };
  483. --needle_index;
  484. } else {
  485. if (needle_index < needle.length() - 1)
  486. position = end_of_potential_match;
  487. needle_index = needle.length() - 1;
  488. }
  489. position = previous_position_before(position, should_wrap);
  490. } while (position.is_valid() && position != original_position);
  491. return {};
  492. }
  493. Vector<TextRange> TextDocument::find_all(StringView needle, bool regmatch, bool match_case)
  494. {
  495. Vector<TextRange> ranges;
  496. TextPosition position;
  497. for (;;) {
  498. auto range = find_next(needle, position, SearchShouldWrap::No, regmatch, match_case);
  499. if (!range.is_valid())
  500. break;
  501. ranges.append(range);
  502. position = range.end();
  503. }
  504. return ranges;
  505. }
  506. Optional<TextDocumentSpan> TextDocument::first_non_skippable_span_before(TextPosition const& position) const
  507. {
  508. for (int i = m_spans.size() - 1; i >= 0; --i) {
  509. if (!m_spans[i].range.contains(position))
  510. continue;
  511. while ((i - 1) >= 0 && m_spans[i - 1].is_skippable)
  512. --i;
  513. if (i <= 0)
  514. return {};
  515. return m_spans[i - 1];
  516. }
  517. return {};
  518. }
  519. Optional<TextDocumentSpan> TextDocument::first_non_skippable_span_after(TextPosition const& position) const
  520. {
  521. size_t i = 0;
  522. // Find the first span containing the cursor
  523. for (; i < m_spans.size(); ++i) {
  524. if (m_spans[i].range.contains(position))
  525. break;
  526. }
  527. // Find the first span *after* the cursor
  528. // TODO: For a large number of spans, binary search would be faster.
  529. for (; i < m_spans.size(); ++i) {
  530. if (!m_spans[i].range.contains(position))
  531. break;
  532. }
  533. // Skip skippable spans
  534. for (; i < m_spans.size(); ++i) {
  535. if (!m_spans[i].is_skippable)
  536. break;
  537. }
  538. if (i < m_spans.size())
  539. return m_spans[i];
  540. return {};
  541. }
  542. TextPosition TextDocument::first_word_break_before(TextPosition const& position, bool start_at_column_before) const
  543. {
  544. if (position.column() == 0) {
  545. if (position.line() == 0) {
  546. return TextPosition(0, 0);
  547. }
  548. auto previous_line = this->line(position.line() - 1);
  549. return TextPosition(position.line() - 1, previous_line.length());
  550. }
  551. auto target = position;
  552. auto line = this->line(target.line());
  553. auto modifier = start_at_column_before ? 1 : 0;
  554. if (target.column() == line.length())
  555. modifier = 1;
  556. while (target.column() > 0 && is_ascii_blank(line.code_points()[target.column() - modifier]))
  557. target.set_column(target.column() - 1);
  558. auto is_start_alphanumeric = is_ascii_alphanumeric(line.code_points()[target.column() - modifier]);
  559. while (target.column() > 0) {
  560. auto prev_code_point = line.code_points()[target.column() - 1];
  561. if ((is_start_alphanumeric && !is_ascii_alphanumeric(prev_code_point)) || (!is_start_alphanumeric && is_ascii_alphanumeric(prev_code_point)))
  562. break;
  563. target.set_column(target.column() - 1);
  564. }
  565. return target;
  566. }
  567. TextPosition TextDocument::first_word_break_after(TextPosition const& position) const
  568. {
  569. auto target = position;
  570. auto line = this->line(target.line());
  571. if (position.column() >= line.length()) {
  572. if (position.line() >= this->line_count() - 1) {
  573. return position;
  574. }
  575. return TextPosition(position.line() + 1, 0);
  576. }
  577. while (target.column() < line.length() && is_ascii_space(line.code_points()[target.column()]))
  578. target.set_column(target.column() + 1);
  579. auto is_start_alphanumeric = is_ascii_alphanumeric(line.code_points()[target.column()]);
  580. while (target.column() < line.length()) {
  581. auto next_code_point = line.code_points()[target.column()];
  582. if ((is_start_alphanumeric && !is_ascii_alphanumeric(next_code_point)) || (!is_start_alphanumeric && is_ascii_alphanumeric(next_code_point)))
  583. break;
  584. target.set_column(target.column() + 1);
  585. }
  586. return target;
  587. }
  588. TextPosition TextDocument::first_word_before(TextPosition const& position, bool start_at_column_before) const
  589. {
  590. if (position.column() == 0) {
  591. if (position.line() == 0) {
  592. return TextPosition(0, 0);
  593. }
  594. auto previous_line = this->line(position.line() - 1);
  595. return TextPosition(position.line() - 1, previous_line.length());
  596. }
  597. auto target = position;
  598. auto line = this->line(target.line());
  599. if (target.column() == line.length())
  600. start_at_column_before = 1;
  601. auto nonblank_passed = !is_ascii_blank(line.code_points()[target.column() - start_at_column_before]);
  602. while (target.column() > 0) {
  603. auto prev_code_point = line.code_points()[target.column() - 1];
  604. nonblank_passed |= !is_ascii_blank(prev_code_point);
  605. if (nonblank_passed && is_ascii_blank(prev_code_point)) {
  606. break;
  607. } else if (is_ascii_punctuation(prev_code_point)) {
  608. target.set_column(target.column() - 1);
  609. break;
  610. }
  611. target.set_column(target.column() - 1);
  612. }
  613. return target;
  614. }
  615. void TextDocument::undo()
  616. {
  617. if (!can_undo())
  618. return;
  619. m_undo_stack.undo();
  620. notify_did_change();
  621. }
  622. void TextDocument::redo()
  623. {
  624. if (!can_redo())
  625. return;
  626. m_undo_stack.redo();
  627. notify_did_change();
  628. }
  629. void TextDocument::add_to_undo_stack(NonnullOwnPtr<TextDocumentUndoCommand> undo_command)
  630. {
  631. m_undo_stack.push(move(undo_command));
  632. }
  633. TextDocumentUndoCommand::TextDocumentUndoCommand(TextDocument& document)
  634. : m_document(document)
  635. {
  636. }
  637. InsertTextCommand::InsertTextCommand(TextDocument& document, String const& text, TextPosition const& position)
  638. : TextDocumentUndoCommand(document)
  639. , m_text(text)
  640. , m_range({ position, position })
  641. {
  642. }
  643. String InsertTextCommand::action_text() const
  644. {
  645. return "Insert Text";
  646. }
  647. bool InsertTextCommand::merge_with(GUI::Command const& other)
  648. {
  649. if (!is<InsertTextCommand>(other))
  650. return false;
  651. auto& typed_other = static_cast<InsertTextCommand const&>(other);
  652. if (m_range.end() != typed_other.m_range.start())
  653. return false;
  654. if (m_range.start().line() != m_range.end().line())
  655. return false;
  656. StringBuilder builder(m_text.length() + typed_other.m_text.length());
  657. builder.append(m_text);
  658. builder.append(typed_other.m_text);
  659. m_text = builder.to_string();
  660. m_range.set_end(typed_other.m_range.end());
  661. return true;
  662. }
  663. void InsertTextCommand::perform_formatting(TextDocument::Client const& client)
  664. {
  665. const size_t tab_width = client.soft_tab_width();
  666. auto const& dest_line = m_document.line(m_range.start().line());
  667. bool const should_auto_indent = client.is_automatic_indentation_enabled();
  668. StringBuilder builder;
  669. size_t column = m_range.start().column();
  670. size_t line_indentation = dest_line.leading_spaces();
  671. bool at_start_of_line = line_indentation == column;
  672. for (auto input_char : m_text) {
  673. if (input_char == '\n') {
  674. size_t spaces_at_end = 0;
  675. if (column < line_indentation)
  676. spaces_at_end = line_indentation - column;
  677. line_indentation -= spaces_at_end;
  678. builder.append('\n');
  679. column = 0;
  680. if (should_auto_indent) {
  681. for (; column < line_indentation; ++column) {
  682. builder.append(' ');
  683. }
  684. }
  685. at_start_of_line = true;
  686. } else if (input_char == '\t') {
  687. size_t next_soft_tab_stop = ((column + tab_width) / tab_width) * tab_width;
  688. size_t spaces_to_insert = next_soft_tab_stop - column;
  689. for (size_t i = 0; i < spaces_to_insert; ++i) {
  690. builder.append(' ');
  691. }
  692. column = next_soft_tab_stop;
  693. if (at_start_of_line) {
  694. line_indentation = column;
  695. }
  696. } else {
  697. if (input_char == ' ') {
  698. if (at_start_of_line) {
  699. ++line_indentation;
  700. }
  701. } else {
  702. at_start_of_line = false;
  703. }
  704. builder.append(input_char);
  705. ++column;
  706. }
  707. }
  708. m_text = builder.build();
  709. }
  710. void InsertTextCommand::redo()
  711. {
  712. auto new_cursor = m_document.insert_at(m_range.start(), m_text, m_client);
  713. // NOTE: We don't know where the range ends until after doing redo().
  714. // This is okay since we always do redo() after adding this to the undo stack.
  715. m_range.set_end(new_cursor);
  716. m_document.set_all_cursors(new_cursor);
  717. }
  718. void InsertTextCommand::undo()
  719. {
  720. m_document.remove(m_range);
  721. m_document.set_all_cursors(m_range.start());
  722. }
  723. RemoveTextCommand::RemoveTextCommand(TextDocument& document, String const& text, TextRange const& range)
  724. : TextDocumentUndoCommand(document)
  725. , m_text(text)
  726. , m_range(range)
  727. {
  728. }
  729. String RemoveTextCommand::action_text() const
  730. {
  731. return "Remove Text";
  732. }
  733. bool RemoveTextCommand::merge_with(GUI::Command const& other)
  734. {
  735. if (!is<RemoveTextCommand>(other))
  736. return false;
  737. auto& typed_other = static_cast<RemoveTextCommand const&>(other);
  738. if (m_range.start() != typed_other.m_range.end())
  739. return false;
  740. if (m_range.start().line() != m_range.end().line())
  741. return false;
  742. // Merge backspaces
  743. StringBuilder builder(m_text.length() + typed_other.m_text.length());
  744. builder.append(typed_other.m_text);
  745. builder.append(m_text);
  746. m_text = builder.to_string();
  747. m_range.set_start(typed_other.m_range.start());
  748. return true;
  749. }
  750. void RemoveTextCommand::redo()
  751. {
  752. m_document.remove(m_range);
  753. m_document.set_all_cursors(m_range.start());
  754. }
  755. void RemoveTextCommand::undo()
  756. {
  757. auto new_cursor = m_document.insert_at(m_range.start(), m_text);
  758. m_document.set_all_cursors(new_cursor);
  759. }
  760. ReplaceAllTextCommand::ReplaceAllTextCommand(GUI::TextDocument& document, String const& text, GUI::TextRange const& range, String const& action_text)
  761. : TextDocumentUndoCommand(document)
  762. , m_text(text)
  763. , m_range(range)
  764. , m_action_text(action_text)
  765. {
  766. }
  767. void ReplaceAllTextCommand::redo()
  768. {
  769. m_document.remove(m_range);
  770. m_document.set_all_cursors(m_range.start());
  771. auto new_cursor = m_document.insert_at(m_range.start(), m_text, m_client);
  772. m_range.set_end(new_cursor);
  773. m_document.set_all_cursors(new_cursor);
  774. }
  775. void ReplaceAllTextCommand::undo()
  776. {
  777. m_document.remove(m_range);
  778. m_document.set_all_cursors(m_range.start());
  779. auto new_cursor = m_document.insert_at(m_range.start(), m_text);
  780. m_range.set_end(new_cursor);
  781. m_document.set_all_cursors(new_cursor);
  782. }
  783. bool ReplaceAllTextCommand::merge_with(GUI::Command const&)
  784. {
  785. return false;
  786. }
  787. String ReplaceAllTextCommand::action_text() const
  788. {
  789. return m_action_text;
  790. }
  791. TextPosition TextDocument::insert_at(TextPosition const& position, StringView text, Client const* client)
  792. {
  793. TextPosition cursor = position;
  794. Utf8View utf8_view(text);
  795. for (auto code_point : utf8_view)
  796. cursor = insert_at(cursor, code_point, client);
  797. return cursor;
  798. }
  799. TextPosition TextDocument::insert_at(TextPosition const& position, u32 code_point, Client const*)
  800. {
  801. if (code_point == '\n') {
  802. auto new_line = make<TextDocumentLine>(*this);
  803. new_line->append(*this, line(position.line()).code_points() + position.column(), line(position.line()).length() - position.column());
  804. line(position.line()).truncate(*this, position.column());
  805. insert_line(position.line() + 1, move(new_line));
  806. notify_did_change();
  807. return { position.line() + 1, 0 };
  808. } else {
  809. line(position.line()).insert(*this, position.column(), code_point);
  810. notify_did_change();
  811. return { position.line(), position.column() + 1 };
  812. }
  813. }
  814. void TextDocument::remove(TextRange const& unnormalized_range)
  815. {
  816. if (!unnormalized_range.is_valid())
  817. return;
  818. auto range = unnormalized_range.normalized();
  819. // First delete all the lines in between the first and last one.
  820. for (size_t i = range.start().line() + 1; i < range.end().line();) {
  821. remove_line(i);
  822. range.end().set_line(range.end().line() - 1);
  823. }
  824. if (range.start().line() == range.end().line()) {
  825. // Delete within same line.
  826. auto& line = this->line(range.start().line());
  827. if (line.length() == 0)
  828. return;
  829. bool whole_line_is_selected = range.start().column() == 0 && range.end().column() == line.length();
  830. if (whole_line_is_selected) {
  831. line.clear(*this);
  832. } else {
  833. line.remove_range(*this, range.start().column(), range.end().column() - range.start().column());
  834. }
  835. } else {
  836. // Delete across a newline, merging lines.
  837. VERIFY(range.start().line() == range.end().line() - 1);
  838. auto& first_line = line(range.start().line());
  839. auto& second_line = line(range.end().line());
  840. Vector<u32> code_points;
  841. code_points.append(first_line.code_points(), range.start().column());
  842. if (!second_line.is_empty())
  843. code_points.append(second_line.code_points() + range.end().column(), second_line.length() - range.end().column());
  844. first_line.set_text(*this, move(code_points));
  845. remove_line(range.end().line());
  846. }
  847. if (lines().is_empty()) {
  848. append_line(make<TextDocumentLine>(*this));
  849. }
  850. notify_did_change();
  851. }
  852. bool TextDocument::is_empty() const
  853. {
  854. return line_count() == 1 && line(0).is_empty();
  855. }
  856. TextRange TextDocument::range_for_entire_line(size_t line_index) const
  857. {
  858. if (line_index >= line_count())
  859. return {};
  860. return { { line_index, 0 }, { line_index, line(line_index).length() } };
  861. }
  862. TextDocumentSpan const* TextDocument::span_at(TextPosition const& position) const
  863. {
  864. for (auto& span : m_spans) {
  865. if (span.range.contains(position))
  866. return &span;
  867. }
  868. return nullptr;
  869. }
  870. void TextDocument::set_unmodified()
  871. {
  872. m_undo_stack.set_current_unmodified();
  873. }
  874. void TextDocument::set_spans(u32 span_collection_index, Vector<TextDocumentSpan> spans)
  875. {
  876. m_span_collections.set(span_collection_index, move(spans));
  877. merge_span_collections();
  878. }
  879. struct SpanAndCollectionIndex {
  880. TextDocumentSpan span;
  881. u32 collection_index { 0 };
  882. };
  883. void TextDocument::merge_span_collections()
  884. {
  885. Vector<SpanAndCollectionIndex> sorted_spans;
  886. auto collection_indices = m_span_collections.keys();
  887. quick_sort(collection_indices);
  888. for (auto collection_index : collection_indices) {
  889. auto spans = m_span_collections.get(collection_index).value();
  890. for (auto span : spans) {
  891. sorted_spans.append({ move(span), collection_index });
  892. }
  893. }
  894. quick_sort(sorted_spans, [](SpanAndCollectionIndex const& a, SpanAndCollectionIndex const& b) {
  895. if (a.span.range.start() == b.span.range.start()) {
  896. return a.collection_index < b.collection_index;
  897. }
  898. return a.span.range.start() < b.span.range.start();
  899. });
  900. // The end of the TextRanges of spans are non-inclusive, i.e span range = [X,y).
  901. // This transforms the span's range to be inclusive, i.e [X,Y].
  902. auto adjust_end = [](GUI::TextDocumentSpan span) -> GUI::TextDocumentSpan {
  903. span.range.set_end({ span.range.end().line(), span.range.end().column() == 0 ? 0 : span.range.end().column() - 1 });
  904. return span;
  905. };
  906. Vector<SpanAndCollectionIndex> merged_spans;
  907. for (auto& span_and_collection_index : sorted_spans) {
  908. if (merged_spans.is_empty()) {
  909. merged_spans.append(span_and_collection_index);
  910. continue;
  911. }
  912. auto const& span = span_and_collection_index.span;
  913. auto last_span_and_collection_index = merged_spans.last();
  914. auto const& last_span = last_span_and_collection_index.span;
  915. if (adjust_end(span).range.start() > adjust_end(last_span).range.end()) {
  916. // Current span does not intersect with previous one, can simply append to merged list.
  917. merged_spans.append(span_and_collection_index);
  918. continue;
  919. }
  920. merged_spans.take_last();
  921. if (span.range.start() > last_span.range.start()) {
  922. SpanAndCollectionIndex first_part = last_span_and_collection_index;
  923. first_part.span.range.set_end(span.range.start());
  924. merged_spans.append(move(first_part));
  925. }
  926. SpanAndCollectionIndex merged_span;
  927. merged_span.collection_index = span_and_collection_index.collection_index;
  928. merged_span.span.range = { span.range.start(), min(span.range.end(), last_span.range.end()) };
  929. merged_span.span.is_skippable = span.is_skippable | last_span.is_skippable;
  930. merged_span.span.data = span.data ? span.data : last_span.data;
  931. merged_span.span.attributes.color = span_and_collection_index.collection_index > last_span_and_collection_index.collection_index ? span.attributes.color : last_span.attributes.color;
  932. merged_span.span.attributes.bold = span.attributes.bold | last_span.attributes.bold;
  933. merged_span.span.attributes.background_color = span.attributes.background_color.has_value() ? span.attributes.background_color.value() : last_span.attributes.background_color;
  934. merged_span.span.attributes.underline = span.attributes.underline | last_span.attributes.underline;
  935. merged_span.span.attributes.underline_color = span.attributes.underline_color.has_value() ? span.attributes.underline_color.value() : last_span.attributes.underline_color;
  936. merged_span.span.attributes.underline_style = span.attributes.underline_style;
  937. merged_spans.append(move(merged_span));
  938. if (span.range.end() == last_span.range.end())
  939. continue;
  940. if (span.range.end() > last_span.range.end()) {
  941. SpanAndCollectionIndex last_part = span_and_collection_index;
  942. last_part.span.range.set_start(last_span.range.end());
  943. merged_spans.append(move(last_part));
  944. continue;
  945. }
  946. SpanAndCollectionIndex last_part = last_span_and_collection_index;
  947. last_part.span.range.set_start(span.range.end());
  948. merged_spans.append(move(last_part));
  949. }
  950. m_spans.clear();
  951. for (auto span : merged_spans) {
  952. m_spans.append(move(span.span));
  953. }
  954. }
  955. }