TextDocument.cpp 27 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885
  1. /*
  2. * Copyright (c) 2018-2020, Andreas Kling <kling@serenityos.org>
  3. * All rights reserved.
  4. *
  5. * Redistribution and use in source and binary forms, with or without
  6. * modification, are permitted provided that the following conditions are met:
  7. *
  8. * 1. Redistributions of source code must retain the above copyright notice, this
  9. * list of conditions and the following disclaimer.
  10. *
  11. * 2. Redistributions in binary form must reproduce the above copyright notice,
  12. * this list of conditions and the following disclaimer in the documentation
  13. * and/or other materials provided with the distribution.
  14. *
  15. * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
  16. * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  17. * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
  18. * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
  19. * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  20. * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
  21. * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
  22. * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
  23. * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
  24. * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
  25. */
  26. #include <AK/Badge.h>
  27. #include <AK/ScopeGuard.h>
  28. #include <AK/StringBuilder.h>
  29. #include <AK/Utf8View.h>
  30. #include <LibCore/Timer.h>
  31. #include <LibGUI/TextDocument.h>
  32. #include <LibGUI/TextEditor.h>
  33. #include <LibRegex/Regex.h>
  34. #include <ctype.h>
  35. namespace GUI {
  36. NonnullRefPtr<TextDocument> TextDocument::create(Client* client)
  37. {
  38. return adopt(*new TextDocument(client));
  39. }
  40. TextDocument::TextDocument(Client* client)
  41. {
  42. if (client)
  43. m_clients.set(client);
  44. append_line(make<TextDocumentLine>(*this));
  45. // TODO: Instead of a repating timer, this we should call a delayed 2 sec timer when the user types.
  46. m_undo_timer = Core::Timer::construct(
  47. 2000, [this] {
  48. update_undo_timer();
  49. });
  50. }
  51. TextDocument::~TextDocument()
  52. {
  53. }
  54. bool TextDocument::set_text(const StringView& text)
  55. {
  56. m_client_notifications_enabled = false;
  57. m_spans.clear();
  58. remove_all_lines();
  59. ArmedScopeGuard clear_text_guard([this]() {
  60. set_text({});
  61. });
  62. size_t start_of_current_line = 0;
  63. auto add_line = [&](size_t current_position) -> bool {
  64. size_t line_length = current_position - start_of_current_line;
  65. auto line = make<TextDocumentLine>(*this);
  66. bool success = true;
  67. if (line_length)
  68. success = line->set_text(*this, text.substring_view(start_of_current_line, current_position - start_of_current_line));
  69. if (!success)
  70. return false;
  71. append_line(move(line));
  72. start_of_current_line = current_position + 1;
  73. return true;
  74. };
  75. size_t i = 0;
  76. for (i = 0; i < text.length(); ++i) {
  77. if (text[i] != '\n')
  78. continue;
  79. auto success = add_line(i);
  80. if (!success)
  81. return false;
  82. }
  83. auto success = add_line(i);
  84. if (!success)
  85. return false;
  86. // Don't show the file's trailing newline as an actual new line.
  87. if (line_count() > 1 && line(line_count() - 1).is_empty())
  88. m_lines.take_last();
  89. m_client_notifications_enabled = true;
  90. for (auto* client : m_clients)
  91. client->document_did_set_text();
  92. clear_text_guard.disarm();
  93. return true;
  94. }
  95. size_t TextDocumentLine::first_non_whitespace_column() const
  96. {
  97. for (size_t i = 0; i < length(); ++i) {
  98. auto code_point = code_points()[i];
  99. if (!isspace(code_point))
  100. return i;
  101. }
  102. return length();
  103. }
  104. Optional<size_t> TextDocumentLine::last_non_whitespace_column() const
  105. {
  106. for (ssize_t i = length() - 1; i >= 0; --i) {
  107. auto code_point = code_points()[i];
  108. if (!isspace(code_point))
  109. return i;
  110. }
  111. return {};
  112. }
  113. bool TextDocumentLine::ends_in_whitespace() const
  114. {
  115. if (!length())
  116. return false;
  117. return isspace(code_points()[length() - 1]);
  118. }
  119. size_t TextDocumentLine::leading_spaces() const
  120. {
  121. size_t count = 0;
  122. for (; count < m_text.size(); ++count) {
  123. if (m_text[count] != ' ') {
  124. break;
  125. }
  126. }
  127. return count;
  128. }
  129. String TextDocumentLine::to_utf8() const
  130. {
  131. StringBuilder builder;
  132. builder.append(view());
  133. return builder.to_string();
  134. }
  135. TextDocumentLine::TextDocumentLine(TextDocument& document)
  136. {
  137. clear(document);
  138. }
  139. TextDocumentLine::TextDocumentLine(TextDocument& document, const StringView& text)
  140. {
  141. set_text(document, text);
  142. }
  143. void TextDocumentLine::clear(TextDocument& document)
  144. {
  145. m_text.clear();
  146. document.update_views({});
  147. }
  148. void TextDocumentLine::set_text(TextDocument& document, const Vector<u32> text)
  149. {
  150. m_text = move(text);
  151. document.update_views({});
  152. }
  153. bool TextDocumentLine::set_text(TextDocument& document, const StringView& text)
  154. {
  155. if (text.is_empty()) {
  156. clear(document);
  157. return true;
  158. }
  159. m_text.clear();
  160. Utf8View utf8_view(text);
  161. if (!utf8_view.validate()) {
  162. return false;
  163. }
  164. for (auto code_point : utf8_view)
  165. m_text.append(code_point);
  166. document.update_views({});
  167. return true;
  168. }
  169. void TextDocumentLine::append(TextDocument& document, const u32* code_points, size_t length)
  170. {
  171. if (length == 0)
  172. return;
  173. m_text.append(code_points, length);
  174. document.update_views({});
  175. }
  176. void TextDocumentLine::append(TextDocument& document, u32 code_point)
  177. {
  178. insert(document, length(), code_point);
  179. }
  180. void TextDocumentLine::prepend(TextDocument& document, u32 code_point)
  181. {
  182. insert(document, 0, code_point);
  183. }
  184. void TextDocumentLine::insert(TextDocument& document, size_t index, u32 code_point)
  185. {
  186. if (index == length()) {
  187. m_text.append(code_point);
  188. } else {
  189. m_text.insert(index, code_point);
  190. }
  191. document.update_views({});
  192. }
  193. void TextDocumentLine::remove(TextDocument& document, size_t index)
  194. {
  195. if (index == length()) {
  196. m_text.take_last();
  197. } else {
  198. m_text.remove(index);
  199. }
  200. document.update_views({});
  201. }
  202. void TextDocumentLine::remove_range(TextDocument& document, size_t start, size_t length)
  203. {
  204. VERIFY(length <= m_text.size());
  205. Vector<u32> new_data;
  206. new_data.ensure_capacity(m_text.size() - length);
  207. for (size_t i = 0; i < start; ++i)
  208. new_data.append(m_text[i]);
  209. for (size_t i = (start + length); i < m_text.size(); ++i)
  210. new_data.append(m_text[i]);
  211. m_text = move(new_data);
  212. document.update_views({});
  213. }
  214. void TextDocumentLine::truncate(TextDocument& document, size_t length)
  215. {
  216. m_text.resize(length);
  217. document.update_views({});
  218. }
  219. void TextDocument::append_line(NonnullOwnPtr<TextDocumentLine> line)
  220. {
  221. lines().append(move(line));
  222. if (m_client_notifications_enabled) {
  223. for (auto* client : m_clients)
  224. client->document_did_append_line();
  225. }
  226. }
  227. void TextDocument::insert_line(size_t line_index, NonnullOwnPtr<TextDocumentLine> line)
  228. {
  229. lines().insert((int)line_index, move(line));
  230. if (m_client_notifications_enabled) {
  231. for (auto* client : m_clients)
  232. client->document_did_insert_line(line_index);
  233. }
  234. }
  235. void TextDocument::remove_line(size_t line_index)
  236. {
  237. lines().remove((int)line_index);
  238. if (m_client_notifications_enabled) {
  239. for (auto* client : m_clients)
  240. client->document_did_remove_line(line_index);
  241. }
  242. }
  243. void TextDocument::remove_all_lines()
  244. {
  245. lines().clear();
  246. if (m_client_notifications_enabled) {
  247. for (auto* client : m_clients)
  248. client->document_did_remove_all_lines();
  249. }
  250. }
  251. TextDocument::Client::~Client()
  252. {
  253. }
  254. void TextDocument::register_client(Client& client)
  255. {
  256. m_clients.set(&client);
  257. }
  258. void TextDocument::unregister_client(Client& client)
  259. {
  260. m_clients.remove(&client);
  261. }
  262. void TextDocument::update_views(Badge<TextDocumentLine>)
  263. {
  264. notify_did_change();
  265. }
  266. void TextDocument::notify_did_change()
  267. {
  268. if (m_client_notifications_enabled) {
  269. for (auto* client : m_clients)
  270. client->document_did_change();
  271. }
  272. m_regex_needs_update = true;
  273. }
  274. void TextDocument::set_all_cursors(const TextPosition& position)
  275. {
  276. if (m_client_notifications_enabled) {
  277. for (auto* client : m_clients)
  278. client->document_did_set_cursor(position);
  279. }
  280. }
  281. String TextDocument::text() const
  282. {
  283. StringBuilder builder;
  284. for (size_t i = 0; i < line_count(); ++i) {
  285. auto& line = this->line(i);
  286. builder.append(line.view());
  287. if (i != line_count() - 1)
  288. builder.append('\n');
  289. }
  290. return builder.to_string();
  291. }
  292. String TextDocument::text_in_range(const TextRange& a_range) const
  293. {
  294. if (is_empty())
  295. return String("");
  296. auto range = a_range.normalized();
  297. StringBuilder builder;
  298. for (size_t i = range.start().line(); i <= range.end().line(); ++i) {
  299. auto& line = this->line(i);
  300. size_t selection_start_column_on_line = range.start().line() == i ? range.start().column() : 0;
  301. size_t selection_end_column_on_line = range.end().line() == i ? range.end().column() : line.length();
  302. builder.append(Utf32View(line.code_points() + selection_start_column_on_line, selection_end_column_on_line - selection_start_column_on_line));
  303. if (i != range.end().line())
  304. builder.append('\n');
  305. }
  306. return builder.to_string();
  307. }
  308. u32 TextDocument::code_point_at(const TextPosition& position) const
  309. {
  310. VERIFY(position.line() < line_count());
  311. auto& line = this->line(position.line());
  312. if (position.column() == line.length())
  313. return '\n';
  314. return line.code_points()[position.column()];
  315. }
  316. TextPosition TextDocument::next_position_after(const TextPosition& position, SearchShouldWrap should_wrap) const
  317. {
  318. auto& line = this->line(position.line());
  319. if (position.column() == line.length()) {
  320. if (position.line() == line_count() - 1) {
  321. if (should_wrap == SearchShouldWrap::Yes)
  322. return { 0, 0 };
  323. return {};
  324. }
  325. return { position.line() + 1, 0 };
  326. }
  327. return { position.line(), position.column() + 1 };
  328. }
  329. TextPosition TextDocument::previous_position_before(const TextPosition& position, SearchShouldWrap should_wrap) const
  330. {
  331. if (position.column() == 0) {
  332. if (position.line() == 0) {
  333. if (should_wrap == SearchShouldWrap::Yes) {
  334. auto& last_line = this->line(line_count() - 1);
  335. return { line_count() - 1, last_line.length() };
  336. }
  337. return {};
  338. }
  339. auto& prev_line = this->line(position.line() - 1);
  340. return { position.line() - 1, prev_line.length() };
  341. }
  342. return { position.line(), position.column() - 1 };
  343. }
  344. void TextDocument::update_regex_matches(const StringView& needle)
  345. {
  346. if (m_regex_needs_update || needle != m_regex_needle) {
  347. Regex<PosixExtended> re(needle);
  348. Vector<RegexStringView> views;
  349. for (size_t line = 0; line < m_lines.size(); ++line) {
  350. views.append(m_lines.at(line).view());
  351. }
  352. re.search(views, m_regex_result);
  353. m_regex_needs_update = false;
  354. m_regex_needle = String { needle };
  355. m_regex_result_match_index = -1;
  356. m_regex_result_match_capture_group_index = -1;
  357. }
  358. }
  359. TextRange TextDocument::find_next(const StringView& needle, const TextPosition& start, SearchShouldWrap should_wrap, bool regmatch, bool match_case)
  360. {
  361. if (needle.is_empty())
  362. return {};
  363. if (regmatch) {
  364. if (!m_regex_result.matches.size())
  365. return {};
  366. regex::Match match;
  367. bool use_whole_match { false };
  368. auto next_match = [&] {
  369. m_regex_result_match_capture_group_index = 0;
  370. if (m_regex_result_match_index == m_regex_result.matches.size() - 1) {
  371. if (should_wrap == SearchShouldWrap::Yes)
  372. m_regex_result_match_index = 0;
  373. else
  374. ++m_regex_result_match_index;
  375. } else
  376. ++m_regex_result_match_index;
  377. };
  378. if (m_regex_result.n_capture_groups) {
  379. if (m_regex_result_match_index >= m_regex_result.capture_group_matches.size())
  380. next_match();
  381. else {
  382. // check if last capture group has been reached
  383. if (m_regex_result_match_capture_group_index >= m_regex_result.capture_group_matches.at(m_regex_result_match_index).size()) {
  384. next_match();
  385. } else {
  386. // get to the next capture group item
  387. ++m_regex_result_match_capture_group_index;
  388. }
  389. }
  390. // use whole match, if there is no capture group for current index
  391. if (m_regex_result_match_index >= m_regex_result.capture_group_matches.size())
  392. use_whole_match = true;
  393. else if (m_regex_result_match_capture_group_index >= m_regex_result.capture_group_matches.at(m_regex_result_match_index).size())
  394. next_match();
  395. } else {
  396. next_match();
  397. }
  398. if (use_whole_match || !m_regex_result.capture_group_matches.at(m_regex_result_match_index).size())
  399. match = m_regex_result.matches.at(m_regex_result_match_index);
  400. else
  401. match = m_regex_result.capture_group_matches.at(m_regex_result_match_index).at(m_regex_result_match_capture_group_index);
  402. return TextRange { { match.line, match.column }, { match.line, match.column + match.view.length() } };
  403. }
  404. TextPosition position = start.is_valid() ? start : TextPosition(0, 0);
  405. TextPosition original_position = position;
  406. TextPosition start_of_potential_match;
  407. size_t needle_index = 0;
  408. do {
  409. auto ch = code_point_at(position);
  410. // FIXME: This is not the right way to use a Unicode needle!
  411. if (match_case ? ch == (u32)needle[needle_index] : tolower(ch) == tolower((u32)needle[needle_index])) {
  412. if (needle_index == 0)
  413. start_of_potential_match = position;
  414. ++needle_index;
  415. if (needle_index >= needle.length())
  416. return { start_of_potential_match, next_position_after(position, should_wrap) };
  417. } else {
  418. if (needle_index > 0)
  419. position = start_of_potential_match;
  420. needle_index = 0;
  421. }
  422. position = next_position_after(position, should_wrap);
  423. } while (position.is_valid() && position != original_position);
  424. return {};
  425. }
  426. TextRange TextDocument::find_previous(const StringView& needle, const TextPosition& start, SearchShouldWrap should_wrap, bool regmatch, bool match_case)
  427. {
  428. if (needle.is_empty())
  429. return {};
  430. if (regmatch) {
  431. if (!m_regex_result.matches.size())
  432. return {};
  433. regex::Match match;
  434. bool use_whole_match { false };
  435. auto next_match = [&] {
  436. if (m_regex_result_match_index == 0) {
  437. if (should_wrap == SearchShouldWrap::Yes)
  438. m_regex_result_match_index = m_regex_result.matches.size() - 1;
  439. else
  440. --m_regex_result_match_index;
  441. } else
  442. --m_regex_result_match_index;
  443. m_regex_result_match_capture_group_index = m_regex_result.capture_group_matches.at(m_regex_result_match_index).size() - 1;
  444. };
  445. if (m_regex_result.n_capture_groups) {
  446. if (m_regex_result_match_index >= m_regex_result.capture_group_matches.size())
  447. next_match();
  448. else {
  449. // check if last capture group has been reached
  450. if (m_regex_result_match_capture_group_index >= m_regex_result.capture_group_matches.at(m_regex_result_match_index).size()) {
  451. next_match();
  452. } else {
  453. // get to the next capture group item
  454. --m_regex_result_match_capture_group_index;
  455. }
  456. }
  457. // use whole match, if there is no capture group for current index
  458. if (m_regex_result_match_index >= m_regex_result.capture_group_matches.size())
  459. use_whole_match = true;
  460. else if (m_regex_result_match_capture_group_index >= m_regex_result.capture_group_matches.at(m_regex_result_match_index).size())
  461. next_match();
  462. } else {
  463. next_match();
  464. }
  465. if (use_whole_match || !m_regex_result.capture_group_matches.at(m_regex_result_match_index).size())
  466. match = m_regex_result.matches.at(m_regex_result_match_index);
  467. else
  468. match = m_regex_result.capture_group_matches.at(m_regex_result_match_index).at(m_regex_result_match_capture_group_index);
  469. return TextRange { { match.line, match.column }, { match.line, match.column + match.view.length() } };
  470. }
  471. TextPosition position = start.is_valid() ? start : TextPosition(0, 0);
  472. position = previous_position_before(position, should_wrap);
  473. if (position.line() >= line_count())
  474. return {};
  475. TextPosition original_position = position;
  476. TextPosition end_of_potential_match;
  477. size_t needle_index = needle.length() - 1;
  478. do {
  479. auto ch = code_point_at(position);
  480. // FIXME: This is not the right way to use a Unicode needle!
  481. if (match_case ? ch == (u32)needle[needle_index] : tolower(ch) == tolower((u32)needle[needle_index])) {
  482. if (needle_index == needle.length() - 1)
  483. end_of_potential_match = position;
  484. if (needle_index == 0)
  485. return { position, next_position_after(end_of_potential_match, should_wrap) };
  486. --needle_index;
  487. } else {
  488. if (needle_index < needle.length() - 1)
  489. position = end_of_potential_match;
  490. needle_index = needle.length() - 1;
  491. }
  492. position = previous_position_before(position, should_wrap);
  493. } while (position.is_valid() && position != original_position);
  494. return {};
  495. }
  496. Vector<TextRange> TextDocument::find_all(const StringView& needle, bool regmatch)
  497. {
  498. Vector<TextRange> ranges;
  499. TextPosition position;
  500. for (;;) {
  501. auto range = find_next(needle, position, SearchShouldWrap::No, regmatch);
  502. if (!range.is_valid())
  503. break;
  504. ranges.append(range);
  505. position = range.end();
  506. }
  507. return ranges;
  508. }
  509. Optional<TextDocumentSpan> TextDocument::first_non_skippable_span_before(const TextPosition& position) const
  510. {
  511. for (int i = m_spans.size() - 1; i >= 0; --i) {
  512. if (!m_spans[i].range.contains(position))
  513. continue;
  514. while ((i - 1) >= 0 && m_spans[i - 1].is_skippable)
  515. --i;
  516. if (i <= 0)
  517. return {};
  518. return m_spans[i - 1];
  519. }
  520. return {};
  521. }
  522. Optional<TextDocumentSpan> TextDocument::first_non_skippable_span_after(const TextPosition& position) const
  523. {
  524. for (size_t i = 0; i < m_spans.size(); ++i) {
  525. if (!m_spans[i].range.contains(position))
  526. continue;
  527. while ((i + 1) < m_spans.size() && m_spans[i + 1].is_skippable)
  528. ++i;
  529. if (i >= (m_spans.size() - 1))
  530. return {};
  531. return m_spans[i + 1];
  532. }
  533. return {};
  534. }
  535. TextPosition TextDocument::first_word_break_before(const TextPosition& position, bool start_at_column_before) const
  536. {
  537. if (position.column() == 0) {
  538. if (position.line() == 0) {
  539. return TextPosition(0, 0);
  540. }
  541. auto previous_line = this->line(position.line() - 1);
  542. return TextPosition(position.line() - 1, previous_line.length());
  543. }
  544. auto target = position;
  545. auto line = this->line(target.line());
  546. auto is_start_alphanumeric = isalnum(line.code_points()[target.column() - (start_at_column_before ? 1 : 0)]);
  547. while (target.column() > 0) {
  548. auto prev_code_point = line.code_points()[target.column() - 1];
  549. if ((is_start_alphanumeric && !isalnum(prev_code_point)) || (!is_start_alphanumeric && isalnum(prev_code_point)))
  550. break;
  551. target.set_column(target.column() - 1);
  552. }
  553. return target;
  554. }
  555. TextPosition TextDocument::first_word_break_after(const TextPosition& position) const
  556. {
  557. auto target = position;
  558. auto line = this->line(target.line());
  559. if (position.column() >= line.length()) {
  560. if (position.line() >= this->line_count() - 1) {
  561. return position;
  562. }
  563. return TextPosition(position.line() + 1, 0);
  564. }
  565. auto is_start_alphanumeric = isalnum(line.code_points()[target.column()]);
  566. while (target.column() < line.length()) {
  567. auto next_code_point = line.code_points()[target.column()];
  568. if ((is_start_alphanumeric && !isalnum(next_code_point)) || (!is_start_alphanumeric && isalnum(next_code_point)))
  569. break;
  570. target.set_column(target.column() + 1);
  571. }
  572. return target;
  573. }
  574. void TextDocument::undo()
  575. {
  576. if (!can_undo())
  577. return;
  578. m_undo_stack.undo();
  579. notify_did_change();
  580. }
  581. void TextDocument::redo()
  582. {
  583. if (!can_redo())
  584. return;
  585. m_undo_stack.redo();
  586. notify_did_change();
  587. }
  588. void TextDocument::add_to_undo_stack(NonnullOwnPtr<TextDocumentUndoCommand> undo_command)
  589. {
  590. m_undo_stack.push(move(undo_command));
  591. }
  592. TextDocumentUndoCommand::TextDocumentUndoCommand(TextDocument& document)
  593. : m_document(document)
  594. {
  595. }
  596. TextDocumentUndoCommand::~TextDocumentUndoCommand()
  597. {
  598. }
  599. InsertTextCommand::InsertTextCommand(TextDocument& document, const String& text, const TextPosition& position)
  600. : TextDocumentUndoCommand(document)
  601. , m_text(text)
  602. , m_range({ position, position })
  603. {
  604. }
  605. void InsertTextCommand::perform_formatting(const TextDocument::Client& client)
  606. {
  607. const size_t tab_width = client.soft_tab_width();
  608. const auto& dest_line = m_document.line(m_range.start().line());
  609. const bool should_auto_indent = client.is_automatic_indentation_enabled();
  610. StringBuilder builder;
  611. size_t column = m_range.start().column();
  612. size_t line_indentation = dest_line.leading_spaces();
  613. bool at_start_of_line = line_indentation == column;
  614. for (auto input_char : m_text) {
  615. if (input_char == '\n') {
  616. builder.append('\n');
  617. column = 0;
  618. if (should_auto_indent) {
  619. for (; column < line_indentation; ++column) {
  620. builder.append(' ');
  621. }
  622. }
  623. at_start_of_line = true;
  624. } else if (input_char == '\t') {
  625. size_t next_soft_tab_stop = ((column + tab_width) / tab_width) * tab_width;
  626. size_t spaces_to_insert = next_soft_tab_stop - column;
  627. for (size_t i = 0; i < spaces_to_insert; ++i) {
  628. builder.append(' ');
  629. }
  630. column = next_soft_tab_stop;
  631. if (at_start_of_line) {
  632. line_indentation = column;
  633. }
  634. } else {
  635. if (input_char == ' ') {
  636. if (at_start_of_line) {
  637. ++line_indentation;
  638. }
  639. } else {
  640. at_start_of_line = false;
  641. }
  642. builder.append(input_char);
  643. ++column;
  644. }
  645. }
  646. m_text = builder.build();
  647. }
  648. void InsertTextCommand::redo()
  649. {
  650. auto new_cursor = m_document.insert_at(m_range.start(), m_text, m_client);
  651. // NOTE: We don't know where the range ends until after doing redo().
  652. // This is okay since we always do redo() after adding this to the undo stack.
  653. m_range.set_end(new_cursor);
  654. m_document.set_all_cursors(new_cursor);
  655. }
  656. void InsertTextCommand::undo()
  657. {
  658. m_document.remove(m_range);
  659. m_document.set_all_cursors(m_range.start());
  660. }
  661. RemoveTextCommand::RemoveTextCommand(TextDocument& document, const String& text, const TextRange& range)
  662. : TextDocumentUndoCommand(document)
  663. , m_text(text)
  664. , m_range(range)
  665. {
  666. }
  667. void RemoveTextCommand::redo()
  668. {
  669. m_document.remove(m_range);
  670. m_document.set_all_cursors(m_range.start());
  671. }
  672. void RemoveTextCommand::undo()
  673. {
  674. auto new_cursor = m_document.insert_at(m_range.start(), m_text);
  675. m_document.set_all_cursors(new_cursor);
  676. }
  677. void TextDocument::update_undo_timer()
  678. {
  679. m_undo_stack.finalize_current_combo();
  680. }
  681. TextPosition TextDocument::insert_at(const TextPosition& position, const StringView& text, const Client* client)
  682. {
  683. TextPosition cursor = position;
  684. Utf8View utf8_view(text);
  685. for (auto code_point : utf8_view)
  686. cursor = insert_at(cursor, code_point, client);
  687. return cursor;
  688. }
  689. TextPosition TextDocument::insert_at(const TextPosition& position, u32 code_point, const Client*)
  690. {
  691. if (code_point == '\n') {
  692. auto new_line = make<TextDocumentLine>(*this);
  693. new_line->append(*this, line(position.line()).code_points() + position.column(), line(position.line()).length() - position.column());
  694. line(position.line()).truncate(*this, position.column());
  695. insert_line(position.line() + 1, move(new_line));
  696. notify_did_change();
  697. return { position.line() + 1, 0 };
  698. } else {
  699. line(position.line()).insert(*this, position.column(), code_point);
  700. notify_did_change();
  701. return { position.line(), position.column() + 1 };
  702. }
  703. }
  704. void TextDocument::remove(const TextRange& unnormalized_range)
  705. {
  706. if (!unnormalized_range.is_valid())
  707. return;
  708. auto range = unnormalized_range.normalized();
  709. // First delete all the lines in between the first and last one.
  710. for (size_t i = range.start().line() + 1; i < range.end().line();) {
  711. remove_line(i);
  712. range.end().set_line(range.end().line() - 1);
  713. }
  714. if (range.start().line() == range.end().line()) {
  715. // Delete within same line.
  716. auto& line = this->line(range.start().line());
  717. bool whole_line_is_selected = range.start().column() == 0 && range.end().column() == line.length();
  718. if (whole_line_is_selected) {
  719. line.clear(*this);
  720. } else {
  721. line.remove_range(*this, range.start().column(), range.end().column() - range.start().column());
  722. }
  723. } else {
  724. // Delete across a newline, merging lines.
  725. VERIFY(range.start().line() == range.end().line() - 1);
  726. auto& first_line = line(range.start().line());
  727. auto& second_line = line(range.end().line());
  728. Vector<u32> code_points;
  729. code_points.append(first_line.code_points(), range.start().column());
  730. code_points.append(second_line.code_points() + range.end().column(), second_line.length() - range.end().column());
  731. first_line.set_text(*this, move(code_points));
  732. remove_line(range.end().line());
  733. }
  734. if (lines().is_empty()) {
  735. append_line(make<TextDocumentLine>(*this));
  736. }
  737. notify_did_change();
  738. }
  739. bool TextDocument::is_empty() const
  740. {
  741. return line_count() == 1 && line(0).is_empty();
  742. }
  743. TextRange TextDocument::range_for_entire_line(size_t line_index) const
  744. {
  745. if (line_index >= line_count())
  746. return {};
  747. return { { line_index, 0 }, { line_index, line(line_index).length() } };
  748. }
  749. const TextDocumentSpan* TextDocument::span_at(const TextPosition& position) const
  750. {
  751. for (auto& span : m_spans) {
  752. if (span.range.contains(position))
  753. return &span;
  754. }
  755. return nullptr;
  756. }
  757. }