TextDocument.cpp 37 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210
  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::keep_range(TextDocument& document, size_t start_index, size_t length)
  210. {
  211. VERIFY(start_index + length < m_text.size());
  212. Vector<u32> new_data;
  213. new_data.ensure_capacity(m_text.size());
  214. for (size_t i = start_index; i <= (start_index + length); i++)
  215. new_data.append(m_text[i]);
  216. m_text = move(new_data);
  217. document.update_views({});
  218. }
  219. void TextDocumentLine::truncate(TextDocument& document, size_t length)
  220. {
  221. m_text.resize(length);
  222. document.update_views({});
  223. }
  224. void TextDocument::append_line(NonnullOwnPtr<TextDocumentLine> line)
  225. {
  226. lines().append(move(line));
  227. if (m_client_notifications_enabled) {
  228. for (auto* client : m_clients)
  229. client->document_did_append_line();
  230. }
  231. }
  232. void TextDocument::insert_line(size_t line_index, NonnullOwnPtr<TextDocumentLine> line)
  233. {
  234. lines().insert(line_index, move(line));
  235. if (m_client_notifications_enabled) {
  236. for (auto* client : m_clients)
  237. client->document_did_insert_line(line_index);
  238. }
  239. }
  240. NonnullOwnPtr<TextDocumentLine> TextDocument::take_line(size_t line_index)
  241. {
  242. auto line = lines().take(line_index);
  243. if (m_client_notifications_enabled) {
  244. for (auto* client : m_clients)
  245. client->document_did_remove_line(line_index);
  246. }
  247. return line;
  248. }
  249. void TextDocument::remove_line(size_t line_index)
  250. {
  251. lines().remove(line_index);
  252. if (m_client_notifications_enabled) {
  253. for (auto* client : m_clients)
  254. client->document_did_remove_line(line_index);
  255. }
  256. }
  257. void TextDocument::remove_all_lines()
  258. {
  259. lines().clear();
  260. if (m_client_notifications_enabled) {
  261. for (auto* client : m_clients)
  262. client->document_did_remove_all_lines();
  263. }
  264. }
  265. void TextDocument::register_client(Client& client)
  266. {
  267. m_clients.set(&client);
  268. }
  269. void TextDocument::unregister_client(Client& client)
  270. {
  271. m_clients.remove(&client);
  272. }
  273. void TextDocument::update_views(Badge<TextDocumentLine>)
  274. {
  275. notify_did_change();
  276. }
  277. void TextDocument::notify_did_change()
  278. {
  279. if (m_client_notifications_enabled) {
  280. for (auto* client : m_clients)
  281. client->document_did_change();
  282. }
  283. m_regex_needs_update = true;
  284. }
  285. void TextDocument::set_all_cursors(TextPosition const& position)
  286. {
  287. if (m_client_notifications_enabled) {
  288. for (auto* client : m_clients)
  289. client->document_did_set_cursor(position);
  290. }
  291. }
  292. String TextDocument::text() const
  293. {
  294. StringBuilder builder;
  295. for (size_t i = 0; i < line_count(); ++i) {
  296. auto& line = this->line(i);
  297. builder.append(line.view());
  298. if (i != line_count() - 1)
  299. builder.append('\n');
  300. }
  301. return builder.to_string();
  302. }
  303. String TextDocument::text_in_range(TextRange const& a_range) const
  304. {
  305. auto range = a_range.normalized();
  306. if (is_empty() || line_count() < range.end().line() - range.start().line())
  307. return String("");
  308. StringBuilder builder;
  309. for (size_t i = range.start().line(); i <= range.end().line(); ++i) {
  310. auto& line = this->line(i);
  311. size_t selection_start_column_on_line = range.start().line() == i ? range.start().column() : 0;
  312. size_t selection_end_column_on_line = range.end().line() == i ? range.end().column() : line.length();
  313. if (!line.is_empty()) {
  314. builder.append(
  315. Utf32View(
  316. line.code_points() + selection_start_column_on_line,
  317. selection_end_column_on_line - selection_start_column_on_line));
  318. }
  319. if (i != range.end().line())
  320. builder.append('\n');
  321. }
  322. return builder.to_string();
  323. }
  324. u32 TextDocument::code_point_at(TextPosition const& position) const
  325. {
  326. VERIFY(position.line() < line_count());
  327. auto& line = this->line(position.line());
  328. if (position.column() == line.length())
  329. return '\n';
  330. return line.code_points()[position.column()];
  331. }
  332. TextPosition TextDocument::next_position_after(TextPosition const& position, SearchShouldWrap should_wrap) const
  333. {
  334. auto& line = this->line(position.line());
  335. if (position.column() == line.length()) {
  336. if (position.line() == line_count() - 1) {
  337. if (should_wrap == SearchShouldWrap::Yes)
  338. return { 0, 0 };
  339. return {};
  340. }
  341. return { position.line() + 1, 0 };
  342. }
  343. return { position.line(), position.column() + 1 };
  344. }
  345. TextPosition TextDocument::previous_position_before(TextPosition const& position, SearchShouldWrap should_wrap) const
  346. {
  347. if (position.column() == 0) {
  348. if (position.line() == 0) {
  349. if (should_wrap == SearchShouldWrap::Yes) {
  350. auto& last_line = this->line(line_count() - 1);
  351. return { line_count() - 1, last_line.length() };
  352. }
  353. return {};
  354. }
  355. auto& prev_line = this->line(position.line() - 1);
  356. return { position.line() - 1, prev_line.length() };
  357. }
  358. return { position.line(), position.column() - 1 };
  359. }
  360. void TextDocument::update_regex_matches(StringView needle)
  361. {
  362. if (m_regex_needs_update || needle != m_regex_needle) {
  363. Regex<PosixExtended> re(needle);
  364. Vector<RegexStringView> views;
  365. for (size_t line = 0; line < m_lines.size(); ++line) {
  366. views.append(m_lines.at(line).view());
  367. }
  368. re.search(views, m_regex_result);
  369. m_regex_needs_update = false;
  370. m_regex_needle = String { needle };
  371. m_regex_result_match_index = -1;
  372. m_regex_result_match_capture_group_index = -1;
  373. }
  374. }
  375. TextRange TextDocument::find_next(StringView needle, TextPosition const& start, SearchShouldWrap should_wrap, bool regmatch, bool match_case)
  376. {
  377. if (needle.is_empty())
  378. return {};
  379. if (regmatch) {
  380. if (!m_regex_result.matches.size())
  381. return {};
  382. regex::Match match;
  383. bool use_whole_match { false };
  384. auto next_match = [&] {
  385. m_regex_result_match_capture_group_index = 0;
  386. if (m_regex_result_match_index == m_regex_result.matches.size() - 1) {
  387. if (should_wrap == SearchShouldWrap::Yes)
  388. m_regex_result_match_index = 0;
  389. else
  390. ++m_regex_result_match_index;
  391. } else
  392. ++m_regex_result_match_index;
  393. };
  394. if (m_regex_result.n_capture_groups) {
  395. if (m_regex_result_match_index >= m_regex_result.capture_group_matches.size())
  396. next_match();
  397. else {
  398. // check if last capture group has been reached
  399. if (m_regex_result_match_capture_group_index >= m_regex_result.capture_group_matches.at(m_regex_result_match_index).size()) {
  400. next_match();
  401. } else {
  402. // get to the next capture group item
  403. ++m_regex_result_match_capture_group_index;
  404. }
  405. }
  406. // use whole match, if there is no capture group for current index
  407. if (m_regex_result_match_index >= m_regex_result.capture_group_matches.size())
  408. use_whole_match = true;
  409. else if (m_regex_result_match_capture_group_index >= m_regex_result.capture_group_matches.at(m_regex_result_match_index).size())
  410. next_match();
  411. } else {
  412. next_match();
  413. }
  414. if (use_whole_match || !m_regex_result.capture_group_matches.at(m_regex_result_match_index).size())
  415. match = m_regex_result.matches.at(m_regex_result_match_index);
  416. else
  417. match = m_regex_result.capture_group_matches.at(m_regex_result_match_index).at(m_regex_result_match_capture_group_index);
  418. return TextRange { { match.line, match.column }, { match.line, match.column + match.view.length() } };
  419. }
  420. TextPosition position = start.is_valid() ? start : TextPosition(0, 0);
  421. TextPosition original_position = position;
  422. TextPosition start_of_potential_match;
  423. size_t needle_index = 0;
  424. do {
  425. auto ch = code_point_at(position);
  426. // FIXME: This is not the right way to use a Unicode needle!
  427. if (match_case ? ch == (u32)needle[needle_index] : tolower(ch) == tolower((u32)needle[needle_index])) {
  428. if (needle_index == 0)
  429. start_of_potential_match = position;
  430. ++needle_index;
  431. if (needle_index >= needle.length())
  432. return { start_of_potential_match, next_position_after(position, should_wrap) };
  433. } else {
  434. if (needle_index > 0)
  435. position = start_of_potential_match;
  436. needle_index = 0;
  437. }
  438. position = next_position_after(position, should_wrap);
  439. } while (position.is_valid() && position != original_position);
  440. return {};
  441. }
  442. TextRange TextDocument::find_previous(StringView needle, TextPosition const& start, SearchShouldWrap should_wrap, bool regmatch, bool match_case)
  443. {
  444. if (needle.is_empty())
  445. return {};
  446. if (regmatch) {
  447. if (!m_regex_result.matches.size())
  448. return {};
  449. regex::Match match;
  450. bool use_whole_match { false };
  451. auto next_match = [&] {
  452. if (m_regex_result_match_index == 0) {
  453. if (should_wrap == SearchShouldWrap::Yes)
  454. m_regex_result_match_index = m_regex_result.matches.size() - 1;
  455. else
  456. --m_regex_result_match_index;
  457. } else
  458. --m_regex_result_match_index;
  459. m_regex_result_match_capture_group_index = m_regex_result.capture_group_matches.at(m_regex_result_match_index).size() - 1;
  460. };
  461. if (m_regex_result.n_capture_groups) {
  462. if (m_regex_result_match_index >= m_regex_result.capture_group_matches.size())
  463. next_match();
  464. else {
  465. // check if last capture group has been reached
  466. if (m_regex_result_match_capture_group_index >= m_regex_result.capture_group_matches.at(m_regex_result_match_index).size()) {
  467. next_match();
  468. } else {
  469. // get to the next capture group item
  470. --m_regex_result_match_capture_group_index;
  471. }
  472. }
  473. // use whole match, if there is no capture group for current index
  474. if (m_regex_result_match_index >= m_regex_result.capture_group_matches.size())
  475. use_whole_match = true;
  476. else if (m_regex_result_match_capture_group_index >= m_regex_result.capture_group_matches.at(m_regex_result_match_index).size())
  477. next_match();
  478. } else {
  479. next_match();
  480. }
  481. if (use_whole_match || !m_regex_result.capture_group_matches.at(m_regex_result_match_index).size())
  482. match = m_regex_result.matches.at(m_regex_result_match_index);
  483. else
  484. match = m_regex_result.capture_group_matches.at(m_regex_result_match_index).at(m_regex_result_match_capture_group_index);
  485. return TextRange { { match.line, match.column }, { match.line, match.column + match.view.length() } };
  486. }
  487. TextPosition position = start.is_valid() ? start : TextPosition(0, 0);
  488. position = previous_position_before(position, should_wrap);
  489. if (position.line() >= line_count())
  490. return {};
  491. TextPosition original_position = position;
  492. TextPosition end_of_potential_match;
  493. size_t needle_index = needle.length() - 1;
  494. do {
  495. auto ch = code_point_at(position);
  496. // FIXME: This is not the right way to use a Unicode needle!
  497. if (match_case ? ch == (u32)needle[needle_index] : tolower(ch) == tolower((u32)needle[needle_index])) {
  498. if (needle_index == needle.length() - 1)
  499. end_of_potential_match = position;
  500. if (needle_index == 0)
  501. return { position, next_position_after(end_of_potential_match, should_wrap) };
  502. --needle_index;
  503. } else {
  504. if (needle_index < needle.length() - 1)
  505. position = end_of_potential_match;
  506. needle_index = needle.length() - 1;
  507. }
  508. position = previous_position_before(position, should_wrap);
  509. } while (position.is_valid() && position != original_position);
  510. return {};
  511. }
  512. Vector<TextRange> TextDocument::find_all(StringView needle, bool regmatch, bool match_case)
  513. {
  514. Vector<TextRange> ranges;
  515. TextPosition position;
  516. for (;;) {
  517. auto range = find_next(needle, position, SearchShouldWrap::No, regmatch, match_case);
  518. if (!range.is_valid())
  519. break;
  520. ranges.append(range);
  521. position = range.end();
  522. }
  523. return ranges;
  524. }
  525. Optional<TextDocumentSpan> TextDocument::first_non_skippable_span_before(TextPosition const& position) const
  526. {
  527. for (int i = m_spans.size() - 1; i >= 0; --i) {
  528. if (!m_spans[i].range.contains(position))
  529. continue;
  530. while ((i - 1) >= 0 && m_spans[i - 1].is_skippable)
  531. --i;
  532. if (i <= 0)
  533. return {};
  534. return m_spans[i - 1];
  535. }
  536. return {};
  537. }
  538. Optional<TextDocumentSpan> TextDocument::first_non_skippable_span_after(TextPosition const& position) const
  539. {
  540. size_t i = 0;
  541. // Find the first span containing the cursor
  542. for (; i < m_spans.size(); ++i) {
  543. if (m_spans[i].range.contains(position))
  544. break;
  545. }
  546. // Find the first span *after* the cursor
  547. // TODO: For a large number of spans, binary search would be faster.
  548. for (; i < m_spans.size(); ++i) {
  549. if (!m_spans[i].range.contains(position))
  550. break;
  551. }
  552. // Skip skippable spans
  553. for (; i < m_spans.size(); ++i) {
  554. if (!m_spans[i].is_skippable)
  555. break;
  556. }
  557. if (i < m_spans.size())
  558. return m_spans[i];
  559. return {};
  560. }
  561. TextPosition TextDocument::first_word_break_before(TextPosition const& position, bool start_at_column_before) const
  562. {
  563. if (position.column() == 0) {
  564. if (position.line() == 0) {
  565. return TextPosition(0, 0);
  566. }
  567. auto previous_line = this->line(position.line() - 1);
  568. return TextPosition(position.line() - 1, previous_line.length());
  569. }
  570. auto target = position;
  571. auto line = this->line(target.line());
  572. auto modifier = start_at_column_before ? 1 : 0;
  573. if (target.column() == line.length())
  574. modifier = 1;
  575. while (target.column() > 0 && is_ascii_blank(line.code_points()[target.column() - modifier]))
  576. target.set_column(target.column() - 1);
  577. auto is_start_alphanumeric = is_ascii_alphanumeric(line.code_points()[target.column() - modifier]);
  578. while (target.column() > 0) {
  579. auto prev_code_point = line.code_points()[target.column() - 1];
  580. if ((is_start_alphanumeric && !is_ascii_alphanumeric(prev_code_point)) || (!is_start_alphanumeric && is_ascii_alphanumeric(prev_code_point)))
  581. break;
  582. target.set_column(target.column() - 1);
  583. }
  584. return target;
  585. }
  586. TextPosition TextDocument::first_word_break_after(TextPosition const& position) const
  587. {
  588. auto target = position;
  589. auto line = this->line(target.line());
  590. if (position.column() >= line.length()) {
  591. if (position.line() >= this->line_count() - 1) {
  592. return position;
  593. }
  594. return TextPosition(position.line() + 1, 0);
  595. }
  596. while (target.column() < line.length() && is_ascii_space(line.code_points()[target.column()]))
  597. target.set_column(target.column() + 1);
  598. auto is_start_alphanumeric = is_ascii_alphanumeric(line.code_points()[target.column()]);
  599. while (target.column() < line.length()) {
  600. auto next_code_point = line.code_points()[target.column()];
  601. if ((is_start_alphanumeric && !is_ascii_alphanumeric(next_code_point)) || (!is_start_alphanumeric && is_ascii_alphanumeric(next_code_point)))
  602. break;
  603. target.set_column(target.column() + 1);
  604. }
  605. return target;
  606. }
  607. TextPosition TextDocument::first_word_before(TextPosition const& position, bool start_at_column_before) const
  608. {
  609. if (position.column() == 0) {
  610. if (position.line() == 0) {
  611. return TextPosition(0, 0);
  612. }
  613. auto previous_line = this->line(position.line() - 1);
  614. return TextPosition(position.line() - 1, previous_line.length());
  615. }
  616. auto target = position;
  617. auto line = this->line(target.line());
  618. if (target.column() == line.length())
  619. start_at_column_before = 1;
  620. auto nonblank_passed = !is_ascii_blank(line.code_points()[target.column() - start_at_column_before]);
  621. while (target.column() > 0) {
  622. auto prev_code_point = line.code_points()[target.column() - 1];
  623. nonblank_passed |= !is_ascii_blank(prev_code_point);
  624. if (nonblank_passed && is_ascii_blank(prev_code_point)) {
  625. break;
  626. } else if (is_ascii_punctuation(prev_code_point)) {
  627. target.set_column(target.column() - 1);
  628. break;
  629. }
  630. target.set_column(target.column() - 1);
  631. }
  632. return target;
  633. }
  634. void TextDocument::undo()
  635. {
  636. if (!can_undo())
  637. return;
  638. m_undo_stack.undo();
  639. notify_did_change();
  640. }
  641. void TextDocument::redo()
  642. {
  643. if (!can_redo())
  644. return;
  645. m_undo_stack.redo();
  646. notify_did_change();
  647. }
  648. void TextDocument::add_to_undo_stack(NonnullOwnPtr<TextDocumentUndoCommand> undo_command)
  649. {
  650. m_undo_stack.push(move(undo_command));
  651. }
  652. TextDocumentUndoCommand::TextDocumentUndoCommand(TextDocument& document)
  653. : m_document(document)
  654. {
  655. }
  656. InsertTextCommand::InsertTextCommand(TextDocument& document, String const& text, TextPosition const& position)
  657. : TextDocumentUndoCommand(document)
  658. , m_text(text)
  659. , m_range({ position, position })
  660. {
  661. }
  662. String InsertTextCommand::action_text() const
  663. {
  664. return "Insert Text";
  665. }
  666. bool InsertTextCommand::merge_with(GUI::Command const& other)
  667. {
  668. if (!is<InsertTextCommand>(other) || commit_time_expired())
  669. return false;
  670. auto const& typed_other = static_cast<InsertTextCommand const&>(other);
  671. if (typed_other.m_text.is_whitespace() && !m_text.is_whitespace())
  672. return false; // Skip if other is whitespace while this is not
  673. if (m_range.end() != typed_other.m_range.start())
  674. return false;
  675. if (m_range.start().line() != m_range.end().line())
  676. return false;
  677. StringBuilder builder(m_text.length() + typed_other.m_text.length());
  678. builder.append(m_text);
  679. builder.append(typed_other.m_text);
  680. m_text = builder.to_string();
  681. m_range.set_end(typed_other.m_range.end());
  682. m_timestamp = Time::now_monotonic();
  683. return true;
  684. }
  685. void InsertTextCommand::perform_formatting(TextDocument::Client const& client)
  686. {
  687. const size_t tab_width = client.soft_tab_width();
  688. auto const& dest_line = m_document.line(m_range.start().line());
  689. bool const should_auto_indent = client.is_automatic_indentation_enabled();
  690. StringBuilder builder;
  691. size_t column = m_range.start().column();
  692. size_t line_indentation = dest_line.leading_spaces();
  693. bool at_start_of_line = line_indentation == column;
  694. for (auto input_char : m_text) {
  695. if (input_char == '\n') {
  696. size_t spaces_at_end = 0;
  697. if (column < line_indentation)
  698. spaces_at_end = line_indentation - column;
  699. line_indentation -= spaces_at_end;
  700. builder.append('\n');
  701. column = 0;
  702. if (should_auto_indent) {
  703. for (; column < line_indentation; ++column) {
  704. builder.append(' ');
  705. }
  706. }
  707. at_start_of_line = true;
  708. } else if (input_char == '\t') {
  709. size_t next_soft_tab_stop = ((column + tab_width) / tab_width) * tab_width;
  710. size_t spaces_to_insert = next_soft_tab_stop - column;
  711. for (size_t i = 0; i < spaces_to_insert; ++i) {
  712. builder.append(' ');
  713. }
  714. column = next_soft_tab_stop;
  715. if (at_start_of_line) {
  716. line_indentation = column;
  717. }
  718. } else {
  719. if (input_char == ' ') {
  720. if (at_start_of_line) {
  721. ++line_indentation;
  722. }
  723. } else {
  724. at_start_of_line = false;
  725. }
  726. builder.append(input_char);
  727. ++column;
  728. }
  729. }
  730. m_text = builder.build();
  731. }
  732. void InsertTextCommand::redo()
  733. {
  734. auto new_cursor = m_document.insert_at(m_range.start(), m_text, m_client);
  735. // NOTE: We don't know where the range ends until after doing redo().
  736. // This is okay since we always do redo() after adding this to the undo stack.
  737. m_range.set_end(new_cursor);
  738. m_document.set_all_cursors(new_cursor);
  739. }
  740. void InsertTextCommand::undo()
  741. {
  742. m_document.remove(m_range);
  743. m_document.set_all_cursors(m_range.start());
  744. }
  745. RemoveTextCommand::RemoveTextCommand(TextDocument& document, String const& text, TextRange const& range)
  746. : TextDocumentUndoCommand(document)
  747. , m_text(text)
  748. , m_range(range)
  749. {
  750. }
  751. String RemoveTextCommand::action_text() const
  752. {
  753. return "Remove Text";
  754. }
  755. bool RemoveTextCommand::merge_with(GUI::Command const& other)
  756. {
  757. if (!is<RemoveTextCommand>(other) || commit_time_expired())
  758. return false;
  759. auto const& typed_other = static_cast<RemoveTextCommand const&>(other);
  760. if (m_range.start() != typed_other.m_range.end())
  761. return false;
  762. if (m_range.start().line() != m_range.end().line())
  763. return false;
  764. // Merge backspaces
  765. StringBuilder builder(m_text.length() + typed_other.m_text.length());
  766. builder.append(typed_other.m_text);
  767. builder.append(m_text);
  768. m_text = builder.to_string();
  769. m_range.set_start(typed_other.m_range.start());
  770. m_timestamp = Time::now_monotonic();
  771. return true;
  772. }
  773. void RemoveTextCommand::redo()
  774. {
  775. m_document.remove(m_range);
  776. m_document.set_all_cursors(m_range.start());
  777. }
  778. void RemoveTextCommand::undo()
  779. {
  780. auto new_cursor = m_document.insert_at(m_range.start(), m_text);
  781. m_document.set_all_cursors(new_cursor);
  782. }
  783. ReplaceAllTextCommand::ReplaceAllTextCommand(GUI::TextDocument& document, String const& text, GUI::TextRange const& range, String const& action_text)
  784. : TextDocumentUndoCommand(document)
  785. , m_text(text)
  786. , m_range(range)
  787. , m_action_text(action_text)
  788. {
  789. }
  790. void ReplaceAllTextCommand::redo()
  791. {
  792. m_document.remove(m_range);
  793. m_document.set_all_cursors(m_range.start());
  794. auto new_cursor = m_document.insert_at(m_range.start(), m_text, m_client);
  795. m_range.set_end(new_cursor);
  796. m_document.set_all_cursors(new_cursor);
  797. }
  798. void ReplaceAllTextCommand::undo()
  799. {
  800. m_document.remove(m_range);
  801. m_document.set_all_cursors(m_range.start());
  802. auto new_cursor = m_document.insert_at(m_range.start(), m_text);
  803. m_range.set_end(new_cursor);
  804. m_document.set_all_cursors(new_cursor);
  805. }
  806. bool ReplaceAllTextCommand::merge_with(GUI::Command const&)
  807. {
  808. return false;
  809. }
  810. String ReplaceAllTextCommand::action_text() const
  811. {
  812. return m_action_text;
  813. }
  814. IndentSelection::IndentSelection(TextDocument& document, size_t tab_width, TextRange const& range)
  815. : TextDocumentUndoCommand(document)
  816. , m_tab_width(tab_width)
  817. , m_range(range)
  818. {
  819. }
  820. void IndentSelection::redo()
  821. {
  822. auto const tab = String::repeated(' ', m_tab_width);
  823. for (size_t i = m_range.start().line(); i <= m_range.end().line(); i++) {
  824. m_document.insert_at({ i, 0 }, tab, m_client);
  825. }
  826. m_document.set_all_cursors(m_range.start());
  827. }
  828. void IndentSelection::undo()
  829. {
  830. for (size_t i = m_range.start().line(); i <= m_range.end().line(); i++) {
  831. m_document.remove({ { i, 0 }, { i, m_tab_width } });
  832. }
  833. m_document.set_all_cursors(m_range.start());
  834. }
  835. UnindentSelection::UnindentSelection(TextDocument& document, size_t tab_width, TextRange const& range)
  836. : TextDocumentUndoCommand(document)
  837. , m_tab_width(tab_width)
  838. , m_range(range)
  839. {
  840. }
  841. void UnindentSelection::redo()
  842. {
  843. for (size_t i = m_range.start().line(); i <= m_range.end().line(); i++) {
  844. if (m_document.line(i).leading_spaces() >= m_tab_width)
  845. m_document.remove({ { i, 0 }, { i, m_tab_width } });
  846. else
  847. m_document.remove({ { i, 0 }, { i, m_document.line(i).leading_spaces() } });
  848. }
  849. m_document.set_all_cursors(m_range.start());
  850. }
  851. void UnindentSelection::undo()
  852. {
  853. auto const tab = String::repeated(' ', m_tab_width);
  854. for (size_t i = m_range.start().line(); i <= m_range.end().line(); i++)
  855. m_document.insert_at({ i, 0 }, tab, m_client);
  856. m_document.set_all_cursors(m_range.start());
  857. }
  858. TextPosition TextDocument::insert_at(TextPosition const& position, StringView text, Client const* client)
  859. {
  860. TextPosition cursor = position;
  861. Utf8View utf8_view(text);
  862. for (auto code_point : utf8_view)
  863. cursor = insert_at(cursor, code_point, client);
  864. return cursor;
  865. }
  866. TextPosition TextDocument::insert_at(TextPosition const& position, u32 code_point, Client const*)
  867. {
  868. if (code_point == '\n') {
  869. auto new_line = make<TextDocumentLine>(*this);
  870. new_line->append(*this, line(position.line()).code_points() + position.column(), line(position.line()).length() - position.column());
  871. line(position.line()).truncate(*this, position.column());
  872. insert_line(position.line() + 1, move(new_line));
  873. notify_did_change();
  874. return { position.line() + 1, 0 };
  875. } else {
  876. line(position.line()).insert(*this, position.column(), code_point);
  877. notify_did_change();
  878. return { position.line(), position.column() + 1 };
  879. }
  880. }
  881. void TextDocument::remove(TextRange const& unnormalized_range)
  882. {
  883. if (!unnormalized_range.is_valid())
  884. return;
  885. auto range = unnormalized_range.normalized();
  886. // First delete all the lines in between the first and last one.
  887. for (size_t i = range.start().line() + 1; i < range.end().line();) {
  888. remove_line(i);
  889. range.end().set_line(range.end().line() - 1);
  890. }
  891. if (range.start().line() == range.end().line()) {
  892. // Delete within same line.
  893. auto& line = this->line(range.start().line());
  894. if (line.length() == 0)
  895. return;
  896. bool whole_line_is_selected = range.start().column() == 0 && range.end().column() == line.length();
  897. if (whole_line_is_selected) {
  898. line.clear(*this);
  899. } else {
  900. line.remove_range(*this, range.start().column(), range.end().column() - range.start().column());
  901. }
  902. } else {
  903. // Delete across a newline, merging lines.
  904. VERIFY(range.start().line() == range.end().line() - 1);
  905. auto& first_line = line(range.start().line());
  906. auto& second_line = line(range.end().line());
  907. Vector<u32> code_points;
  908. code_points.append(first_line.code_points(), range.start().column());
  909. if (!second_line.is_empty())
  910. code_points.append(second_line.code_points() + range.end().column(), second_line.length() - range.end().column());
  911. first_line.set_text(*this, move(code_points));
  912. remove_line(range.end().line());
  913. }
  914. if (lines().is_empty()) {
  915. append_line(make<TextDocumentLine>(*this));
  916. }
  917. notify_did_change();
  918. }
  919. bool TextDocument::is_empty() const
  920. {
  921. return line_count() == 1 && line(0).is_empty();
  922. }
  923. TextRange TextDocument::range_for_entire_line(size_t line_index) const
  924. {
  925. if (line_index >= line_count())
  926. return {};
  927. return { { line_index, 0 }, { line_index, line(line_index).length() } };
  928. }
  929. TextDocumentSpan const* TextDocument::span_at(TextPosition const& position) const
  930. {
  931. for (auto& span : m_spans) {
  932. if (span.range.contains(position))
  933. return &span;
  934. }
  935. return nullptr;
  936. }
  937. void TextDocument::set_unmodified()
  938. {
  939. m_undo_stack.set_current_unmodified();
  940. }
  941. void TextDocument::set_spans(u32 span_collection_index, Vector<TextDocumentSpan> spans)
  942. {
  943. m_span_collections.set(span_collection_index, move(spans));
  944. merge_span_collections();
  945. }
  946. struct SpanAndCollectionIndex {
  947. TextDocumentSpan span;
  948. u32 collection_index { 0 };
  949. };
  950. void TextDocument::merge_span_collections()
  951. {
  952. Vector<SpanAndCollectionIndex> sorted_spans;
  953. auto collection_indices = m_span_collections.keys();
  954. quick_sort(collection_indices);
  955. for (auto collection_index : collection_indices) {
  956. auto spans = m_span_collections.get(collection_index).value();
  957. for (auto span : spans) {
  958. sorted_spans.append({ move(span), collection_index });
  959. }
  960. }
  961. quick_sort(sorted_spans, [](SpanAndCollectionIndex const& a, SpanAndCollectionIndex const& b) {
  962. if (a.span.range.start() == b.span.range.start()) {
  963. return a.collection_index < b.collection_index;
  964. }
  965. return a.span.range.start() < b.span.range.start();
  966. });
  967. // The end of the TextRanges of spans are non-inclusive, i.e span range = [X,y).
  968. // This transforms the span's range to be inclusive, i.e [X,Y].
  969. auto adjust_end = [](GUI::TextDocumentSpan span) -> GUI::TextDocumentSpan {
  970. span.range.set_end({ span.range.end().line(), span.range.end().column() == 0 ? 0 : span.range.end().column() - 1 });
  971. return span;
  972. };
  973. Vector<SpanAndCollectionIndex> merged_spans;
  974. for (auto& span_and_collection_index : sorted_spans) {
  975. if (merged_spans.is_empty()) {
  976. merged_spans.append(span_and_collection_index);
  977. continue;
  978. }
  979. auto const& span = span_and_collection_index.span;
  980. auto last_span_and_collection_index = merged_spans.last();
  981. auto const& last_span = last_span_and_collection_index.span;
  982. if (adjust_end(span).range.start() > adjust_end(last_span).range.end()) {
  983. // Current span does not intersect with previous one, can simply append to merged list.
  984. merged_spans.append(span_and_collection_index);
  985. continue;
  986. }
  987. merged_spans.take_last();
  988. if (span.range.start() > last_span.range.start()) {
  989. SpanAndCollectionIndex first_part = last_span_and_collection_index;
  990. first_part.span.range.set_end(span.range.start());
  991. merged_spans.append(move(first_part));
  992. }
  993. SpanAndCollectionIndex merged_span;
  994. merged_span.collection_index = span_and_collection_index.collection_index;
  995. merged_span.span.range = { span.range.start(), min(span.range.end(), last_span.range.end()) };
  996. merged_span.span.is_skippable = span.is_skippable | last_span.is_skippable;
  997. merged_span.span.data = span.data ? span.data : last_span.data;
  998. 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;
  999. merged_span.span.attributes.bold = span.attributes.bold | last_span.attributes.bold;
  1000. merged_span.span.attributes.background_color = span.attributes.background_color.has_value() ? span.attributes.background_color.value() : last_span.attributes.background_color;
  1001. merged_span.span.attributes.underline = span.attributes.underline | last_span.attributes.underline;
  1002. merged_span.span.attributes.underline_color = span.attributes.underline_color.has_value() ? span.attributes.underline_color.value() : last_span.attributes.underline_color;
  1003. merged_span.span.attributes.underline_style = span.attributes.underline_style;
  1004. merged_spans.append(move(merged_span));
  1005. if (span.range.end() == last_span.range.end())
  1006. continue;
  1007. if (span.range.end() > last_span.range.end()) {
  1008. SpanAndCollectionIndex last_part = span_and_collection_index;
  1009. last_part.span.range.set_start(last_span.range.end());
  1010. merged_spans.append(move(last_part));
  1011. continue;
  1012. }
  1013. SpanAndCollectionIndex last_part = last_span_and_collection_index;
  1014. last_part.span.range.set_start(span.range.end());
  1015. merged_spans.append(move(last_part));
  1016. }
  1017. m_spans.clear();
  1018. for (auto span : merged_spans) {
  1019. m_spans.append(move(span.span));
  1020. }
  1021. }
  1022. }