3 * This file is part of LyX, the document processor.
4 * License details can be found in the file COPYING.
6 * \author Lars Gullik Bjønnes
9 * \author Alfredo Braunstein
10 * \author Tommaso Cucinotta
11 * \author Kornel Benko
13 * Full author contact details are available in file CREDITS.
21 #include "BufferList.h"
22 #include "BufferParams.h"
23 #include "BufferView.h"
26 #include "CutAndPaste.h"
27 #include "FuncRequest.h"
29 #include "output_latex.h"
30 #include "OutputParams.h"
31 #include "Paragraph.h"
35 #include "frontends/Application.h"
36 #include "frontends/alert.h"
38 #include "mathed/InsetMath.h"
39 #include "mathed/InsetMathHull.h"
40 #include "mathed/MathData.h"
41 #include "mathed/MathStream.h"
42 #include "mathed/MathSupport.h"
44 #include "support/debug.h"
45 #include "support/docstream.h"
46 #include "support/FileName.h"
47 #include "support/gettext.h"
48 #include "support/lassert.h"
49 #include "support/lstrings.h"
50 #include "support/textutils.h"
54 #include <QtCore> // sets QT_VERSION
55 #if (QT_VERSION >= 0x050000)
56 #include <QRegularExpression>
60 using namespace lyx::support;
65 // Helper class for deciding what should be ignored
69 IgnoreFormats() = default;
71 bool getFamily() const { return ignoreFamily_; }
73 bool getSeries() const { return ignoreSeries_; }
75 bool getShape() const { return ignoreShape_; }
77 bool getUnderline() const { return ignoreUnderline_; }
79 bool getMarkUp() const { return ignoreMarkUp_; }
81 bool getStrikeOut() const { return ignoreStrikeOut_; }
83 bool getSectioning() const { return ignoreSectioning_; }
85 bool getFrontMatter() const { return ignoreFrontMatter_; }
87 bool getColor() const { return ignoreColor_; }
89 bool getLanguage() const { return ignoreLanguage_; }
91 void setIgnoreFormat(string const & type, bool value);
95 bool ignoreFamily_ = false;
97 bool ignoreSeries_ = false;
99 bool ignoreShape_ = false;
101 bool ignoreUnderline_ = false;
103 bool ignoreMarkUp_ = false;
105 bool ignoreStrikeOut_ = false;
107 bool ignoreSectioning_ = false;
109 bool ignoreFrontMatter_ = false;
111 bool ignoreColor_ = false;
113 bool ignoreLanguage_ = false;
117 void IgnoreFormats::setIgnoreFormat(string const & type, bool value)
119 if (type == "color") {
120 ignoreColor_ = value;
122 else if (type == "language") {
123 ignoreLanguage_ = value;
125 else if (type == "sectioning") {
126 ignoreSectioning_ = value;
127 ignoreFrontMatter_ = value;
129 else if (type == "font") {
130 ignoreSeries_ = value;
131 ignoreShape_ = value;
132 ignoreFamily_ = value;
134 else if (type == "series") {
135 ignoreSeries_ = value;
137 else if (type == "shape") {
138 ignoreShape_ = value;
140 else if (type == "family") {
141 ignoreFamily_ = value;
143 else if (type == "markup") {
144 ignoreMarkUp_ = value;
146 else if (type == "underline") {
147 ignoreUnderline_ = value;
149 else if (type == "strike") {
150 ignoreStrikeOut_ = value;
154 // The global variable that can be changed from outside
155 IgnoreFormats ignoreFormats;
158 void setIgnoreFormat(string const & type, bool value)
160 ignoreFormats.setIgnoreFormat(type, value);
166 bool parse_bool(docstring & howto)
171 howto = split(howto, var, ' ');
179 MatchString(docstring const & s, bool cs, bool mw)
180 : str(s), case_sens(cs), whole_words(mw)
183 // returns true if the specified string is at the specified position
184 // del specifies whether deleted strings in ct mode will be considered
185 int operator()(Paragraph const & par, pos_type pos, bool del = true) const
187 return par.find(str, case_sens, whole_words, pos, del);
195 // match whole words only
200 int findForward(DocIterator & cur, MatchString const & match,
201 bool find_del = true)
203 for (; cur; cur.forwardChar())
204 if (cur.inTexted()) {
205 int len = match(cur.paragraph(), cur.pos(), find_del);
213 int findBackwards(DocIterator & cur, MatchString const & match,
214 bool find_del = true)
218 if (cur.inTexted()) {
219 int len = match(cur.paragraph(), cur.pos(), find_del);
228 bool searchAllowed(docstring const & str)
231 frontend::Alert::error(_("Search error"), _("Search string is empty"));
238 bool findOne(BufferView * bv, docstring const & searchstr,
239 bool case_sens, bool whole, bool forward,
240 bool find_del = true, bool check_wrap = false)
242 if (!searchAllowed(searchstr))
245 DocIterator cur = forward
246 ? bv->cursor().selectionEnd()
247 : bv->cursor().selectionBegin();
249 MatchString const match(searchstr, case_sens, whole);
251 int match_len = forward
252 ? findForward(cur, match, find_del)
253 : findBackwards(cur, match, find_del);
256 bv->putSelectionAt(cur, match_len, !forward);
257 else if (check_wrap) {
258 DocIterator cur_orig(bv->cursor());
261 q = _("End of file reached while searching forward.\n"
262 "Continue searching from the beginning?");
264 q = _("Beginning of file reached while searching backward.\n"
265 "Continue searching from the end?");
266 int wrap_answer = frontend::Alert::prompt(_("Wrap search?"),
267 q, 0, 1, _("&Yes"), _("&No"));
268 if (wrap_answer == 0) {
270 bv->cursor().clear();
271 bv->cursor().push_back(CursorSlice(bv->buffer().inset()));
273 bv->cursor().setCursor(doc_iterator_end(&bv->buffer()));
274 bv->cursor().backwardPos();
276 bv->clearSelection();
277 if (findOne(bv, searchstr, case_sens, whole, forward, find_del, false))
280 bv->cursor().setCursor(cur_orig);
284 return match_len > 0;
288 int replaceAll(BufferView * bv,
289 docstring const & searchstr, docstring const & replacestr,
290 bool case_sens, bool whole)
292 Buffer & buf = bv->buffer();
294 if (!searchAllowed(searchstr) || buf.isReadonly())
297 DocIterator cur_orig(bv->cursor());
299 MatchString const match(searchstr, case_sens, whole);
302 int const rsize = replacestr.size();
303 int const ssize = searchstr.size();
306 cur.setCursor(doc_iterator_begin(&buf));
307 int match_len = findForward(cur, match, false);
308 while (match_len > 0) {
309 // Backup current cursor position and font.
310 pos_type const pos = cur.pos();
311 Font const font = cur.paragraph().getFontSettings(buf.params(), pos);
313 int striked = ssize -
314 cur.paragraph().eraseChars(pos, pos + match_len,
315 buf.params().track_changes);
316 cur.paragraph().insert(pos, replacestr, font,
317 Change(buf.params().track_changes
319 : Change::UNCHANGED));
320 for (int i = 0; i < rsize + striked; ++i)
323 match_len = findForward(cur, match, false);
326 bv->putSelectionAt(doc_iterator_begin(&buf), 0, false);
328 cur_orig.fixIfBroken();
329 bv->setCursor(cur_orig);
335 // the idea here is that we are going to replace the string that
336 // is selected IF it is the search string.
337 // if there is a selection, but it is not the search string, then
338 // we basically ignore it. (FIXME We ought to replace only within
340 // if there is no selection, then:
341 // (i) if some search string has been provided, then we find it.
342 // (think of how the dialog works when you hit "replace" the
344 // (ii) if no search string has been provided, then we treat the
345 // word the cursor is in as the search string. (why? i have no
346 // idea.) but this only works in text?
348 // returns the number of replacements made (one, if any) and
349 // whether anything at all was done.
350 pair<bool, int> replaceOne(BufferView * bv, docstring searchstr,
351 docstring const & replacestr, bool case_sens,
352 bool whole, bool forward, bool findnext)
354 Cursor & cur = bv->cursor();
355 if (!cur.selection()) {
356 // no selection, non-empty search string: find it
357 if (!searchstr.empty()) {
358 bool const found = findOne(bv, searchstr, case_sens, whole, forward, true, findnext);
359 return make_pair(found, 0);
361 // empty search string
364 return make_pair(false, 0);
365 // select current word and treat it as the search string.
366 // This causes a minor bug as undo will restore this selection,
367 // which the user did not create (#8986).
368 cur.innerText()->selectWord(cur, WHOLE_WORD);
369 searchstr = cur.selectionAsString(false);
372 // if we still don't have a search string, report the error
374 if (!searchAllowed(searchstr))
375 return make_pair(false, 0);
377 bool have_selection = cur.selection();
378 docstring const selected = cur.selectionAsString(false);
381 ? searchstr == selected
382 : compare_no_case(searchstr, selected) == 0;
384 // no selection or current selection is not search word:
385 // just find the search word
386 if (!have_selection || !match) {
387 bool const found = findOne(bv, searchstr, case_sens, whole, forward, true, findnext);
388 return make_pair(found, 0);
391 // we're now actually ready to replace. if the buffer is
392 // read-only, we can't, though.
393 if (bv->buffer().isReadonly())
394 return make_pair(false, 0);
396 cap::replaceSelectionWithString(cur, replacestr);
398 cur.pos() += replacestr.length();
399 LASSERT(cur.pos() <= cur.lastpos(),
400 cur.pos() = cur.lastpos());
403 findOne(bv, searchstr, case_sens, whole, forward, false, findnext);
405 return make_pair(true, 1);
411 docstring const find2string(docstring const & search,
412 bool casesensitive, bool matchword, bool forward)
416 << int(casesensitive) << ' '
417 << int(matchword) << ' '
423 docstring const replace2string(docstring const & replace,
424 docstring const & search,
425 bool casesensitive, bool matchword,
426 bool all, bool forward, bool findnext)
429 ss << replace << '\n'
431 << int(casesensitive) << ' '
432 << int(matchword) << ' '
434 << int(forward) << ' '
440 bool lyxfind(BufferView * bv, FuncRequest const & ev)
442 if (!bv || ev.action() != LFUN_WORD_FIND)
445 //lyxerr << "find called, cmd: " << ev << endl;
447 // data is of the form
449 // <casesensitive> <matchword> <forward>"
451 docstring howto = split(ev.argument(), search, '\n');
453 bool casesensitive = parse_bool(howto);
454 bool matchword = parse_bool(howto);
455 bool forward = parse_bool(howto);
457 return findOne(bv, search, casesensitive, matchword, forward, true, true);
461 bool lyxreplace(BufferView * bv,
462 FuncRequest const & ev, bool has_deleted)
464 if (!bv || ev.action() != LFUN_WORD_REPLACE)
467 // data is of the form
470 // <casesensitive> <matchword> <all> <forward> <findnext>"
473 docstring howto = split(ev.argument(), rplc, '\n');
474 howto = split(howto, search, '\n');
476 bool casesensitive = parse_bool(howto);
477 bool matchword = parse_bool(howto);
478 bool all = parse_bool(howto);
479 bool forward = parse_bool(howto);
480 bool findnext = howto.empty() ? true : parse_bool(howto);
485 int replace_count = 0;
487 replace_count = replaceAll(bv, search, rplc, casesensitive, matchword);
488 update = replace_count > 0;
491 replaceOne(bv, search, rplc, casesensitive, matchword, forward, findnext);
493 replace_count = rv.second;
496 Buffer const & buf = bv->buffer();
498 // emit message signal.
499 buf.message(_("String not found."));
501 if (replace_count == 0) {
502 buf.message(_("String found."));
503 } else if (replace_count == 1) {
504 buf.message(_("String has been replaced."));
506 docstring const str =
507 bformat(_("%1$d strings have been replaced."), replace_count);
511 } else if (findnext) {
512 // if we have deleted characters, we do not replace at all, but
513 // rather search for the next occurence
514 if (findOne(bv, search, casesensitive, matchword, forward, true, findnext))
517 bv->message(_("String not found."));
523 bool findNextChange(BufferView * bv, Cursor & cur, bool const check_wrap)
525 for (; cur; cur.forwardPos())
526 if (cur.inTexted() && cur.paragraph().isChanged(cur.pos()))
530 DocIterator cur_orig(bv->cursor());
531 docstring q = _("End of file reached while searching forward.\n"
532 "Continue searching from the beginning?");
533 int wrap_answer = frontend::Alert::prompt(_("Wrap search?"),
534 q, 0, 1, _("&Yes"), _("&No"));
535 if (wrap_answer == 0) {
536 bv->cursor().clear();
537 bv->cursor().push_back(CursorSlice(bv->buffer().inset()));
538 bv->clearSelection();
539 cur.setCursor(bv->cursor().selectionBegin());
540 if (findNextChange(bv, cur, false))
543 bv->cursor().setCursor(cur_orig);
550 bool findPreviousChange(BufferView * bv, Cursor & cur, bool const check_wrap)
552 for (cur.backwardPos(); cur; cur.backwardPos()) {
553 if (cur.inTexted() && cur.paragraph().isChanged(cur.pos()))
558 DocIterator cur_orig(bv->cursor());
559 docstring q = _("Beginning of file reached while searching backward.\n"
560 "Continue searching from the end?");
561 int wrap_answer = frontend::Alert::prompt(_("Wrap search?"),
562 q, 0, 1, _("&Yes"), _("&No"));
563 if (wrap_answer == 0) {
564 bv->cursor().setCursor(doc_iterator_end(&bv->buffer()));
565 bv->cursor().backwardPos();
566 bv->clearSelection();
567 cur.setCursor(bv->cursor().selectionBegin());
568 if (findPreviousChange(bv, cur, false))
571 bv->cursor().setCursor(cur_orig);
578 bool selectChange(Cursor & cur, bool forward)
580 if (!cur.inTexted() || !cur.paragraph().isChanged(cur.pos()))
582 Change ch = cur.paragraph().lookupChange(cur.pos());
584 CursorSlice tip1 = cur.top();
585 for (; tip1.pit() < tip1.lastpit() || tip1.pos() < tip1.lastpos(); tip1.forwardPos()) {
586 Change ch2 = tip1.paragraph().lookupChange(tip1.pos());
587 if (!ch2.isSimilarTo(ch))
590 CursorSlice tip2 = cur.top();
591 for (; tip2.pit() > 0 || tip2.pos() > 0;) {
593 Change ch2 = tip2.paragraph().lookupChange(tip2.pos());
594 if (!ch2.isSimilarTo(ch)) {
595 // take a step forward to correctly set the selection
603 cur.bv().mouseSetCursor(cur, false);
605 cur.bv().mouseSetCursor(cur, true);
613 bool findChange(BufferView * bv, bool forward)
616 cur.setCursor(forward ? bv->cursor().selectionEnd()
617 : bv->cursor().selectionBegin());
618 forward ? findNextChange(bv, cur, true) : findPreviousChange(bv, cur, true);
619 return selectChange(cur, forward);
624 bool findNextChange(BufferView * bv)
626 return findChange(bv, true);
630 bool findPreviousChange(BufferView * bv)
632 return findChange(bv, false);
639 typedef vector<pair<string, string> > Escapes;
641 /// A map of symbols and their escaped equivalent needed within a regex.
642 /// @note Beware of order
643 Escapes const & get_regexp_escapes()
645 typedef std::pair<std::string, std::string> P;
647 static Escapes escape_map;
648 if (escape_map.empty()) {
649 escape_map.push_back(P("$", "_x_$"));
650 escape_map.push_back(P("{", "_x_{"));
651 escape_map.push_back(P("}", "_x_}"));
652 escape_map.push_back(P("[", "_x_["));
653 escape_map.push_back(P("]", "_x_]"));
654 escape_map.push_back(P("(", "_x_("));
655 escape_map.push_back(P(")", "_x_)"));
656 escape_map.push_back(P("+", "_x_+"));
657 escape_map.push_back(P("*", "_x_*"));
658 escape_map.push_back(P(".", "_x_."));
659 escape_map.push_back(P("\\", "(?:\\\\|\\\\backslash)"));
660 escape_map.push_back(P("~", "(?:\\\\textasciitilde|\\\\sim)"));
661 escape_map.push_back(P("^", "(?:\\^|\\\\textasciicircum\\{\\}|\\\\textasciicircum|\\\\mathcircumflex)"));
662 escape_map.push_back(P("_x_", "\\"));
667 /// A map of lyx escaped strings and their unescaped equivalent.
668 Escapes const & get_lyx_unescapes()
670 typedef std::pair<std::string, std::string> P;
672 static Escapes escape_map;
673 if (escape_map.empty()) {
674 escape_map.push_back(P("\\%", "%"));
675 escape_map.push_back(P("\\{", "{"));
676 escape_map.push_back(P("\\}", "}"));
677 escape_map.push_back(P("\\mathcircumflex ", "^"));
678 escape_map.push_back(P("\\mathcircumflex", "^"));
679 escape_map.push_back(P("\\backslash ", "\\"));
680 escape_map.push_back(P("\\backslash", "\\"));
681 escape_map.push_back(P("\\sim ", "~"));
682 escape_map.push_back(P("\\sim", "~"));
687 /// A map of escapes turning a regexp matching text to one matching latex.
688 Escapes const & get_regexp_latex_escapes()
690 typedef std::pair<std::string, std::string> P;
692 static Escapes escape_map;
693 if (escape_map.empty()) {
694 escape_map.push_back(P("\\\\", "(?:\\\\\\\\|\\\\backslash|\\\\textbackslash\\{\\}|\\\\textbackslash)"));
695 escape_map.push_back(P("(<?!\\\\\\\\textbackslash)\\{", "\\\\\\{"));
696 escape_map.push_back(P("(<?!\\\\\\\\textbackslash\\\\\\{)\\}", "\\\\\\}"));
697 escape_map.push_back(P("\\[", "\\{\\[\\}"));
698 escape_map.push_back(P("\\]", "\\{\\]\\}"));
699 escape_map.push_back(P("\\^", "(?:\\^|\\\\textasciicircum\\{\\}|\\\\textasciicircum|\\\\mathcircumflex)"));
700 escape_map.push_back(P("%", "\\\\\\%"));
701 escape_map.push_back(P("#", "\\\\#"));
706 /** @todo Probably the maps need to be migrated to regexps, in order to distinguish if
707 ** the found occurrence were escaped.
709 string apply_escapes(string s, Escapes const & escape_map)
711 LYXERR(Debug::FIND, "Escaping: '" << s << "'");
712 Escapes::const_iterator it;
713 for (it = escape_map.begin(); it != escape_map.end(); ++it) {
714 // LYXERR(Debug::FIND, "Escaping " << it->first << " as " << it->second);
715 unsigned int pos = 0;
716 while (pos < s.length() && (pos = s.find(it->first, pos)) < s.length()) {
717 s.replace(pos, it->first.length(), it->second);
718 LYXERR(Debug::FIND, "After escape: " << s);
719 pos += it->second.length();
720 // LYXERR(Debug::FIND, "pos: " << pos);
723 LYXERR(Debug::FIND, "Escaped : '" << s << "'");
728 /// Within \regexp{} apply get_lyx_unescapes() only (i.e., preserve regexp semantics of the string),
729 /// while outside apply get_lyx_unescapes()+get_regexp_escapes().
730 /// If match_latex is true, then apply regexp_latex_escapes() to \regexp{} contents as well.
731 string escape_for_regex(string s, bool match_latex)
734 while (pos < s.size()) {
735 size_t new_pos = s.find("\\regexp{", pos);
736 if (new_pos == string::npos)
740 LYXERR(Debug::FIND, "new_pos: " << new_pos);
741 t = apply_escapes(s.substr(pos, new_pos - pos), get_lyx_unescapes());
742 LYXERR(Debug::FIND, "t [lyx]: " << t);
743 t = apply_escapes(t, get_regexp_escapes());
744 LYXERR(Debug::FIND, "t [rxp]: " << t);
745 s.replace(pos, new_pos - pos, t);
746 new_pos = pos + t.size();
747 LYXERR(Debug::FIND, "Regexp after escaping: " << s);
748 LYXERR(Debug::FIND, "new_pos: " << new_pos);
749 if (new_pos == s.size())
752 // Might fail if \\endregexp{} is preceeded by unexpected stuff (weird escapes)
753 size_t end_pos = s.find("\\endregexp{}}", new_pos + 8);
754 LYXERR(Debug::FIND, "end_pos: " << end_pos);
755 t = s.substr(new_pos + 8, end_pos - (new_pos + 8));
756 LYXERR(Debug::FIND, "t in regexp : " << t);
757 t = apply_escapes(t, get_lyx_unescapes());
758 LYXERR(Debug::FIND, "t in regexp after unescapes [lyx]: " << t);
760 t = apply_escapes(t, get_regexp_latex_escapes());
761 LYXERR(Debug::FIND, "t in regexp after latex_escapes [ltx]: " << t);
763 if (end_pos == s.size()) {
764 s.replace(new_pos, end_pos - new_pos, t);
765 LYXERR(Debug::FIND, "Regexp after \\regexp{} removal: " << s);
768 s.replace(new_pos, end_pos + 13 - new_pos, t);
769 LYXERR(Debug::FIND, "Regexp after \\regexp{...\\endregexp{}} removal: " << s);
770 pos = new_pos + t.size();
771 LYXERR(Debug::FIND, "pos: " << pos);
777 /// Wrapper for lyx::regex_replace with simpler interface
778 bool regex_replace(string const & s, string & t, string const & searchstr,
779 string const & replacestr)
781 regex e(searchstr, regex_constants::ECMAScript);
783 ostream_iterator<char, char> it(oss);
784 regex_replace(it, s.begin(), s.end(), e, replacestr);
785 // tolerate t and s be references to the same variable
786 bool rv = (s != oss.str());
792 /** Checks if supplied string segment is well-formed from the standpoint of matching open-closed braces.
794 ** Verify that closed braces exactly match open braces. This avoids that, for example,
795 ** \frac{.*}{x} matches \frac{x+\frac{y}{x}}{z} with .* being 'x+\frac{y'.
798 ** Number of open braces that must remain open at the end for the verification to succeed.
800 #if (QT_VERSION >= 0x050000)
801 bool braces_match(QString const & beg,
804 bool braces_match(string const & beg,
809 #if (QT_VERSION >= 0x050000)
810 LYXERR(Debug::FIND, "Checking " << unmatched << " unmatched braces in '" << beg.toStdString() << "'");
812 LYXERR(Debug::FIND, "Checking " << unmatched << " unmatched braces in '" << beg << "'");
814 int lastidx = beg.size();
815 for (int i=0; i < lastidx; ++i) {
816 // Skip escaped braces in the count
817 #if (QT_VERSION >= 0x050000)
826 } else if (c == '{') {
828 } else if (c == '}') {
829 if (open_pars == 0) {
830 LYXERR(Debug::FIND, "Found unmatched closed brace");
836 if (open_pars != unmatched) {
837 LYXERR(Debug::FIND, "Found " << open_pars
838 << " instead of " << unmatched
839 << " unmatched open braces at the end of count");
842 LYXERR(Debug::FIND, "Braces match as expected");
852 MatchResult(): match_len(0),match2end(0), pos(0) {};
855 /** The class performing a match between a position in the document and the FindAdvOptions.
858 class MatchStringAdv {
860 MatchStringAdv(lyx::Buffer & buf, FindAndReplaceOptions const & opt);
862 /** Tests if text starting at the supplied position matches with the one provided to the MatchStringAdv
863 ** constructor as opt.search, under the opt.* options settings.
866 ** If set, then match is searched only against beginning of text starting at cur.
867 ** If unset, then match is searched anywhere in text starting at cur.
870 ** The length of the matching text, or zero if no match was found.
872 MatchResult operator()(DocIterator const & cur, int len = -1, bool at_begin = true) const;
873 #if (QT_VERSION >= 0x050000)
881 /// first buffer on which search was started
882 lyx::Buffer * const p_first_buf;
884 FindAndReplaceOptions const & opt;
887 /// Auxiliary find method (does not account for opt.matchword)
888 MatchResult findAux(DocIterator const & cur, int len = -1, bool at_begin = true) const;
890 /** Normalize a stringified or latexified LyX paragraph.
894 ** <li>if search is not casesensitive, then lowercase the string;
895 ** <li>remove any newline at begin or end of the string;
896 ** <li>replace any newline in the middle of the string with a simple space;
897 ** <li>remove stale empty styles and environments, like \emph{} and \textbf{}.
900 ** @todo Normalization should also expand macros, if the corresponding
901 ** search option was checked.
903 string normalize(docstring const & s, bool hack_braces) const;
904 // normalized string to search
905 string par_as_string;
906 // regular expression to use for searching
907 // regexp2 is same as regexp, but prefixed with a ".*?"
908 #if (QT_VERSION >= 0x050000)
909 QRegularExpression regexp;
910 QRegularExpression regexp2;
915 // leading format material as string
916 string lead_as_string;
917 // par_as_string after removal of lead_as_string
918 string par_as_string_nolead;
919 // unmatched open braces in the search string/regexp
921 // number of (.*?) subexpressions added at end of search regexp for closing
922 // environments, math mode, styles, etc...
924 // Are we searching with regular expressions ?
929 static docstring buffer_to_latex(Buffer & buffer)
931 //OutputParams runparams(&buffer.params().encoding());
932 OutputParams runparams(encodings.fromLyXName("utf8"));
933 odocstringstream ods;
935 runparams.nice = true;
936 runparams.flavor = Flavor::XeTeX;
937 runparams.linelen = 10000; //lyxrc.plaintext_linelen;
938 // No side effect of file copying and image conversion
939 runparams.dryrun = true;
940 runparams.for_search = true;
941 pit_type const endpit = buffer.paragraphs().size();
942 for (pit_type pit = 0; pit != endpit; ++pit) {
943 TeXOnePar(buffer, buffer.text(), pit, os, runparams);
944 LYXERR(Debug::FIND, "searchString up to here: " << ods.str());
950 static docstring stringifySearchBuffer(Buffer & buffer, FindAndReplaceOptions const & opt)
953 if (!opt.ignoreformat) {
954 str = buffer_to_latex(buffer);
956 // OutputParams runparams(&buffer.params().encoding());
957 OutputParams runparams(encodings.fromLyXName("utf8"));
958 runparams.nice = true;
959 runparams.flavor = Flavor::XeTeX;
960 runparams.linelen = 10000; //lyxrc.plaintext_linelen;
961 runparams.dryrun = true;
962 runparams.for_search = true;
963 for (pos_type pit = pos_type(0); pit < (pos_type)buffer.paragraphs().size(); ++pit) {
964 Paragraph const & par = buffer.paragraphs().at(pit);
965 LYXERR(Debug::FIND, "Adding to search string: '"
966 << par.asString(pos_type(0), par.size(),
967 AS_STR_INSETS | AS_STR_SKIPDELETE | AS_STR_PLAINTEXT,
970 str += par.asString(pos_type(0), par.size(),
971 AS_STR_INSETS | AS_STR_SKIPDELETE | AS_STR_PLAINTEXT,
974 // Even in ignore-format we have to remove "\text{}, \lyxmathsym{}" parts
975 string t = to_utf8(str);
976 while (regex_replace(t, t, "\\\\(text|lyxmathsym)\\{([^\\}]*)\\}", "$2"));
983 /// Return separation pos between the leading material and the rest
984 static size_t identifyLeading(string const & s)
987 // @TODO Support \item[text]
988 // Kornel: Added textsl, textsf, textit, texttt and noun
989 // + allow to search for colored text too
990 while (regex_replace(t, t, "^\\\\(("
991 "(author|title|subtitle|subject|publishers|dedication|uppertitleback|lowertitleback|extratitle|"
992 "lyxaddress|lyxrightaddress|"
993 "footnotesize|tiny|scriptsize|small|large|Large|LARGE|huge|Huge|"
994 "emph|noun|minisec|text(bf|md|sl|sf|it|tt))|"
995 "((textcolor|foreignlanguage|latexenvironment)\\{[a-z]+\\*?\\})|"
996 "(u|uu)line|(s|x)out|uwave)|((sub)?(((sub)?section)|paragraph)|part|chapter)\\*?)\\{", "")
997 || regex_replace(t, t, "^\\$", "")
998 || regex_replace(t, t, "^\\\\\\[", "")
999 || regex_replace(t, t, "^ ?\\\\item\\{[a-z]+\\}", "")
1000 || regex_replace(t, t, "^\\\\begin\\{[a-zA-Z_]*\\*?\\}", ""))
1002 LYXERR(Debug::FIND, " after removing leading $, \\[ , \\emph{, \\textbf{, etc.: '" << t << "'");
1007 * Given a latexified string, retrieve some handled features
1008 * The features of the regex will later be compared with the features
1009 * of the searched text. If the regex features are not a
1010 * subset of the analized, then, in not format ignoring search
1011 * we can early stop the search in the relevant inset.
1013 typedef map<string, bool> Features;
1015 static Features identifyFeatures(string const & s)
1017 static regex const feature("\\\\(([a-zA-Z]+(\\{([a-z]+\\*?)\\}|\\*)?))\\{");
1018 static regex const valid("^("
1020 "(footnotesize|tiny|scriptsize|small|large|Large|LARGE|huge|Huge|"
1021 "emph|noun|text(bf|md|sl|sf|it|tt)|"
1022 "(textcolor|foreignlanguage|item|listitem|latexenvironment)\\{[a-z]+\\*?\\})|"
1023 "(u|uu)line|(s|x)out|uwave|"
1024 "(sub|extra)?title|author|subject|publishers|dedication|(upper|lower)titleback|lyx(right)?address)|"
1025 "((sub)?(((sub)?section)|paragraph)|part|chapter|lyxslide)\\*?)$");
1030 for (sregex_iterator it(s.begin(), s.end(), feature), end; it != end; ++it) {
1033 if (sub.str(1).compare("regexp") == 0) {
1037 string token = sub.str(1);
1039 if (regex_match(token, sub2, valid)) {
1047 if (sub.str(1).compare("endregexp") == 0) {
1057 * defines values features of a key "\\[a-z]+{"
1062 /* Char type with content discarded
1063 * like \hspace{1cm} */
1065 /* Char, like \backslash */
1067 /* \part, \section*, ... */
1069 /* title, author etc */
1071 /* \foreignlanguage{ngerman}, ... */
1074 * to discard language in content */
1077 /* \begin{eqnarray}...\end{eqnarray}, ... $...$ */
1079 /* fonts, colors, markups, ... */
1081 /* footnotesize, ... large, ...
1082 * Ignore all of them */
1085 /* inputencoding, ...
1086 * Discard also content, because they do not help in search */
1089 * like remove, but also all arguments */
1091 /* item, listitem */
1093 /* tex, latex, ... like isChar */
1095 /* like \lettrine[lines=5]{}{} */
1097 // like isStandard, but always remove head
1099 /* End of arguments marker for lettrine,
1100 * so that they can be ignored */
1103 KeyInfo() = default;
1104 KeyInfo(KeyType type, int parcount, bool disable)
1106 parenthesiscount(parcount),
1107 disabled(disable) {}
1108 KeyType keytype = invalid;
1110 int _tokensize = -1;
1111 int _tokenstart = -1;
1112 int _dataStart = -1;
1114 int parenthesiscount = 1;
1115 bool disabled = false;
1116 bool used = false; /* by pattern */
1121 Border(int l=0, int u=0) : low(l), upper(u) {};
1126 #define MAXOPENED 30
1128 bool isPatternString_;
1130 explicit Intervall(bool isPattern, string const & p) :
1131 isPatternString_(isPattern), par(p), ignoreidx(-1), actualdeptindex(0),
1132 hasTitle(false), langcount(0)
1140 static vector<Border> borders;
1141 int depts[MAXOPENED];
1142 int closes[MAXOPENED];
1143 int actualdeptindex;
1144 int previousNotIgnored(int) const;
1145 int nextNotIgnored(int) const;
1146 void handleOpenP(int i);
1147 void handleCloseP(int i, bool closingAllowed);
1148 void resetOpenedP(int openPos);
1149 void addIntervall(int upper);
1150 void addIntervall(int low, int upper); /* if explicit */
1151 void removeAccents();
1152 void setForDefaultLang(KeyInfo const & defLang) const;
1153 int findclosing(int start, int end, char up, char down, int repeat);
1154 void handleParentheses(int lastpos, bool closingAllowed);
1156 int langcount; // Number of disabled language specs up to current position in actual interval
1157 int isOpeningPar(int pos) const;
1159 void output(ostringstream &os, int lastpos);
1160 // string show(int lastpos);
1163 vector<Border> Intervall::borders = vector<Border>(30);
1165 int Intervall::isOpeningPar(int pos) const
1167 if ((pos < 0) || (size_t(pos) >= par.size()))
1169 if (par[pos] != '{')
1171 if (size_t(pos) + 2 >= par.size())
1173 if (par[pos+2] != '}')
1175 if (par[pos+1] == '[' || par[pos+1] == ']')
1180 void Intervall::setForDefaultLang(KeyInfo const & defLang) const
1182 // Enable the use of first token again
1183 if (ignoreidx >= 0) {
1184 int value = defLang._tokenstart + defLang._tokensize;
1190 if (borders[borderidx].low < value)
1191 borders[borderidx].low = value;
1192 if (borders[borderidx].upper < value)
1193 borders[borderidx].upper = value;
1198 static void checkDepthIndex(int val)
1200 static int maxdepthidx = MAXOPENED-2;
1201 static int lastmaxdepth = 0;
1202 if (val > lastmaxdepth) {
1203 LYXERR(Debug::INFO, "Depth reached " << val);
1206 if (val > maxdepthidx) {
1208 LYXERR(Debug::INFO, "maxdepthidx now " << val);
1213 // Not needed, because borders are now dynamically expanded
1214 static void checkIgnoreIdx(int val)
1216 static int lastmaxignore = -1;
1217 if ((lastmaxignore < val) && (size_t(val+1) >= borders.size())) {
1218 LYXERR(Debug::INFO, "IgnoreIdx reached " << val);
1219 lastmaxignore = val;
1225 * Expand the region of ignored parts of the input latex string
1226 * The region is only relevant in output()
1228 void Intervall::addIntervall(int low, int upper)
1231 if (low == upper) return;
1232 for (idx = ignoreidx+1; idx > 0; --idx) {
1233 if (low > borders[idx-1].upper) {
1237 Border br(low, upper);
1238 if (idx > ignoreidx) {
1239 if (borders.size() <= size_t(idx)) {
1240 borders.push_back(br);
1246 // checkIgnoreIdx(ignoreidx);
1250 // Expand only if one of the new bound is inside the interwall
1251 // We know here that br.low > borders[idx-1].upper
1252 if (br.upper < borders[idx].low) {
1253 // We have to insert at this pos
1254 if (size_t(ignoreidx+1) >= borders.size()) {
1255 borders.push_back(borders[ignoreidx]);
1258 borders[ignoreidx+1] = borders[ignoreidx];
1260 for (int i = ignoreidx; i > idx; --i) {
1261 borders[i] = borders[i-1];
1265 // checkIgnoreIdx(ignoreidx);
1268 // Here we know, that we are overlapping
1269 if (br.low > borders[idx].low)
1270 br.low = borders[idx].low;
1271 // check what has to be concatenated
1273 for (int i = idx; i <= ignoreidx; i++) {
1274 if (br.upper >= borders[i].low) {
1276 if (br.upper < borders[i].upper)
1277 br.upper = borders[i].upper;
1283 // count should be >= 1 here
1286 for (int i = idx + count; i <= ignoreidx; i++) {
1287 borders[i-count+1] = borders[i];
1289 ignoreidx -= count - 1;
1295 typedef map<string, string> AccentsMap;
1296 static AccentsMap accents = map<string, string>();
1298 static void buildaccent(string n, string param, string values)
1302 const char delim = '|';
1303 while (getline(s, name, delim)) {
1305 for (char c : param) {
1306 string key = name + "{" + c + "}";
1307 // get the corresponding utf8-value
1308 if ((values[start] & 0xc0) != 0xc0) {
1309 // should not happen, utf8 encoding starts at least with 11xxxxxx
1310 // but value for '\dot{i}' is 'i', which is ascii
1311 if ((values[start] & 0x80) == 0) {
1313 accents[key] = values.substr(start, 1);
1314 // LYXERR(Debug::INFO, "" << key << "=" << accents[key]);
1319 for (int j = 1; ;j++) {
1320 if (start + j >= values.size()) {
1321 accents[key] = values.substr(start, j);
1322 start = values.size() - 1;
1325 else if ((values[start+j] & 0xc0) != 0x80) {
1326 // This is the first byte of following utf8 char
1327 accents[key] = values.substr(start, j);
1329 // LYXERR(Debug::INFO, "" << key << "=" << accents[key]);
1338 static string getutf8(unsigned uchar)
1341 string ret = string();
1343 if (uchar <= 0x7f) {
1344 c[maxc-1] = uchar & 0x7f;
1347 unsigned char rest = 0x40;
1348 unsigned char first = 0x80;
1350 for (int i = start; i >=0; --i) {
1352 c[i] = first + uchar;
1355 c[i] = 0x80 | (uchar & 0x3f);
1362 for (int i = 0; i < maxc; i++) {
1363 if (c[i] == 0) continue;
1369 static void buildAccentsMap()
1371 accents["imath"] = "ı";
1373 accents["jmath"] = "ȷ";
1374 accents["cdot"] = "·";
1375 accents["hairspace"] = getutf8(0xf0000); // select from free unicode plane 15
1376 accents["thinspace"] = getutf8(0xf0002); // and used _only_ by findadv
1377 accents["negthinspace"] = getutf8(0xf0003); // to omit backslashed latex macros
1378 accents["medspace"] = getutf8(0xf0004); // See https://en.wikipedia.org/wiki/Private_Use_Areas
1379 accents["negmedspace"] = getutf8(0xf0005);
1380 accents["thickspace"] = getutf8(0xf0006);
1381 accents["negthickspace"] = getutf8(0xf0007);
1382 accents["lyx"] = getutf8(0xf0010); // Used logos
1383 accents["LyX"] = getutf8(0xf0010);
1384 accents["tex"] = getutf8(0xf0011);
1385 accents["TeX"] = getutf8(0xf0011);
1386 accents["latex"] = getutf8(0xf0012);
1387 accents["LaTeX"] = getutf8(0xf0012);
1388 accents["latexe"] = getutf8(0xf0013);
1389 accents["LaTeXe"] = getutf8(0xf0013);
1390 accents["backslash lyx"] = getutf8(0xf0010); // Used logos inserted with starting \backslash
1391 accents["backslash LyX"] = getutf8(0xf0010);
1392 accents["backslash tex"] = getutf8(0xf0011);
1393 accents["backslash TeX"] = getutf8(0xf0011);
1394 accents["backslash latex"] = getutf8(0xf0012);
1395 accents["backslash LaTeX"] = getutf8(0xf0012);
1396 accents["backslash latexe"] = getutf8(0xf0013);
1397 accents["backslash LaTeXe"] = getutf8(0xf0013);
1398 accents["ddot{\\imath}"] = "ï";
1399 buildaccent("ddot", "aAeEhHiIioOtuUwWxXyY",
1400 "äÄëËḧḦïÏïöÖẗüÜẅẄẍẌÿŸ"); // umlaut
1401 buildaccent("dot|.", "aAbBcCdDeEfFGghHIimMnNoOpPrRsStTwWxXyYzZ",
1402 "ȧȦḃḂċĊḋḊėĖḟḞĠġḣḢİİṁṀṅṄȯȮṗṖṙṘṡṠṫṪẇẆẋẊẏẎżŻ"); // dot{i} can only happen if ignoring case, but there is no lowercase of 'İ'
1403 accents["acute{\\imath}"] = "í";
1404 buildaccent("acute", "aAcCeEgGkKlLmMoOnNpPrRsSuUwWyYzZiI",
1405 "áÁćĆéÉǵǴḱḰĺĹḿḾóÓńŃṕṔŕŔśŚúÚẃẂýÝźŹíÍ");
1406 buildaccent("dacute|H|h", "oOuU", "őŐűŰ"); // double acute
1407 buildaccent("mathring|r", "aAuUwy",
1409 accents["check{\\imath}"] = "ǐ";
1410 accents["check{\\jmath}"] = "ǰ";
1411 buildaccent("check|v", "cCdDaAeEiIoOuUgGkKhHlLnNrRsSTtzZ",
1412 "čČďĎǎǍěĚǐǏǒǑǔǓǧǦǩǨȟȞľĽňŇřŘšŠŤťžŽ"); // caron
1413 accents["hat{\\imath}"] = "î";
1414 accents["hat{\\jmath}"] = "ĵ";
1415 buildaccent("hat|^", "aAcCeEgGhHiIjJoOsSuUwWyYzZ",
1416 "âÂĉĈêÊĝĜĥĤîÎĵĴôÔŝŜûÛŵŴŷŶẑẐ"); // circ
1417 accents["bar{\\imath}"] = "ī";
1418 buildaccent("bar|=", "aAeEiIoOuUyY",
1419 "āĀēĒīĪōŌūŪȳȲ"); // macron
1420 accents["tilde{\\imath}"] = "ĩ";
1421 buildaccent("tilde", "aAeEiInNoOuUvVyY",
1422 "ãÃẽẼĩĨñÑõÕũŨṽṼỹỸ"); // tilde
1423 accents["breve{\\imath}"] = "ĭ";
1424 buildaccent("breve|u", "aAeEgGiIoOuU",
1425 "ăĂĕĔğĞĭĬŏŎŭŬ"); // breve
1426 accents["grave{\\imath}"] = "ì";
1427 buildaccent("grave|`", "aAeEiIoOuUnNwWyY",
1428 "àÀèÈìÌòÒùÙǹǸẁẀỳỲ"); // grave
1429 buildaccent("subdot|d", "BbDdHhKkLlMmNnRrSsTtVvWwZzAaEeIiOoUuYy",
1430 "ḄḅḌḍḤḥḲḳḶḷṂṃṆṇṚṛṢṣṬṭṾṿẈẉẒẓẠạẸẹỊịỌọỤụỴỵ"); // dot below
1431 buildaccent("ogonek|k", "AaEeIiUuOo",
1432 "ĄąĘęĮįŲųǪǫ"); // ogonek
1433 buildaccent("cedilla|c", "CcGgKkLlNnRrSsTtEeDdHh",
1434 "ÇçĢģĶķĻļŅņŖŗŞşŢţȨȩḐḑḨḩ"); // cedilla
1435 buildaccent("subring|textsubring", "Aa",
1437 buildaccent("subhat|textsubcircum", "DdEeLlNnTtUu",
1438 "ḒḓḘḙḼḽṊṋṰṱṶṷ"); // subcircum
1439 buildaccent("subtilde|textsubtilde", "EeIiUu",
1440 "ḚḛḬḭṴṵ"); // subtilde
1441 accents["dgrave{\\imath}"] = "ȉ";
1442 accents["textdoublegrave{\\i}"] = "ȉ";
1443 buildaccent("dgrave|textdoublegrave", "AaEeIiOoRrUu",
1444 "ȀȁȄȅȈȉȌȍȐȑȔȕ"); // double grave
1445 accents["rcap{\\imath}"] = "ȉ";
1446 accents["textroundcap{\\i}"] = "ȉ";
1447 buildaccent("rcap|textroundcap", "AaEeIiOoRrUu",
1448 "ȂȃȆȇȊȋȎȏȒȓȖȗ"); // inverted breve
1449 buildaccent("slashed", "oO",
1454 * Created accents in math or regexp environment
1455 * are macros, but we need the utf8 equivalent
1457 void Intervall::removeAccents()
1459 if (accents.empty())
1461 static regex const accre("\\\\(([\\S]|grave|breve|ddot|dot|acute|dacute|mathring|check|hat|bar|tilde|subdot|ogonek|"
1462 "cedilla|subring|textsubring|subhat|textsubcircum|subtilde|textsubtilde|dgrave|textdoublegrave|rcap|textroundcap|slashed)\\{[^\\{\\}]+\\}"
1463 "|((i|imath|jmath|cdot|[a-z]+space)|((backslash )?([lL]y[xX]|[tT]e[xX]|[lL]a[tT]e[xX]e?)))(?![a-zA-Z]))");
1465 for (sregex_iterator itacc(par.begin(), par.end(), accre), end; itacc != end; ++itacc) {
1467 string key = sub.str(1);
1468 if (accents.find(key) != accents.end()) {
1469 string val = accents[key];
1470 size_t pos = sub.position(size_t(0));
1471 for (size_t i = 0; i < val.size(); i++) {
1472 par[pos+i] = val[i];
1474 // Remove possibly following space too
1475 if (par[pos+sub.str(0).size()] == ' ')
1476 addIntervall(pos+val.size(), pos + sub.str(0).size()+1);
1478 addIntervall(pos+val.size(), pos + sub.str(0).size());
1479 for (size_t i = pos+val.size(); i < pos + sub.str(0).size(); i++) {
1480 // remove traces of any remaining chars
1485 LYXERR(Debug::INFO, "Not added accent for \"" << key << "\"");
1490 void Intervall::handleOpenP(int i)
1493 depts[actualdeptindex] = i+1;
1494 closes[actualdeptindex] = -1;
1495 checkDepthIndex(actualdeptindex);
1498 void Intervall::handleCloseP(int i, bool closingAllowed)
1500 if (actualdeptindex <= 0) {
1501 if (! closingAllowed)
1502 LYXERR(Debug::FIND, "Bad closing parenthesis in latex"); /* should not happen, but the latex input may be wrong */
1503 // if we are at the very end
1504 addIntervall(i, i+1);
1507 closes[actualdeptindex] = i+1;
1512 void Intervall::resetOpenedP(int openPos)
1514 // Used as initializer for foreignlanguage entry
1515 actualdeptindex = 1;
1516 depts[1] = openPos+1;
1520 int Intervall::previousNotIgnored(int start) const
1522 int idx = 0; /* int intervalls */
1523 for (idx = ignoreidx; idx >= 0; --idx) {
1524 if (start > borders[idx].upper)
1526 if (start >= borders[idx].low)
1527 start = borders[idx].low-1;
1532 int Intervall::nextNotIgnored(int start) const
1534 int idx = 0; /* int intervalls */
1535 for (idx = 0; idx <= ignoreidx; idx++) {
1536 if (start < borders[idx].low)
1538 if (start < borders[idx].upper)
1539 start = borders[idx].upper;
1544 typedef map<string, KeyInfo> KeysMap;
1545 typedef vector< KeyInfo> Entries;
1546 static KeysMap keys = map<string, KeyInfo>();
1552 Intervall interval_;
1553 void buildKeys(bool);
1554 void buildEntries(bool);
1555 void makeKey(const string &, KeyInfo, bool isPatternString);
1556 void processRegion(int start, int region_end); /* remove {} parts */
1557 void removeHead(KeyInfo const &, int count=0);
1560 LatexInfo(string const & par, bool isPatternString)
1561 : entidx_(-1), interval_(isPatternString, par)
1563 buildKeys(isPatternString);
1564 entries_ = vector<KeyInfo>();
1565 buildEntries(isPatternString);
1569 if (entries_.empty()) {
1572 if (entries_[0].keytype == KeyInfo::isTitle) {
1573 interval_.hasTitle = true;
1574 if (! entries_[0].disabled) {
1575 interval_.titleValue = entries_[0].head;
1578 interval_.titleValue = "";
1580 removeHead(entries_[0]);
1581 if (entries_.size() > 1)
1590 if (int(entries_.size()) > entidx_) {
1597 bool setNextKey(int idx) {
1598 if ((idx == entidx_) && (entidx_ >= 0)) {
1605 int find(int start, KeyInfo::KeyType keytype) const {
1609 while (tmpIdx < int(entries_.size())) {
1610 if (entries_[tmpIdx].keytype == keytype)
1616 int process(ostringstream & os, KeyInfo const & actual);
1617 int dispatch(ostringstream & os, int previousStart, KeyInfo & actual);
1618 // string show(int lastpos) { return interval.show(lastpos);};
1619 int nextNotIgnored(int start) { return interval_.nextNotIgnored(start);};
1620 KeyInfo &getKeyInfo(int keyinfo) {
1621 static KeyInfo invalidInfo = KeyInfo();
1622 if ((keyinfo < 0) || ( keyinfo >= int(entries_.size())))
1625 return entries_[keyinfo];
1627 void setForDefaultLang(KeyInfo const & defLang) {interval_.setForDefaultLang(defLang);};
1628 void addIntervall(int low, int up) { interval_.addIntervall(low, up); };
1632 int Intervall::findclosing(int start, int end, char up = '{', char down = '}', int repeat = 1)
1636 for (int i = start; i < end; i += 1 + skip) {
1640 if (c == '\\') skip = 1;
1644 else if (c == down) {
1647 if ((repeat <= 0) || (par[i+1] != up))
1665 vector<MathEntry> entries_;
1670 void insert(string const & wait, size_t start, size_t end) {
1671 MathEntry m = MathEntry();
1673 m.mathStart = start;
1675 m.mathSize = end - start;
1676 entries_.push_back(m);
1678 bool empty() const { return entries_.empty(); };
1679 size_t getEndPos() const {
1680 if (entries_.empty() || (actualIdx_ >= entries_.size())) {
1683 return entries_[actualIdx_].mathEnd;
1685 size_t getStartPos() const {
1686 if (entries_.empty() || (actualIdx_ >= entries_.size())) {
1687 return 100000; /* definitely enough? */
1689 return entries_[actualIdx_].mathStart;
1691 size_t getFirstPos() {
1693 return getStartPos();
1695 size_t getSize() const {
1696 if (entries_.empty() || (actualIdx_ >= entries_.size())) {
1699 return entries_[actualIdx_].mathSize;
1701 void incrEntry() { actualIdx_++; };
1704 void LatexInfo::buildEntries(bool isPatternString)
1706 static regex const rmath("\\$|\\\\\\[|\\\\\\]|\\\\(begin|end)\\{((eqnarray|equation|flalign|gather|multline|align|alignat)\\*?)\\}");
1707 static regex const rkeys("\\$|\\\\\\[|\\\\\\]|\\\\((([a-zA-Z]+\\*?)(\\{([a-z]+\\*?)\\}|=[0-9]+[a-z]+)?))");
1708 static bool disableLanguageOverride = false;
1709 smatch sub, submath;
1710 bool evaluatingRegexp = false;
1712 bool evaluatingMath = false;
1713 bool evaluatingCode = false;
1715 bool evaluatingOptional = false;
1716 size_t optionalEnd = 0;
1719 bool math_end_waiting = false;
1720 size_t math_pos = 10000;
1723 interval_.removeAccents();
1725 for (sregex_iterator itmath(interval_.par.begin(), interval_.par.end(), rmath), end; itmath != end; ++itmath) {
1727 if (math_end_waiting) {
1728 size_t pos = submath.position(size_t(0));
1729 if ((math_end == "$") &&
1730 (submath.str(0) == "$") &&
1731 (interval_.par[pos-1] != '\\')) {
1732 mi.insert("$", math_pos, pos + 1);
1733 math_end_waiting = false;
1735 else if ((math_end == "\\]") &&
1736 (submath.str(0) == "\\]")) {
1737 mi.insert("\\]", math_pos, pos + 2);
1738 math_end_waiting = false;
1740 else if ((submath.str(1).compare("end") == 0) &&
1741 (submath.str(2).compare(math_end) == 0)) {
1742 mi.insert(math_end, math_pos, pos + submath.str(0).length());
1743 math_end_waiting = false;
1749 if (submath.str(1).compare("begin") == 0) {
1750 math_end_waiting = true;
1751 math_end = submath.str(2);
1752 math_pos = submath.position(size_t(0));
1754 else if (submath.str(0).compare("\\[") == 0) {
1755 math_end_waiting = true;
1757 math_pos = submath.position(size_t(0));
1759 else if (submath.str(0) == "$") {
1760 size_t pos = submath.position(size_t(0));
1761 if ((pos == 0) || (interval_.par[pos-1] != '\\')) {
1762 math_end_waiting = true;
1769 // Ignore language if there is math somewhere in pattern-string
1770 if (isPatternString) {
1773 keys["foreignlanguage"].disabled = true;
1774 disableLanguageOverride = true;
1777 disableLanguageOverride = false;
1780 if (disableLanguageOverride) {
1781 keys["foreignlanguage"].disabled = true;
1784 math_pos = mi.getFirstPos();
1785 for (sregex_iterator it(interval_.par.begin(), interval_.par.end(), rkeys), end; it != end; ++it) {
1787 string key = sub.str(3);
1789 if (sub.str(0)[0] == '\\')
1790 key = sub.str(0)[1];
1794 size_t k_pos = sub.position(size_t(0));
1795 if ((k_pos > 0) && (interval_.par[k_pos - 1] == '\\')) {
1796 // Escaped '$', ignoring
1802 if (keys.find(key) != keys.end()) {
1803 if (keys[key].keytype == KeyInfo::headRemove) {
1804 KeyInfo found1 = keys[key];
1805 found1.disabled = true;
1806 found1.head = "\\" + key + "{";
1807 found1._tokenstart = sub.position(size_t(0));
1808 found1._tokensize = found1.head.length();
1809 found1._dataStart = found1._tokenstart + found1.head.length();
1810 int endpos = interval_.findclosing(found1._dataStart, interval_.par.length(), '{', '}', 1);
1811 found1._dataEnd = endpos;
1816 if (evaluatingRegexp) {
1817 if (sub.str(1).compare("endregexp") == 0) {
1818 evaluatingRegexp = false;
1819 // found._tokenstart already set
1820 found._dataEnd = sub.position(size_t(0)) + 13;
1821 found._dataStart = found._dataEnd;
1822 found._tokensize = found._dataEnd - found._tokenstart;
1823 found.parenthesiscount = 0;
1824 found.head = interval_.par.substr(found._tokenstart, found._tokensize);
1831 if (evaluatingMath) {
1832 if (size_t(sub.position(size_t(0))) < mi.getEndPos())
1834 evaluatingMath = false;
1836 math_pos = mi.getStartPos();
1838 if (keys.find(key) == keys.end()) {
1839 found = KeyInfo(KeyInfo::isStandard, 0, true);
1840 if (isPatternString) {
1841 found.keytype = KeyInfo::isChar;
1842 found.disabled = false;
1849 if (key.compare("regexp") == 0) {
1850 evaluatingRegexp = true;
1851 found._tokenstart = sub.position(size_t(0));
1852 found._tokensize = 0;
1856 // Handle the other params of key
1857 if (found.keytype == KeyInfo::isIgnored)
1859 else if (found.keytype == KeyInfo::isMath) {
1860 if (size_t(sub.position(size_t(0))) == math_pos) {
1862 found._tokenstart = sub.position(size_t(0));
1863 found._tokensize = mi.getSize();
1864 found._dataEnd = found._tokenstart + found._tokensize;
1865 found._dataStart = found._dataEnd;
1866 found.parenthesiscount = 0;
1867 found.head = interval_.par.substr(found._tokenstart, found._tokensize);
1868 evaluatingMath = true;
1871 // begin|end of unknown env, discard
1872 // First handle tables
1873 // longtable|tabular
1874 bool discardComment;
1876 found.keytype = KeyInfo::doRemove;
1877 if ((sub.str(5).compare("longtable") == 0) ||
1878 (sub.str(5).compare("tabular") == 0)) {
1879 discardComment = true; /* '%' */
1882 discardComment = false;
1883 static regex const removeArgs("^(multicols|multipar|sectionbox|subsectionbox|tcolorbox)$");
1885 string token = sub.str(5);
1886 if (regex_match(token, sub2, removeArgs)) {
1887 found.keytype = KeyInfo::removeWithArg;
1890 // discard spaces before pos(0)
1891 int pos = sub.position(size_t(0));
1893 for (count = 0; pos - count > 0; count++) {
1894 char c = interval_.par[pos-count-1];
1895 if (discardComment) {
1896 if ((c != ' ') && (c != '%'))
1902 found._tokenstart = pos - count;
1903 if (sub.str(1).compare(0, 5, "begin") == 0) {
1904 size_t pos1 = pos + sub.str(0).length();
1905 if (sub.str(5).compare("cjk") == 0) {
1906 pos1 = interval_.findclosing(pos1+1, interval_.par.length()) + 1;
1907 if ((interval_.par[pos1] == '{') && (interval_.par[pos1+1] == '}'))
1909 found.keytype = KeyInfo::isMain;
1910 found._dataStart = pos1;
1911 found._dataEnd = interval_.par.length();
1912 found.disabled = keys["foreignlanguage"].disabled;
1913 found.used = keys["foreignlanguage"].used;
1914 found._tokensize = pos1 - found._tokenstart;
1915 found.head = interval_.par.substr(found._tokenstart, found._tokensize);
1918 // Swallow possible optional params
1919 while (interval_.par[pos1] == '[') {
1920 pos1 = interval_.findclosing(pos1+1, interval_.par.length(), '[', ']')+1;
1922 // Swallow also the eventual parameter
1923 if (interval_.par[pos1] == '{') {
1924 found._dataEnd = interval_.findclosing(pos1+1, interval_.par.length()) + 1;
1927 found._dataEnd = pos1;
1929 found._dataStart = found._dataEnd;
1930 found._tokensize = count + found._dataEnd - pos;
1931 found.parenthesiscount = 0;
1932 found.head = interval_.par.substr(found._tokenstart, found._tokensize);
1933 found.disabled = true;
1937 // Handle "\end{...}"
1938 found._dataStart = pos + sub.str(0).length();
1939 found._dataEnd = found._dataStart;
1940 found._tokensize = count + found._dataEnd - pos;
1941 found.parenthesiscount = 0;
1942 found.head = interval_.par.substr(found._tokenstart, found._tokensize);
1943 found.disabled = true;
1947 else if (found.keytype != KeyInfo::isRegex) {
1948 found._tokenstart = sub.position(size_t(0));
1949 if (found.parenthesiscount == 0) {
1950 // Probably to be discarded
1951 size_t following_pos = sub.position(size_t(0)) + sub.str(3).length() + 1;
1952 char following = interval_.par[following_pos];
1953 if (following == ' ')
1954 found.head = "\\" + sub.str(3) + " ";
1955 else if (following == '=') {
1956 // like \uldepth=1000pt
1957 found.head = sub.str(0);
1960 found.head = "\\" + key;
1961 found._tokensize = found.head.length();
1962 found._dataEnd = found._tokenstart + found._tokensize;
1963 found._dataStart = found._dataEnd;
1966 int params = found._tokenstart + key.length() + 1;
1967 if (evaluatingOptional) {
1968 if (size_t(found._tokenstart) > optionalEnd) {
1969 evaluatingOptional = false;
1972 found.disabled = true;
1975 int optend = params;
1976 while (interval_.par[optend] == '[') {
1977 // discard optional parameters
1978 optend = interval_.findclosing(optend+1, interval_.par.length(), '[', ']') + 1;
1980 if (optend > params) {
1981 key += interval_.par.substr(params, optend-params);
1982 evaluatingOptional = true;
1983 optionalEnd = optend;
1985 string token = sub.str(5);
1986 int closings = found.parenthesiscount;
1987 if (found.parenthesiscount == 1) {
1988 found.head = "\\" + key + "{";
1990 else if (found.parenthesiscount > 1) {
1992 found.head = sub.str(0) + "{";
1993 closings = found.parenthesiscount - 1;
1996 found.head = "\\" + key + "{";
1999 found._tokensize = found.head.length();
2000 found._dataStart = found._tokenstart + found.head.length();
2001 if (found.keytype == KeyInfo::doRemove) {
2002 int endpar = 2 + interval_.findclosing(found._dataStart, interval_.par.length(), '{', '}', closings);
2003 found._dataStart = endpar;
2004 found._tokensize = found._dataStart - found._tokenstart;
2007 if (interval_.par.substr(found._dataStart-1, 15).compare("\\endarguments{}") == 0) {
2008 found._dataStart += 15;
2012 endpos = found._dataStart - 1;
2014 endpos = interval_.findclosing(found._dataStart, interval_.par.length(), '{', '}', closings);
2015 if (found.keytype == KeyInfo::isList) {
2016 // Check if it really is list env
2017 static regex const listre("^([a-z]+)$");
2019 if (!regex_match(token, sub2, listre)) {
2020 // Change the key of this entry. It is not in a list/item environment
2021 found.keytype = KeyInfo::endArguments;
2024 if (found.keytype == KeyInfo::noMain) {
2025 evaluatingCode = true;
2027 codeStart = found._dataStart;
2029 else if (evaluatingCode) {
2030 if (size_t(found._dataStart) > codeEnd)
2031 evaluatingCode = false;
2032 else if (found.keytype == KeyInfo::isMain) {
2033 // Disable this key, treate it as standard
2034 found.keytype = KeyInfo::isStandard;
2035 found.disabled = true;
2036 if ((codeEnd == interval_.par.length()) &&
2037 (found._tokenstart == codeStart)) {
2038 // trickery, because the code inset starts
2039 // with \selectlanguage ...
2041 if (entries_.size() > 1) {
2042 entries_[entries_.size()-1]._dataEnd = codeEnd;
2047 if ((endpos == interval_.par.length()) &&
2048 (found.keytype == KeyInfo::doRemove)) {
2049 // Missing closing => error in latex-input?
2050 // therefore do not delete remaining data
2051 found._dataStart -= 1;
2052 found._dataEnd = found._dataStart;
2055 found._dataEnd = endpos;
2057 if (isPatternString) {
2058 keys[key].used = true;
2061 entries_.push_back(found);
2065 void LatexInfo::makeKey(const string &keysstring, KeyInfo keyI, bool isPatternString)
2067 stringstream s(keysstring);
2069 const char delim = '|';
2070 while (getline(s, key, delim)) {
2071 KeyInfo keyII(keyI);
2072 if (isPatternString) {
2075 else if ( !keys[key].used)
2076 keyII.disabled = true;
2081 void LatexInfo::buildKeys(bool isPatternString)
2084 static bool keysBuilt = false;
2085 if (keysBuilt && !isPatternString) return;
2087 // Keys to ignore in any case
2088 makeKey("text|textcyrillic|lyxmathsym", KeyInfo(KeyInfo::headRemove, 1, true), true);
2089 // Known standard keys with 1 parameter.
2090 // Split is done, if not at start of region
2091 makeKey("textsf|textss|texttt", KeyInfo(KeyInfo::isStandard, 1, ignoreFormats.getFamily()), isPatternString);
2092 makeKey("textbf", KeyInfo(KeyInfo::isStandard, 1, ignoreFormats.getSeries()), isPatternString);
2093 makeKey("textit|textsc|textsl", KeyInfo(KeyInfo::isStandard, 1, ignoreFormats.getShape()), isPatternString);
2094 makeKey("uuline|uline|uwave", KeyInfo(KeyInfo::isStandard, 1, ignoreFormats.getUnderline()), isPatternString);
2095 makeKey("emph|noun", KeyInfo(KeyInfo::isStandard, 1, ignoreFormats.getMarkUp()), isPatternString);
2096 makeKey("sout|xout", KeyInfo(KeyInfo::isStandard, 1, ignoreFormats.getStrikeOut()), isPatternString);
2098 makeKey("section|subsection|subsubsection|paragraph|subparagraph|minisec",
2099 KeyInfo(KeyInfo::isSectioning, 1, ignoreFormats.getSectioning()), isPatternString);
2100 makeKey("section*|subsection*|subsubsection*|paragraph*",
2101 KeyInfo(KeyInfo::isSectioning, 1, ignoreFormats.getSectioning()), isPatternString);
2102 makeKey("part|part*|chapter|chapter*", KeyInfo(KeyInfo::isSectioning, 1, ignoreFormats.getSectioning()), isPatternString);
2103 makeKey("title|subtitle|author|subject|publishers|dedication|uppertitleback|lowertitleback|extratitle|lyxaddress|lyxrightaddress", KeyInfo(KeyInfo::isTitle, 1, ignoreFormats.getFrontMatter()), isPatternString);
2105 makeKey("regexp", KeyInfo(KeyInfo::isRegex, 1, false), isPatternString);
2107 // Split is done, if not at start of region
2108 makeKey("textcolor", KeyInfo(KeyInfo::isStandard, 2, ignoreFormats.getColor()), isPatternString);
2109 makeKey("latexenvironment", KeyInfo(KeyInfo::isStandard, 2, false), isPatternString);
2111 // Split is done always.
2112 makeKey("foreignlanguage", KeyInfo(KeyInfo::isMain, 2, ignoreFormats.getLanguage()), isPatternString);
2116 makeKey("backslash|textbackslash|slash", KeyInfo(KeyInfo::isChar, 0, false), isPatternString);
2117 makeKey("textasciicircum|textasciitilde", KeyInfo(KeyInfo::isChar, 0, false), isPatternString);
2118 makeKey("textasciiacute|texemdash", KeyInfo(KeyInfo::isChar, 0, false), isPatternString);
2119 makeKey("dots|ldots", KeyInfo(KeyInfo::isChar, 0, false), isPatternString);
2121 makeKey("quad|qquad|hfill|dotfill", KeyInfo(KeyInfo::isChar, 0, false), isPatternString);
2122 makeKey("textvisiblespace|nobreakspace", KeyInfo(KeyInfo::isChar, 0, false), isPatternString);
2123 makeKey("negthickspace|negmedspace|negthinspace", KeyInfo(KeyInfo::isChar, 0, false), isPatternString);
2124 makeKey("thickspace|medspace|thinspace", KeyInfo(KeyInfo::isChar, 0, false), isPatternString);
2126 // makeKey("enskip|smallskip|medskip|bigskip|vfill", KeyInfo(KeyInfo::isChar, 0, false), isPatternString);
2127 // Custom space/skip, remove the content (== length value)
2128 makeKey("vspace|vspace*|hspace|hspace*|mspace", KeyInfo(KeyInfo::noContent, 1, false), isPatternString);
2129 // Found in fr/UserGuide.lyx
2130 makeKey("og|fg", KeyInfo(KeyInfo::isChar, 0, false), isPatternString);
2132 makeKey("textquotedbl|quotesinglbase|lyxarrow", KeyInfo(KeyInfo::isChar, 0, false), isPatternString);
2133 makeKey("textquotedblleft|textquotedblright", KeyInfo(KeyInfo::isChar, 0, false), isPatternString);
2134 // Known macros to remove (including their parameter)
2136 makeKey("input|inputencoding|label|ref|index|bibitem", KeyInfo(KeyInfo::doRemove, 1, false), isPatternString);
2137 makeKey("addtocounter|setlength", KeyInfo(KeyInfo::noContent, 2, true), isPatternString);
2138 // handle like standard keys with 1 parameter.
2139 makeKey("url|href|vref|thanks", KeyInfo(KeyInfo::isStandard, 1, false), isPatternString);
2141 // Ignore deleted text
2142 makeKey("lyxdeleted", KeyInfo(KeyInfo::doRemove, 3, false), isPatternString);
2143 // but preserve added text
2144 makeKey("lyxadded", KeyInfo(KeyInfo::doRemove, 2, false), isPatternString);
2146 // Macros to remove, but let the parameter survive
2148 makeKey("menuitem|textmd|textrm", KeyInfo(KeyInfo::isStandard, 1, true), isPatternString);
2150 // Remove language spec from content of these insets
2151 makeKey("code", KeyInfo(KeyInfo::noMain, 1, false), isPatternString);
2153 // Same effect as previous, parameter will survive (because there is no one anyway)
2155 makeKey("noindent|textcompwordmark|maketitle", KeyInfo(KeyInfo::isStandard, 0, true), isPatternString);
2156 // Remove table decorations
2157 makeKey("hline|tabularnewline|toprule|bottomrule|midrule", KeyInfo(KeyInfo::doRemove, 0, true), isPatternString);
2158 // Discard shape-header.
2159 // For footnote or shortcut too, because of lang settings
2160 // and wrong handling if used 'KeyInfo::noMain'
2161 makeKey("circlepar|diamondpar|heartpar|nutpar", KeyInfo(KeyInfo::isStandard, 1, true), isPatternString);
2162 makeKey("trianglerightpar|hexagonpar|starpar", KeyInfo(KeyInfo::isStandard, 1, true), isPatternString);
2163 makeKey("triangleuppar|triangledownpar|droppar", KeyInfo(KeyInfo::isStandard, 1, true), isPatternString);
2164 makeKey("triangleleftpar|shapepar|dropuppar", KeyInfo(KeyInfo::isStandard, 1, true), isPatternString);
2165 makeKey("hphantom|vphantom|footnote|shortcut|include|includegraphics", KeyInfo(KeyInfo::isStandard, 1, true), isPatternString);
2166 makeKey("parbox", KeyInfo(KeyInfo::doRemove, 1, true), isPatternString);
2167 // like ('tiny{}' or '\tiny ' ... )
2168 makeKey("footnotesize|tiny|scriptsize|small|large|Large|LARGE|huge|Huge", KeyInfo(KeyInfo::isSize, 0, false), isPatternString);
2170 // Survives, like known character
2171 // makeKey("lyx|LyX|latex|LaTeX|latexe|LaTeXe|tex|TeX", KeyInfo(KeyInfo::isChar, 0, false), isPatternString);
2172 makeKey("item|listitem", KeyInfo(KeyInfo::isList, 1, false), isPatternString);
2174 makeKey("begin|end", KeyInfo(KeyInfo::isMath, 1, false), isPatternString);
2175 makeKey("[|]", KeyInfo(KeyInfo::isMath, 1, false), isPatternString);
2176 makeKey("$", KeyInfo(KeyInfo::isMath, 1, false), isPatternString);
2178 makeKey("par|uldepth|ULdepth|protect|nobreakdash|medskip|relax", KeyInfo(KeyInfo::isStandard, 0, true), isPatternString);
2179 // Remove RTL/LTR marker
2180 makeKey("l|r|textlr|textfr|textar|beginl|endl", KeyInfo(KeyInfo::isStandard, 0, true), isPatternString);
2181 makeKey("lettrine", KeyInfo(KeyInfo::cleanToStart, 0, true), isPatternString);
2182 makeKey("lyxslide", KeyInfo(KeyInfo::isSectioning, 1, true), isPatternString);
2183 makeKey("endarguments", KeyInfo(KeyInfo::endArguments, 0, true), isPatternString);
2184 makeKey("twocolumn", KeyInfo(KeyInfo::removeWithArg, 2, true), isPatternString);
2185 makeKey("tnotetext|ead|fntext|cortext|address", KeyInfo(KeyInfo::removeWithArg, 0, true), isPatternString);
2186 makeKey("lyxend", KeyInfo(KeyInfo::isStandard, 0, true), isPatternString);
2187 if (isPatternString) {
2188 // Allow the first searched string to rebuild the keys too
2192 // no need to rebuild again
2198 * Keep the list of actual opened parentheses actual
2199 * (e.g. depth == 4 means there are 4 '{' not processed yet)
2201 void Intervall::handleParentheses(int lastpos, bool closingAllowed)
2204 for (int i = depts[actualdeptindex]; i < lastpos; i+= 1 + skip) {
2208 if (c == '\\') skip = 1;
2209 else if (c == '{') {
2212 else if (c == '}') {
2213 handleCloseP(i, closingAllowed);
2219 string Intervall::show(int lastpos)
2221 int idx = 0; /* int intervalls */
2224 for (idx = 0; idx <= ignoreidx; idx++) {
2225 while (i < lastpos) {
2227 if (i <= borders[idx].low) {
2228 if (borders[idx].low > lastpos)
2229 printsize = lastpos - i;
2231 printsize = borders[idx].low - i;
2232 s += par.substr(i, printsize);
2234 if (i >= borders[idx].low)
2235 i = borders[idx].upper;
2238 i = borders[idx].upper;
2244 s += par.substr(i, lastpos-i);
2250 void Intervall::output(ostringstream &os, int lastpos)
2252 // get number of chars to output
2253 int idx = 0; /* int intervalls */
2256 string startTitle = titleValue;
2257 for (idx = 0; idx <= ignoreidx; idx++) {
2259 if (i <= borders[idx].low) {
2261 if (borders[idx].low > lastpos)
2262 printsize = lastpos - i;
2264 printsize = borders[idx].low - i;
2265 if (printsize > 0) {
2266 os << startTitle << par.substr(i, printsize);
2268 printed += printsize;
2271 handleParentheses(i, false);
2272 if (i >= borders[idx].low)
2273 i = borders[idx].upper;
2276 i = borders[idx].upper;
2283 os << startTitle << par.substr(i, lastpos-i);
2284 printed += lastpos-i;
2286 handleParentheses(lastpos, false);
2288 if (keys["foreignlanguage"].disabled)
2289 startindex = actualdeptindex-langcount;
2291 startindex = actualdeptindex;
2292 for (int i = startindex; i > 0; --i) {
2295 if (hasTitle && (printed > 0))
2297 if (! isPatternString_)
2299 handleParentheses(lastpos, true); /* extra closings '}' allowed here */
2302 void LatexInfo::processRegion(int start, int region_end)
2304 while (start < region_end) { /* Let {[} and {]} survive */
2305 int cnt = interval_.isOpeningPar(start);
2307 // Closing is allowed past the region
2308 int closing = interval_.findclosing(start+1, interval_.par.length());
2309 interval_.addIntervall(start, start+1);
2310 interval_.addIntervall(closing, closing+1);
2314 start = interval_.nextNotIgnored(start+1);
2318 void LatexInfo::removeHead(KeyInfo const & actual, int count)
2320 if (actual.parenthesiscount == 0) {
2321 // "{\tiny{} ...}" ==> "{{} ...}"
2322 interval_.addIntervall(actual._tokenstart-count, actual._tokenstart + actual._tokensize);
2325 // Remove header hull, that is "\url{abcd}" ==> "abcd"
2326 interval_.addIntervall(actual._tokenstart - count, actual._dataStart);
2327 interval_.addIntervall(actual._dataEnd, actual._dataEnd+1);
2331 int LatexInfo::dispatch(ostringstream &os, int previousStart, KeyInfo &actual)
2334 switch (actual.keytype)
2336 case KeyInfo::isTitle: {
2338 nextKeyIdx = getNextKey();
2341 case KeyInfo::cleanToStart: {
2342 actual._dataEnd = actual._dataStart;
2343 nextKeyIdx = getNextKey();
2344 // Search for end of arguments
2345 int tmpIdx = find(nextKeyIdx, KeyInfo::endArguments);
2347 for (int i = nextKeyIdx; i <= tmpIdx; i++) {
2348 entries_[i].disabled = true;
2350 actual._dataEnd = entries_[tmpIdx]._dataEnd;
2352 while (interval_.par[actual._dataEnd] == ' ')
2354 interval_.addIntervall(0, actual._dataEnd+1);
2355 interval_.actualdeptindex = 0;
2356 interval_.depts[0] = actual._dataEnd+1;
2357 interval_.closes[0] = -1;
2360 case KeyInfo::noContent: { /* char like "\hspace{2cm}" */
2361 if (actual.disabled)
2362 interval_.addIntervall(actual._tokenstart, actual._dataEnd);
2364 interval_.addIntervall(actual._dataStart, actual._dataEnd);
2367 case KeyInfo::isChar: {
2368 nextKeyIdx = getNextKey();
2371 case KeyInfo::isSize: {
2372 if (actual.disabled || (interval_.par[actual._dataStart] != '{') || (interval_.par[actual._dataStart-1] == ' ')) {
2373 processRegion(actual._dataEnd, actual._dataEnd+1); /* remove possibly following {} */
2374 interval_.addIntervall(actual._tokenstart, actual._dataEnd+1);
2375 nextKeyIdx = getNextKey();
2377 // Here _dataStart points to '{', so correct it
2378 actual._dataStart += 1;
2379 actual._tokensize += 1;
2380 actual.parenthesiscount = 1;
2381 if (interval_.par[actual._dataStart] == '}') {
2382 // Determine the end if used like '{\tiny{}...}'
2383 actual._dataEnd = interval_.findclosing(actual._dataStart+1, interval_.par.length()) + 1;
2384 interval_.addIntervall(actual._dataStart, actual._dataStart+1);
2387 // Determine the end if used like '\tiny{...}'
2388 actual._dataEnd = interval_.findclosing(actual._dataStart, interval_.par.length()) + 1;
2390 // Split on this key if not at start
2391 int start = interval_.nextNotIgnored(previousStart);
2392 if (start < actual._tokenstart) {
2393 interval_.output(os, actual._tokenstart);
2394 interval_.addIntervall(start, actual._tokenstart);
2396 // discard entry if at end of actual
2397 nextKeyIdx = process(os, actual);
2401 case KeyInfo::endArguments: {
2402 // Remove trailing '{}' too
2403 actual._dataStart += 1;
2404 actual._dataEnd += 1;
2405 interval_.addIntervall(actual._tokenstart, actual._dataEnd+1);
2406 nextKeyIdx = getNextKey();
2409 case KeyInfo::noMain:
2411 case KeyInfo::isStandard: {
2412 if (actual.disabled) {
2414 processRegion(actual._dataStart, actual._dataStart+1);
2415 nextKeyIdx = getNextKey();
2417 // Split on this key if not at datastart of calling entry
2418 int start = interval_.nextNotIgnored(previousStart);
2419 if (start < actual._tokenstart) {
2420 interval_.output(os, actual._tokenstart);
2421 interval_.addIntervall(start, actual._tokenstart);
2423 // discard entry if at end of actual
2424 nextKeyIdx = process(os, actual);
2428 case KeyInfo::removeWithArg: {
2429 nextKeyIdx = getNextKey();
2430 // Search for end of arguments
2431 int tmpIdx = find(nextKeyIdx, KeyInfo::endArguments);
2433 for (int i = nextKeyIdx; i <= tmpIdx; i++) {
2434 entries_[i].disabled = true;
2436 actual._dataEnd = entries_[tmpIdx]._dataEnd;
2438 interval_.addIntervall(actual._tokenstart, actual._dataEnd+1);
2441 case KeyInfo::doRemove: {
2442 // Remove the key with all parameters and following spaces
2444 for (pos = actual._dataEnd+1; pos < interval_.par.length(); pos++) {
2445 if ((interval_.par[pos] != ' ') && (interval_.par[pos] != '%'))
2448 // Remove also enclosing parentheses [] and {}
2451 while (actual._tokenstart > numpars) {
2452 if (pos+numpars >= interval_.par.size())
2454 else if (interval_.par[pos+numpars] == ']' && interval_.par[actual._tokenstart-numpars-1] == '[')
2456 else if (interval_.par[pos+numpars] == '}' && interval_.par[actual._tokenstart-numpars-1] == '{')
2462 if (interval_.par[pos+numpars] == ' ')
2466 interval_.addIntervall(actual._tokenstart-numpars, pos+numpars+spaces);
2467 nextKeyIdx = getNextKey();
2470 case KeyInfo::isList: {
2471 // Discard space before _tokenstart
2473 for (count = 0; count < actual._tokenstart; count++) {
2474 if (interval_.par[actual._tokenstart-count-1] != ' ')
2477 nextKeyIdx = getNextKey();
2478 int tmpIdx = find(nextKeyIdx, KeyInfo::endArguments);
2480 // Special case: \item is not a list, but a command (like in Style Author_Biography in maa-monthly.layout)
2482 // How else can we catch this one?
2483 for (int i = nextKeyIdx; i <= tmpIdx; i++) {
2484 entries_[i].disabled = true;
2486 actual._dataEnd = entries_[tmpIdx]._dataEnd;
2488 else if (nextKeyIdx > 0) {
2489 // Ignore any lang entries inside data region
2490 for (int i = nextKeyIdx; i < int(entries_.size()) && entries_[i]._tokenstart < actual._dataEnd; i++) {
2491 if (entries_[i].keytype == KeyInfo::isMain)
2492 entries_[i].disabled = true;
2495 if (actual.disabled) {
2496 interval_.addIntervall(actual._tokenstart-count, actual._dataEnd+1);
2499 interval_.addIntervall(actual._tokenstart-count, actual._tokenstart);
2501 if (interval_.par[actual._dataEnd+1] == '[') {
2502 int posdown = interval_.findclosing(actual._dataEnd+2, interval_.par.length(), '[', ']');
2503 if ((interval_.par[actual._dataEnd+2] == '{') &&
2504 (interval_.par[posdown-1] == '}')) {
2505 interval_.addIntervall(actual._dataEnd+1,actual._dataEnd+3);
2506 interval_.addIntervall(posdown-1, posdown+1);
2509 interval_.addIntervall(actual._dataEnd+1, actual._dataEnd+2);
2510 interval_.addIntervall(posdown, posdown+1);
2512 int blk = interval_.nextNotIgnored(actual._dataEnd+1);
2513 if (blk > posdown) {
2514 // Discard at most 1 space after empty item
2516 for (count = 0; count < 1; count++) {
2517 if (interval_.par[blk+count] != ' ')
2521 interval_.addIntervall(blk, blk+count);
2526 case KeyInfo::isSectioning: {
2527 // Discard spaces before _tokenstart
2529 int val = actual._tokenstart;
2530 for (count = 0; count < actual._tokenstart;) {
2531 val = interval_.previousNotIgnored(val-1);
2532 if (val < 0 || interval_.par[val] != ' ')
2535 count = actual._tokenstart - val;
2538 if (actual.disabled) {
2539 removeHead(actual, count);
2540 nextKeyIdx = getNextKey();
2542 interval_.addIntervall(actual._tokenstart-count, actual._tokenstart);
2543 nextKeyIdx = process(os, actual);
2547 case KeyInfo::isMath: {
2548 // Same as regex, use the content unchanged
2549 nextKeyIdx = getNextKey();
2552 case KeyInfo::isRegex: {
2553 // DO NOT SPLIT ON REGEX
2555 nextKeyIdx = getNextKey();
2558 case KeyInfo::isIgnored: {
2559 // Treat like a character for now
2560 nextKeyIdx = getNextKey();
2563 case KeyInfo::isMain: {
2564 if (interval_.par.substr(actual._dataStart, 2) == "% ")
2565 interval_.addIntervall(actual._dataStart, actual._dataStart+2);
2566 if (actual._tokenstart > 0) {
2567 int prev = interval_.previousNotIgnored(actual._tokenstart - 1);
2568 if ((prev >= 0) && interval_.par[prev] == '%')
2569 interval_.addIntervall(prev, prev+1);
2571 if (actual.disabled) {
2573 interval_.langcount++;
2574 if ((interval_.par.substr(actual._dataStart, 3) == " \\[") ||
2575 (interval_.par.substr(actual._dataStart, 8) == " \\begin{")) {
2576 // Discard also the space before math-equation
2577 interval_.addIntervall(actual._dataStart, actual._dataStart+1);
2579 nextKeyIdx = getNextKey();
2580 // interval.resetOpenedP(actual._dataStart-1);
2583 if (actual._tokenstart < 26) {
2584 // for the first (and maybe dummy) language
2585 interval_.setForDefaultLang(actual);
2587 interval_.resetOpenedP(actual._dataStart-1);
2591 case KeyInfo::invalid:
2592 case KeyInfo::headRemove:
2593 // These two cases cannot happen, already handled
2596 // LYXERR(Debug::INFO, "Unhandled keytype");
2597 nextKeyIdx = getNextKey();
2604 int LatexInfo::process(ostringstream & os, KeyInfo const & actual )
2606 int end = interval_.nextNotIgnored(actual._dataEnd);
2607 int oldStart = actual._dataStart;
2608 int nextKeyIdx = getNextKey();
2610 if ((nextKeyIdx < 0) ||
2611 (entries_[nextKeyIdx]._tokenstart >= actual._dataEnd) ||
2612 (entries_[nextKeyIdx].keytype == KeyInfo::invalid)) {
2613 if (oldStart <= end) {
2614 processRegion(oldStart, end);
2619 KeyInfo &nextKey = getKeyInfo(nextKeyIdx);
2621 if ((nextKey.keytype == KeyInfo::isMain) && !nextKey.disabled) {
2622 (void) dispatch(os, actual._dataStart, nextKey);
2623 end = nextKey._tokenstart;
2626 processRegion(oldStart, nextKey._tokenstart);
2627 nextKeyIdx = dispatch(os, actual._dataStart, nextKey);
2629 oldStart = nextKey._dataEnd+1;
2631 // now nextKey is either invalid or is outside of actual._dataEnd
2632 // output the remaining and discard myself
2633 if (oldStart <= end) {
2634 processRegion(oldStart, end);
2636 if (interval_.par.size() > (size_t) end && interval_.par[end] == '}') {
2638 // This is the normal case.
2639 // But if using the firstlanguage, the closing may be missing
2641 // get minimum of 'end' and 'actual._dataEnd' in case that the nextKey.keytype was 'KeyInfo::isMain'
2643 if (actual._dataEnd < end)
2644 output_end = interval_.nextNotIgnored(actual._dataEnd);
2646 output_end = interval_.nextNotIgnored(end);
2647 if ((actual.keytype == KeyInfo::isMain) && actual.disabled) {
2648 interval_.addIntervall(actual._tokenstart, actual._tokenstart+actual._tokensize);
2650 // Remove possible empty data
2651 int dstart = interval_.nextNotIgnored(actual._dataStart);
2652 while (interval_.isOpeningPar(dstart) == 1) {
2653 interval_.addIntervall(dstart, dstart+1);
2654 int dend = interval_.findclosing(dstart+1, output_end);
2655 interval_.addIntervall(dend, dend+1);
2656 dstart = interval_.nextNotIgnored(dstart+1);
2658 if (dstart < output_end)
2659 interval_.output(os, output_end);
2660 interval_.addIntervall(actual._tokenstart, end);
2664 string splitOnKnownMacros(string par, bool isPatternString)
2667 LatexInfo li(par, isPatternString);
2668 // LYXERR(Debug::INFO, "Berfore split: " << par);
2669 KeyInfo DummyKey = KeyInfo(KeyInfo::KeyType::isMain, 2, true);
2671 DummyKey._tokensize = 0;
2672 DummyKey._dataStart = 0;
2673 DummyKey._dataEnd = par.length();
2674 DummyKey.disabled = true;
2675 int firstkeyIdx = li.getFirstKey();
2677 if (firstkeyIdx >= 0) {
2678 KeyInfo firstKey = li.getKeyInfo(firstkeyIdx);
2679 DummyKey._tokenstart = firstKey._tokenstart;
2681 if ((firstKey.keytype != KeyInfo::isMain) || firstKey.disabled) {
2682 // Use dummy firstKey
2683 firstKey = DummyKey;
2684 (void) li.setNextKey(firstkeyIdx);
2687 if (par.substr(firstKey._dataStart, 2) == "% ")
2688 li.addIntervall(firstKey._dataStart, firstKey._dataStart+2);
2690 nextkeyIdx = li.process(os, firstKey);
2691 while (nextkeyIdx >= 0) {
2692 // Check for a possible gap between the last
2693 // entry and this one
2694 int datastart = li.nextNotIgnored(firstKey._dataStart);
2695 KeyInfo &nextKey = li.getKeyInfo(nextkeyIdx);
2696 if ((nextKey._tokenstart > datastart)) {
2698 firstKey._dataStart = datastart;
2699 firstKey._dataEnd = par.length();
2700 (void) li.setNextKey(nextkeyIdx);
2701 // Fake the last opened parenthesis
2702 li.setForDefaultLang(firstKey);
2703 nextkeyIdx = li.process(os, firstKey);
2706 if (nextKey.keytype != KeyInfo::isMain) {
2707 firstKey._dataStart = datastart;
2708 firstKey._dataEnd = nextKey._dataEnd+1;
2709 (void) li.setNextKey(nextkeyIdx);
2710 li.setForDefaultLang(firstKey);
2711 nextkeyIdx = li.process(os, firstKey);
2714 nextkeyIdx = li.process(os, nextKey);
2718 // Handle the remaining
2719 firstKey._dataStart = li.nextNotIgnored(firstKey._dataStart);
2720 firstKey._dataEnd = par.length();
2722 if ((firstKey._dataStart < firstKey._dataEnd) &&
2723 (par[firstKey._dataStart] != '}')) {
2724 li.setForDefaultLang(firstKey);
2725 (void) li.process(os, firstKey);
2729 // return string definitelly impossible to match
2730 s = "\\foreignlanguage{ignore}{ }";
2734 s = par; /* no known macros found */
2735 // LYXERR(Debug::INFO, "After split: " << s);
2740 * Try to unify the language specs in the latexified text.
2741 * Resulting modified string is set to "", if
2742 * the searched tex does not contain all the features in the search pattern
2744 static string correctlanguagesetting(string par, bool isPatternString, bool withformat)
2746 static Features regex_f;
2747 static int missed = 0;
2748 static bool regex_with_format = false;
2750 int parlen = par.length();
2752 while ((parlen > 0) && (par[parlen-1] == '\n')) {
2755 if (isPatternString && (parlen > 0) && (par[parlen-1] == '~')) {
2756 // Happens to be there in case of description or labeling environment
2761 // Split the latex input into pieces which
2762 // can be digested by our search engine
2763 LYXERR(Debug::FIND, "input: \"" << par << "\"");
2764 result = splitOnKnownMacros(par.substr(0,parlen), isPatternString);
2765 LYXERR(Debug::FIND, "After split: \"" << result << "\"");
2768 result = par.substr(0, parlen);
2769 if (isPatternString) {
2772 regex_f = identifyFeatures(result);
2773 string features = "";
2774 for (auto it = regex_f.cbegin(); it != regex_f.cend(); ++it) {
2775 string a = it->first;
2776 regex_with_format = true;
2777 features += " " + a;
2778 // LYXERR(Debug::INFO, "Identified regex format:" << a);
2780 LYXERR(Debug::FIND, "Identified Features" << features);
2783 } else if (regex_with_format) {
2784 Features info = identifyFeatures(result);
2785 for (auto it = regex_f.cbegin(); it != regex_f.cend(); ++it) {
2786 string a = it->first;
2787 bool b = it->second;
2788 if (b && ! info[a]) {
2790 LYXERR(Debug::FIND, "Missed(" << missed << " " << a <<", srclen = " << parlen );
2796 // LYXERR(Debug::INFO, "No regex formats");
2802 // Remove trailing closure of math, macros and environments, so to catch parts of them.
2803 static int identifyClosing(string & t)
2805 int open_braces = 0;
2807 LYXERR(Debug::FIND, "identifyClosing(): t now is '" << t << "'");
2808 if (regex_replace(t, t, "(.*[^\\\\])\\$$", "$1"))
2810 if (regex_replace(t, t, "(.*[^\\\\])\\\\\\]$", "$1"))
2812 if (regex_replace(t, t, "(.*[^\\\\])\\\\end\\{[a-zA-Z_]*\\*?\\}$", "$1"))
2814 if (regex_replace(t, t, "(.*[^\\\\])\\}$", "$1")) {
2823 static int num_replaced = 0;
2824 static bool previous_single_replace = true;
2826 MatchStringAdv::MatchStringAdv(lyx::Buffer & buf, FindAndReplaceOptions const & opt)
2827 : p_buf(&buf), p_first_buf(&buf), opt(opt)
2829 Buffer & find_buf = *theBufferList().getBuffer(FileName(to_utf8(opt.find_buf_name)), true);
2830 docstring const & ds = stringifySearchBuffer(find_buf, opt);
2831 use_regexp = lyx::to_utf8(ds).find("\\regexp{") != std::string::npos;
2832 if (opt.replace_all && previous_single_replace) {
2833 previous_single_replace = false;
2836 else if (!opt.replace_all) {
2837 num_replaced = 0; // count number of replaced strings
2838 previous_single_replace = true;
2840 // When using regexp, braces are hacked already by escape_for_regex()
2841 par_as_string = normalize(ds, !use_regexp);
2843 close_wildcards = 0;
2845 size_t lead_size = 0;
2846 // correct the language settings
2847 par_as_string = correctlanguagesetting(par_as_string, true, !opt.ignoreformat);
2848 if (opt.ignoreformat) {
2850 // if par_as_string_nolead were emty,
2851 // the following call to findAux will always *find* the string
2852 // in the checked data, and thus always using the slow
2853 // examining of the current text part.
2854 par_as_string_nolead = par_as_string;
2857 lead_size = identifyLeading(par_as_string);
2858 LYXERR(Debug::FIND, "Lead_size: " << lead_size);
2859 lead_as_string = par_as_string.substr(0, lead_size);
2860 par_as_string_nolead = par_as_string.substr(lead_size, par_as_string.size() - lead_size);
2864 open_braces = identifyClosing(par_as_string);
2865 identifyClosing(par_as_string_nolead);
2866 LYXERR(Debug::FIND, "Open braces: " << open_braces);
2867 LYXERR(Debug::FIND, "Built MatchStringAdv object: par_as_string = '" << par_as_string << "'");
2869 string lead_as_regexp;
2870 if (lead_size > 0) {
2871 // @todo No need to search for \regexp{} insets in leading material
2872 lead_as_regexp = escape_for_regex(par_as_string.substr(0, lead_size), !opt.ignoreformat);
2873 par_as_string = par_as_string_nolead;
2874 LYXERR(Debug::FIND, "lead_as_regexp is '" << lead_as_regexp << "'");
2875 LYXERR(Debug::FIND, "par_as_string now is '" << par_as_string << "'");
2877 LYXERR(Debug::FIND, "par_as_string before escape_for_regex() is '" << par_as_string << "'");
2878 par_as_string = escape_for_regex(par_as_string, !opt.ignoreformat);
2879 // Insert (.*?) before trailing closure of math, macros and environments, so to catch parts of them.
2880 LYXERR(Debug::FIND, "par_as_string now is '" << par_as_string << "'");
2882 // Insert .* before trailing '\$' ('$' has been escaped by escape_for_regex)
2883 regex_replace(par_as_string, par_as_string, "(.*[^\\\\])(\\\\\\$)\\'", "$1(.*?)$2")
2884 // Insert .* before trailing '\\\]' ('\]' has been escaped by escape_for_regex)
2885 || regex_replace(par_as_string, par_as_string, "(.*[^\\\\])( \\\\\\\\\\\\\\])\\'", "$1(.*?)$2")
2886 // Insert .* before trailing '\\end\{...}' ('\end{...}' has been escaped by escape_for_regex)
2887 || regex_replace(par_as_string, par_as_string,
2888 "(.*[^\\\\])( \\\\\\\\end\\\\\\{[a-zA-Z_]*)(\\\\\\*)?(\\\\\\})\\'", "$1(.*?)$2$3$4")
2889 // Insert .* before trailing '\}' ('}' has been escaped by escape_for_regex)
2890 || regex_replace(par_as_string, par_as_string, "(.*[^\\\\])(\\\\\\})\\'", "$1(.*?)$2")
2894 if (!opt.ignoreformat) {
2895 // Remove extra '\}' at end if not part of \{\.\}
2896 size_t lng = par_as_string.size();
2898 if (par_as_string.substr(lng-2, 2).compare("\\}") == 0) {
2900 if (par_as_string.substr(lng-6,3).compare("\\{\\") == 0)
2909 if (lng < par_as_string.size())
2910 par_as_string = par_as_string.substr(0,lng);
2913 regex_replace(par_as_string, par_as_string, "\\\\\\.", "_xxbdotxx_");
2914 // handle '.' -> '[^]', replace later as '[^\}\{\\]'
2915 regex_replace(par_as_string, par_as_string, "\\.", "[^]");
2916 // replace '[^...]' with '[^...\}\{\\]'
2917 regex_replace(par_as_string, par_as_string, "\\[\\^([^\\\\\\]]*)\\]", "_xxbrlxx_$1\\}\\{\\\\_xxbrrxx_");
2918 regex_replace(par_as_string, par_as_string, "_xxbrlxx_", "[^");
2919 regex_replace(par_as_string, par_as_string, "_xxbrrxx_", "]");
2921 regex_replace(par_as_string, par_as_string, "_xxbdotxx_", "\\.");
2924 LYXERR(Debug::FIND, "par_as_string now is '" << par_as_string << "'");
2925 LYXERR(Debug::FIND, "Open braces: " << open_braces);
2926 LYXERR(Debug::FIND, "Close .*? : " << close_wildcards);
2927 LYXERR(Debug::FIND, "Replaced text (to be used as regex): " << par_as_string);
2929 // If entered regexp must match at begin of searched string buffer
2930 // Kornel: Added parentheses to use $1 for size of the leading string
2934 // TODO: Adapt '\[12345678]' in par_as_string to acount for the first '()
2935 // Unfortunately is '\1', '\2', etc not working for strings with extra format
2936 // so the convert has no effect in that case
2937 for (int i = 8; i > 0; --i) {
2938 string orig = "\\\\" + std::to_string(i);
2939 string dest = "\\" + std::to_string(i+1);
2940 while (regex_replace(par_as_string, par_as_string, orig, dest));
2942 regexp_str = "(" + lead_as_regexp + ")" + par_as_string;
2943 regexp2_str = "(" + lead_as_regexp + ").*?" + par_as_string;
2945 LYXERR(Debug::FIND, "Setting regexp to : '" << regexp_str << "'");
2946 LYXERR(Debug::FIND, "Setting regexp2 to: '" << regexp2_str << "'");
2947 #if (QT_VERSION >= 0x050000)
2948 QRegularExpression::PatternOptions popts;
2949 if (! opt.casesensitive) {
2950 popts = QRegularExpression::CaseInsensitiveOption;
2953 popts = QRegularExpression::NoPatternOption;
2955 regexp = QRegularExpression(QString::fromStdString(regexp_str), popts);
2956 regexp2 = QRegularExpression(QString::fromStdString(regexp2_str), popts);
2958 if (regexp.isValid() && regexp2.isValid()) {
2959 regexIsValid = true;
2960 // Check '{', '}' pairs inside the regex
2963 for (unsigned i = 0; i < par_as_string.size(); i+= skip) {
2964 char c = par_as_string[i];
2971 else if (c == '}') {
2978 if (balanced != 0) {
2979 regexIsValid = false;
2980 regexError = "Unbalanced curly brackets in regexp \"" + regexp_str + "\"";
2984 regexIsValid = false;
2985 if (!regexp.isValid())
2986 regexError += "Invalid regexp \"" + regexp_str + "\", error = " + regexp.errorString().toStdString();
2987 if (!regexp2.isValid())
2988 regexError += "Invalid regexp2 \"" + regexp2_str + "\", error = " + regexp2.errorString().toStdString();
2991 if (opt.casesensitive) {
2992 regexp = regex(regexp_str);
2993 regexp2 = regex(regexp2_str);
2996 regexp = regex(regexp_str, std::regex_constants::icase);
2997 regexp2 = regex(regexp2_str, std::regex_constants::icase);
3004 // Count number of characters in string
3008 // \\[a-zA-Z]+ ==> 1
3009 #if (QT_VERSION >= 0x050000)
3010 static int computeSize(QStringRef s, int len)
3011 #define isLyxAlpha(arg) arg.isLetter()
3013 static int computeSize(string s, int len)
3014 #define isLyxAlpha(arg) isalpha(arg)
3021 for (int i = 0; i < len; i += skip, count++) {
3022 if (s.at(i) == '\\') {
3024 if (isLyxAlpha(s.at(i+1))) {
3025 for (int j = 2; i+j < len; j++) {
3026 if (isLyxAlpha(s.at(i+j))) {
3027 if (s.at(i+j) == ' ')
3029 else if ((s.at(i+j) == '{') && s.at(i+j+1) == '}')
3031 else if ((s.at(i+j) == '{') && (i + j + 1 >= len))
3039 else if (s.at(i) == '{') {
3040 if (s.at(i+1) == '}')
3045 else if (s.at(i) == '-') {
3046 if (s.at(i+1) == '-') {
3047 if (s.at(i+2) == '-')
3062 MatchResult MatchStringAdv::findAux(DocIterator const & cur, int len, bool at_begin) const
3067 (opt.restr == FindAndReplaceOptions::R_ONLY_MATHS && !cur.inMathed()) )
3070 docstring docstr = stringifyFromForSearch(opt, cur, len);
3072 if (use_regexp || opt.casesensitive)
3073 str = normalize(docstr, true);
3075 str = normalize(lowercase(docstr), true);
3076 if (!opt.ignoreformat) {
3077 str = correctlanguagesetting(str, false, !opt.ignoreformat);
3080 mres.match_len = -1;
3083 LYXERR(Debug::FIND, "Matching against '" << lyx::to_utf8(docstr) << "'");
3084 LYXERR(Debug::FIND, "After normalization: '" << str << "'");
3087 LYXERR(Debug::FIND, "Searching in regexp mode: at_begin=" << at_begin);
3088 #if (QT_VERSION >= 0x050000)
3089 QString qstr = QString::fromStdString(str);
3090 QRegularExpression const *p_regexp;
3091 QRegularExpression::MatchType flags = QRegularExpression::NormalMatch;
3095 p_regexp = ®exp2;
3097 QRegularExpressionMatch match = p_regexp->match(qstr, 0, flags);
3098 if (!match.hasMatch())
3100 // Check braces on segments that matched all (.*?) subexpressions,
3101 // except the last "padding" one inserted by lyx.
3102 for (int i = 1; i < match.lastCapturedIndex(); ++i)
3103 if (!braces_match(match.captured(i), open_braces))
3106 regex const *p_regexp;
3107 regex_constants::match_flag_type flags;
3109 flags = regex_constants::match_continuous;
3112 flags = regex_constants::match_default;
3113 p_regexp = ®exp2;
3115 sregex_iterator re_it(str.begin(), str.end(), *p_regexp, flags);
3116 if (re_it == sregex_iterator())
3118 match_results<string::const_iterator> const & m = *re_it;
3119 // Check braces on segments that matched all (.*?) subexpressions,
3120 // except the last "padding" one inserted by lyx.
3121 for (size_t i = 1; i < m.size() - 1; ++i)
3122 if (!braces_match(m[i], open_braces))
3125 // Exclude from the returned match length any length
3126 // due to close wildcards added at end of regexp
3127 // and also the length of the leading (e.g. '\emph{}')
3129 // Whole found string, including the leading: m[0].second - m[0].first
3130 // Size of the leading string: m[1].second - m[1].first
3131 int leadingsize = 0;
3134 #if (QT_VERSION >= 0x050000)
3135 if (match.lastCapturedIndex() > 0)
3136 leadingsize = match.capturedEnd(1) - match.capturedStart(1);
3138 int lastidx = match.lastCapturedIndex();
3139 for (int i = 0; i <= lastidx; i++) {
3140 LYXERR(Debug::FIND, "Match " << i << " is " << match.capturedEnd(i) - match.capturedStart(i) << " long");
3142 if (close_wildcards == 0)
3143 result = match.capturedEnd(0) - match.capturedStart(0);
3145 result = match.capturedStart(lastidx + 1 - close_wildcards) - match.capturedStart(0);
3147 pos = match.capturedStart(0);
3148 // Ignore last closing characters
3149 while (result > 0) {
3150 if (qstr.at(pos+result-1) == '}')
3157 leadingsize = m[1].second - m[1].first;
3158 for (size_t i = 0; i < m.size(); i++) {
3159 LYXERR(Debug::FIND, "Match " << i << " is " << m[i].second - m[i].first << " long");
3161 if (close_wildcards == 0)
3162 result = m[0].second - m[0].first;
3164 result = m[m.size() - close_wildcards].first - m[0].first;
3165 pos = m.position(size_t(0));
3166 // Ignore last closing characters
3167 while (result > 0) {
3168 if (str[pos+result-1] == '}')
3174 if (result > leadingsize)
3175 result -= leadingsize;
3178 #if (QT_VERSION >= 0x050000)
3179 mres.match_len = computeSize(QStringRef(&qstr, pos+leadingsize,result), result);
3180 mres.match2end = qstr.size() - pos - leadingsize;
3182 mres.match_len = computeSize(str.substr(pos+leadingsize,result), result);
3183 mres.match2end = str.size() - pos - leadingsize;
3185 mres.pos = pos+leadingsize;
3189 // else !use_regexp: but all code paths above return
3190 LYXERR(Debug::FIND, "Searching in normal mode: par_as_string='"
3191 << par_as_string << "', str='" << str << "'");
3192 LYXERR(Debug::FIND, "Searching in normal mode: lead_as_string='"
3193 << lead_as_string << "', par_as_string_nolead='"
3194 << par_as_string_nolead << "'");
3197 LYXERR(Debug::FIND, "size=" << par_as_string.size()
3198 << ", substr='" << str.substr(0, par_as_string.size()) << "'");
3199 if (str.substr(0, par_as_string.size()) == par_as_string) {
3200 mres.match_len = par_as_string.size();
3201 mres.match2end = str.size();
3206 // Start the search _after_ the leading part
3207 size_t pos = str.find(par_as_string_nolead, lead_as_string.size());
3208 if (pos != string::npos) {
3209 mres.match_len = par_as_string.size();
3210 mres.match2end = str.size() - pos;
3219 MatchResult MatchStringAdv::operator()(DocIterator const & cur, int len, bool at_begin) const
3221 MatchResult mres = findAux(cur, len, at_begin);
3222 int res = mres.match_len;
3224 "res=" << res << ", at_begin=" << at_begin
3225 << ", matchword=" << opt.matchword
3226 << ", inTexted=" << cur.inTexted());
3227 if (res == 0 || !at_begin || !opt.matchword || !cur.inTexted())
3229 if ((len > 0) && (res < len)) {
3233 Paragraph const & par = cur.paragraph();
3234 bool ws_left = (cur.pos() > 0)
3235 ? par.isWordSeparator(cur.pos() - 1)
3241 ws_right = (cur.pos() + len < par.size())
3242 ? par.isWordSeparator(cur.pos() + len)
3246 "cur.pos()=" << cur.pos() << ", res=" << res
3247 << ", separ: " << ws_left << ", " << ws_right
3250 if (ws_left && ws_right) {
3251 // Check for word separators inside the found 'word'
3252 for (int i = 0; i < len; i++) {
3253 if (par.isWordSeparator(cur.pos() + i)) {
3265 string MatchStringAdv::normalize(docstring const & s, bool hack_braces) const
3268 t = lyx::to_utf8(s);
3269 // Remove \n at begin
3270 while (!t.empty() && t[0] == '\n')
3273 while (!t.empty() && t[t.size() - 1] == '\n')
3274 t = t.substr(0, t.size() - 1);
3276 // Handle all other '\n'
3277 while ((pos = t.find("\n")) != string::npos) {
3278 if (pos > 1 && t[pos-1] == '\\' && t[pos-2] == '\\' ) {
3280 if (isAlnumASCII(t[pos+1])) {
3281 t.replace(pos-2, 3, " ");
3284 t.replace(pos-2, 3, "");
3287 else if (!isAlnumASCII(t[pos+1]) || !isAlnumASCII(t[pos-1])) {
3288 // '\n' adjacent to non-alpha-numerics, discard
3289 t.replace(pos, 1, "");
3292 // Replace all other \n with spaces
3293 t.replace(pos, 1, " ");
3296 // Remove stale empty \emph{}, \textbf{} and similar blocks from latexify
3297 // Kornel: Added textsl, textsf, textit, texttt and noun
3298 // + allow to seach for colored text too
3299 LYXERR(Debug::FIND, "Removing stale empty \\emph{}, \\textbf{}, \\*section{} macros from: " << t);
3300 while (regex_replace(t, t, "\\\\(emph|noun|text(bf|sl|sf|it|tt)|(u|uu)line|(s|x)out|uwave)(\\{(\\{\\})?\\})+", ""))
3301 LYXERR(Debug::FIND, " further removing stale empty \\emph{}, \\textbf{} macros from: " << t);
3302 while (regex_replace(t, t, "\\\\((sub)?(((sub)?section)|paragraph)|part)\\*?(\\{(\\{\\})?\\})+", ""))
3303 LYXERR(Debug::FIND, " further removing stale empty \\emph{}, \\textbf{} macros from: " << t);
3305 while (regex_replace(t, t, "\\\\(foreignlanguage|textcolor|item)\\{[a-z]+\\}(\\{(\\{\\})?\\})+", ""));
3306 // FIXME - check what preceeds the brace
3308 if (opt.ignoreformat)
3309 while (regex_replace(t, t, "\\{", "_x_<")
3310 || regex_replace(t, t, "\\}", "_x_>"))
3311 LYXERR(Debug::FIND, "After {} replacement: '" << t << "'");
3313 while (regex_replace(t, t, "\\\\\\{", "_x_<")
3314 || regex_replace(t, t, "\\\\\\}", "_x_>"))
3315 LYXERR(Debug::FIND, "After {} replacement: '" << t << "'");
3322 docstring stringifyFromCursor(DocIterator const & cur, int len)
3324 LYXERR(Debug::FIND, "Stringifying with len=" << len << " from cursor at pos: " << cur);
3325 if (cur.inTexted()) {
3326 Paragraph const & par = cur.paragraph();
3327 // TODO what about searching beyond/across paragraph breaks ?
3328 // TODO Try adding a AS_STR_INSERTS as last arg
3329 pos_type end = ( len == -1 || cur.pos() + len > int(par.size()) ) ?
3330 int(par.size()) : cur.pos() + len;
3331 // OutputParams runparams(&cur.buffer()->params().encoding());
3332 OutputParams runparams(encodings.fromLyXName("utf8"));
3333 runparams.nice = true;
3334 runparams.flavor = Flavor::XeTeX;
3335 runparams.linelen = 10000; //lyxrc.plaintext_linelen;
3336 // No side effect of file copying and image conversion
3337 runparams.dryrun = true;
3338 runparams.for_search = true;
3339 LYXERR(Debug::FIND, "Stringifying with cur: "
3340 << cur << ", from pos: " << cur.pos() << ", end: " << end);
3341 return par.asString(cur.pos(), end,
3342 AS_STR_INSETS | AS_STR_SKIPDELETE | AS_STR_PLAINTEXT,
3344 } else if (cur.inMathed()) {
3345 CursorSlice cs = cur.top();
3346 MathData md = cs.cell();
3347 MathData::const_iterator it_end =
3348 (( len == -1 || cs.pos() + len > int(md.size()))
3350 : md.begin() + cs.pos() + len );
3352 for (MathData::const_iterator it = md.begin() + cs.pos();
3355 docstring s = asString(md2);
3356 LYXERR(Debug::FIND, "Stringified math: '" << s << "'");
3359 LYXERR(Debug::FIND, "Don't know how to stringify from here: " << cur);
3364 /** Computes the LaTeX export of buf starting from cur and ending len positions
3365 * after cur, if len is positive, or at the paragraph or innermost inset end
3368 docstring latexifyFromCursor(DocIterator const & cur, int len)
3370 LYXERR(Debug::FIND, "Latexifying with len=" << len << " from cursor at pos: " << cur);
3371 LYXERR(Debug::FIND, " with cur.lastpost=" << cur.lastpos() << ", cur.lastrow="
3372 << cur.lastrow() << ", cur.lastcol=" << cur.lastcol());
3373 Buffer const & buf = *cur.buffer();
3375 odocstringstream ods;
3377 //OutputParams runparams(&buf.params().encoding());
3378 OutputParams runparams(encodings.fromLyXName("utf8"));
3379 runparams.nice = false;
3380 runparams.flavor = Flavor::XeTeX;
3381 runparams.linelen = 8000; //lyxrc.plaintext_linelen;
3382 // No side effect of file copying and image conversion
3383 runparams.dryrun = true;
3384 runparams.for_search = true;
3386 if (cur.inTexted()) {
3387 // @TODO what about searching beyond/across paragraph breaks ?
3388 pos_type endpos = cur.paragraph().size();
3389 if (len != -1 && endpos > cur.pos() + len)
3390 endpos = cur.pos() + len;
3391 TeXOnePar(buf, *cur.innerText(), cur.pit(), os, runparams,
3392 string(), cur.pos(), endpos);
3393 string s = lyx::to_utf8(ods.str());
3394 LYXERR(Debug::FIND, "Latexified +modified text: '" << s << "'");
3395 return(lyx::from_utf8(s));
3396 } else if (cur.inMathed()) {
3397 // Retrieve the math environment type, and add '$' or '$[' or others (\begin{equation}) accordingly
3398 for (int s = cur.depth() - 1; s >= 0; --s) {
3399 CursorSlice const & cs = cur[s];
3400 if (cs.asInsetMath() && cs.asInsetMath()->asHullInset()) {
3402 cs.asInsetMath()->asHullInset()->header_write(ws);
3407 CursorSlice const & cs = cur.top();
3408 MathData md = cs.cell();
3409 MathData::const_iterator it_end =
3410 ((len == -1 || cs.pos() + len > int(md.size()))
3412 : md.begin() + cs.pos() + len);
3414 for (MathData::const_iterator it = md.begin() + cs.pos();
3418 ods << asString(md2);
3419 // Retrieve the math environment type, and add '$' or '$]'
3420 // or others (\end{equation}) accordingly
3421 for (int s = cur.depth() - 1; s >= 0; --s) {
3422 CursorSlice const & cs2 = cur[s];
3423 InsetMath * inset = cs2.asInsetMath();
3424 if (inset && inset->asHullInset()) {
3426 inset->asHullInset()->footer_write(ws);
3430 LYXERR(Debug::FIND, "Latexified math: '" << lyx::to_utf8(ods.str()) << "'");
3432 LYXERR(Debug::FIND, "Don't know how to stringify from here: " << cur);
3438 /** Finalize an advanced find operation, advancing the cursor to the innermost
3439 ** position that matches, plus computing the length of the matching text to
3442 int findAdvFinalize(DocIterator & cur, MatchStringAdv const & match)
3444 // Search the foremost position that matches (avoids find of entire math
3445 // inset when match at start of it)
3447 DocIterator old_cur(cur.buffer());
3449 LYXERR(Debug::FIND, "Forwarding one step (searching for innermost match)");
3453 } while (cur && cur.depth() > d && match(cur).match_len > 0);
3455 int max_match = match(cur).match_len; /* match valid only if not searching whole words */
3456 if (max_match <= 0) return 0;
3457 LYXERR(Debug::FIND, "Ok");
3459 // Compute the match length
3461 if (cur.pos() + len > cur.lastpos())
3463 if (match.opt.matchword) {
3464 LYXERR(Debug::FIND, "verifying unmatch with len = " << len);
3465 while (cur.pos() + len <= cur.lastpos() && match(cur, len).match_len <= 0) {
3467 LYXERR(Debug::FIND, "verifying unmatch with len = " << len);
3469 // Length of matched text (different from len param)
3470 int old_match = match(cur, len).match_len;
3474 // Greedy behaviour while matching regexps
3475 while ((new_match = match(cur, len + 1).match_len) > old_match) {
3477 old_match = new_match;
3478 LYXERR(Debug::FIND, "verifying match with len = " << len);
3485 int maxl = cur.lastpos() - cur.pos();
3486 // Greedy behaviour while matching regexps
3487 while (maxl > minl) {
3488 int actual_match = match(cur, len).match_len;
3489 if (actual_match >= max_match) {
3490 // actual_match > max_match _can_ happen,
3491 // if the search area splits
3492 // some following word so that the regex
3493 // (e.g. 'r.*r\b' matches 'r' from the middle of the
3495 // This means, the len value is too big
3497 len = (int)((maxl + minl)/2);
3500 // (actual_match < max_match)
3502 len = (int)((maxl + minl)/2);
3506 // Search for real start of matched characters
3511 } while (cur.depth() > old_cur.depth()); /* Skip inner insets */
3512 if (cur.depth() < old_cur.depth()) {
3514 LYXERR(Debug::INFO, "cur.depth() < old_cur.depth(), this should never happen");
3517 if (cur.pos() != old_cur.pos()) {
3518 // OK, forwarded 1 pos in actual inset
3519 actual_match = match(cur, len-1).match_len;
3520 if (actual_match == max_match) {
3521 // Ha, got it! The shorter selection has the same match length
3526 // OK, the shorter selection matches less chars, revert to previous value
3532 LYXERR(Debug::INFO, "cur.pos() == old_cur.pos(), this should never happen");
3533 actual_match = match(cur, len).match_len;
3534 if (actual_match == max_match)
3544 int findForwardAdv(DocIterator & cur, MatchStringAdv const & match)
3548 while (!theApp()->longOperationCancelled() && cur) {
3549 LYXERR(Debug::FIND, "findForwardAdv() cur: " << cur);
3550 MatchResult mres = match(cur, -1, false);
3551 int match_len = mres.match_len;
3552 LYXERR(Debug::FIND, "match_len: " << match_len);
3553 if ((mres.pos > 100000) || (mres.match2end > 100000) || (match_len > 100000)) {
3554 LYXERR(Debug::INFO, "BIG LENGTHS: " << mres.pos << ", " << match_len << ", " << mres.match2end);
3557 if (match_len > 0) {
3558 // Try to find the begin of searched string
3559 int increment = mres.pos/2;
3560 while (mres.pos > 5 && (increment > 5)) {
3561 DocIterator old_cur = cur;
3562 for (int i = 0; i < increment && cur; cur.forwardPos(), i++) {
3564 if (! cur || (cur.pit() > old_cur.pit())) {
3565 // Are we outside of the paragraph?
3566 // This can happen if moving past some UTF8-encoded chars
3571 MatchResult mres2 = match(cur, -1, false);
3572 if ((mres2.match2end < mres.match2end) ||
3573 (mres2.match_len < mres.match_len)) {
3580 if (increment > mres.pos/2)
3581 increment = mres.pos/2;
3585 int match_len_zero_count = 0;
3586 for (int i = 0; !theApp()->longOperationCancelled() && cur; cur.forwardPos()) {
3588 int remaining_len = match(cur, -1, false).match_len;
3589 if (remaining_len <= 0) {
3590 // Apparently the searched string is not in the remaining part
3597 LYXERR(Debug::FIND, "Advancing cur: " << cur);
3598 int match_len3 = match(cur, 1).match_len;
3601 int match_len2 = match(cur).match_len;
3602 LYXERR(Debug::FIND, "match_len2: " << match_len2);
3603 if (match_len2 > 0) {
3604 // Sometimes in finalize we understand it wasn't a match
3605 // and we need to continue the outest loop
3606 int len = findAdvFinalize(cur, match);
3611 if (match_len2 >= 0) {
3612 if (match_len2 == 0)
3613 match_len_zero_count++;
3615 match_len_zero_count = 0;
3618 if (++match_len_zero_count > 3) {
3619 LYXERR(Debug::FIND, "match_len2_zero_count: " << match_len_zero_count << ", match_len was " << match_len);
3627 if (match_len >= 0 && cur.pit() < cur.lastpit()) {
3628 LYXERR(Debug::FIND, "Advancing par: cur=" << cur);
3631 // This should exit nested insets, if any, or otherwise undefine the currsor.
3632 cur.pos() = cur.lastpos();
3633 LYXERR(Debug::FIND, "Advancing pos: cur=" << cur);
3641 /// Find the most backward consecutive match within same paragraph while searching backwards.
3642 int findMostBackwards(DocIterator & cur, MatchStringAdv const & match)
3644 DocIterator cur_begin = doc_iterator_begin(cur.buffer());
3645 DocIterator tmp_cur = cur;
3646 int len = findAdvFinalize(tmp_cur, match);
3647 Inset & inset = cur.inset();
3648 for (; cur != cur_begin; cur.backwardPos()) {
3649 LYXERR(Debug::FIND, "findMostBackwards(): cur=" << cur);
3650 DocIterator new_cur = cur;
3651 new_cur.backwardPos();
3652 if (new_cur == cur || &new_cur.inset() != &inset || !match(new_cur).match_len)
3654 int new_len = findAdvFinalize(new_cur, match);
3659 LYXERR(Debug::FIND, "findMostBackwards(): exiting with cur=" << cur);
3665 int findBackwardsAdv(DocIterator & cur, MatchStringAdv & match)
3669 // Backup of original position
3670 DocIterator cur_begin = doc_iterator_begin(cur.buffer());
3671 if (cur == cur_begin)
3674 DocIterator cur_orig(cur);
3675 bool pit_changed = false;
3678 bool found_match = (match(cur, -1, false).match_len > 0);
3682 cur.pos() = cur.lastpos();
3684 cur.pos() = cur_orig.pos();
3685 LYXERR(Debug::FIND, "findBackAdv2: cur: " << cur);
3686 DocIterator cur_prev_iter;
3688 found_match = (match(cur).match_len > 0);
3689 LYXERR(Debug::FIND, "findBackAdv3: found_match="
3690 << found_match << ", cur: " << cur);
3692 return findMostBackwards(cur, match);
3694 // Stop if begin of document reached
3695 if (cur == cur_begin)
3697 cur_prev_iter = cur;
3701 if (cur == cur_begin)
3708 } while (!theApp()->longOperationCancelled());
3716 docstring stringifyFromForSearch(FindAndReplaceOptions const & opt,
3717 DocIterator const & cur, int len)
3719 if (cur.pos() < 0 || cur.pos() > cur.lastpos())
3721 if (!opt.ignoreformat)
3722 return latexifyFromCursor(cur, len);
3724 return stringifyFromCursor(cur, len);
3728 FindAndReplaceOptions::FindAndReplaceOptions(
3729 docstring const & _find_buf_name, bool _casesensitive,
3730 bool _matchword, bool _forward, bool _expandmacros, bool _ignoreformat,
3731 docstring const & _repl_buf_name, bool _keep_case,
3732 SearchScope _scope, SearchRestriction _restr, bool _replace_all)
3733 : find_buf_name(_find_buf_name), casesensitive(_casesensitive), matchword(_matchword),
3734 forward(_forward), expandmacros(_expandmacros), ignoreformat(_ignoreformat),
3735 repl_buf_name(_repl_buf_name), keep_case(_keep_case), scope(_scope), restr(_restr), replace_all(_replace_all)
3743 /** Check if 'len' letters following cursor are all non-lowercase */
3744 static bool allNonLowercase(Cursor const & cur, int len)
3746 pos_type beg_pos = cur.selectionBegin().pos();
3747 pos_type end_pos = cur.selectionBegin().pos() + len;
3748 if (len > cur.lastpos() + 1 - beg_pos) {
3749 LYXERR(Debug::FIND, "This should not happen, more debug needed");
3750 len = cur.lastpos() + 1 - beg_pos;
3751 end_pos = beg_pos + len;
3753 for (pos_type pos = beg_pos; pos != end_pos; ++pos)
3754 if (isLowerCase(cur.paragraph().getChar(pos)))
3760 /** Check if first letter is upper case and second one is lower case */
3761 static bool firstUppercase(Cursor const & cur)
3764 pos_type pos = cur.selectionBegin().pos();
3765 if (pos >= cur.lastpos() - 1) {
3766 LYXERR(Debug::FIND, "No upper-case at cur: " << cur);
3769 ch1 = cur.paragraph().getChar(pos);
3770 ch2 = cur.paragraph().getChar(pos + 1);
3771 bool result = isUpperCase(ch1) && isLowerCase(ch2);
3772 LYXERR(Debug::FIND, "firstUppercase(): "
3773 << "ch1=" << ch1 << "(" << char(ch1) << "), ch2="
3774 << ch2 << "(" << char(ch2) << ")"
3775 << ", result=" << result << ", cur=" << cur);
3780 /** Make first letter of supplied buffer upper-case, and the rest lower-case.
3782 ** \fixme What to do with possible further paragraphs in replace buffer ?
3784 static void changeFirstCase(Buffer & buffer, TextCase first_case, TextCase others_case)
3786 ParagraphList::iterator pit = buffer.paragraphs().begin();
3787 LASSERT(!pit->empty(), /**/);
3788 pos_type right = pos_type(1);
3789 pit->changeCase(buffer.params(), pos_type(0), right, first_case);
3790 right = pit->size();
3791 pit->changeCase(buffer.params(), pos_type(1), right, others_case);
3797 static int findAdvReplace(BufferView * bv, FindAndReplaceOptions const & opt, MatchStringAdv & matchAdv)
3799 Cursor & cur = bv->cursor();
3800 if (opt.repl_buf_name.empty()
3801 || theBufferList().getBuffer(FileName(to_utf8(opt.repl_buf_name)), true) == 0
3802 || theBufferList().getBuffer(FileName(to_utf8(opt.find_buf_name)), true) == 0)
3805 DocIterator sel_beg = cur.selectionBegin();
3806 DocIterator sel_end = cur.selectionEnd();
3807 if (&sel_beg.inset() != &sel_end.inset()
3808 || sel_beg.pit() != sel_end.pit()
3809 || sel_beg.idx() != sel_end.idx())
3811 int sel_len = sel_end.pos() - sel_beg.pos();
3812 LYXERR(Debug::FIND, "sel_beg: " << sel_beg << ", sel_end: " << sel_end
3813 << ", sel_len: " << sel_len << endl);
3816 LASSERT(sel_len > 0, return 0);
3818 if (!matchAdv(sel_beg, sel_len).match_len)
3821 // Build a copy of the replace buffer, adapted to the KeepCase option
3822 Buffer const & repl_buffer_orig = *theBufferList().getBuffer(FileName(to_utf8(opt.repl_buf_name)), true);
3824 repl_buffer_orig.write(oss);
3825 string lyx = oss.str();
3826 Buffer repl_buffer("", false);
3827 repl_buffer.setUnnamed(true);
3828 LASSERT(repl_buffer.readString(lyx), return 0);
3829 if (opt.keep_case && sel_len >= 2) {
3830 LYXERR(Debug::FIND, "keep_case true: cur.pos()=" << cur.pos() << ", sel_len=" << sel_len);
3831 if (cur.inTexted()) {
3832 if (firstUppercase(cur))
3833 changeFirstCase(repl_buffer, text_uppercase, text_lowercase);
3834 else if (allNonLowercase(cur, sel_len))
3835 changeFirstCase(repl_buffer, text_uppercase, text_uppercase);
3838 cap::cutSelection(cur, false);
3839 if (cur.inTexted()) {
3840 repl_buffer.changeLanguage(
3841 repl_buffer.language(),
3842 cur.getFont().language());
3843 LYXERR(Debug::FIND, "Replacing by pasteParagraphList()ing repl_buffer");
3844 LYXERR(Debug::FIND, "Before pasteParagraphList() cur=" << cur << endl);
3845 cap::pasteParagraphList(cur, repl_buffer.paragraphs(),
3846 repl_buffer.params().documentClassPtr(),
3847 bv->buffer().errorList("Paste"));
3848 LYXERR(Debug::FIND, "After pasteParagraphList() cur=" << cur << endl);
3849 sel_len = repl_buffer.paragraphs().begin()->size();
3850 } else if (cur.inMathed()) {
3851 odocstringstream ods;
3853 // OutputParams runparams(&repl_buffer.params().encoding());
3854 OutputParams runparams(encodings.fromLyXName("utf8"));
3855 runparams.nice = false;
3856 runparams.flavor = Flavor::XeTeX;
3857 runparams.linelen = 8000; //lyxrc.plaintext_linelen;
3858 runparams.dryrun = true;
3859 TeXOnePar(repl_buffer, repl_buffer.text(), 0, os, runparams);
3860 //repl_buffer.getSourceCode(ods, 0, repl_buffer.paragraphs().size(), false);
3861 docstring repl_latex = ods.str();
3862 LYXERR(Debug::FIND, "Latexified replace_buffer: '" << repl_latex << "'");
3864 (void)regex_replace(to_utf8(repl_latex), s, "\\$(.*)\\$", "$1");
3865 (void)regex_replace(s, s, "\\\\\\[(.*)\\\\\\]", "$1");
3866 repl_latex = from_utf8(s);
3867 LYXERR(Debug::FIND, "Replacing by insert()ing latex: '" << repl_latex << "' cur=" << cur << " with depth=" << cur.depth());
3868 MathData ar(cur.buffer());
3869 asArray(repl_latex, ar, Parse::NORMAL);
3871 sel_len = ar.size();
3872 LYXERR(Debug::FIND, "After insert() cur=" << cur << " with depth: " << cur.depth() << " and len: " << sel_len);
3874 if (cur.pos() >= sel_len)
3875 cur.pos() -= sel_len;
3878 LYXERR(Debug::FIND, "After pos adj cur=" << cur << " with depth: " << cur.depth() << " and len: " << sel_len);
3879 bv->putSelectionAt(DocIterator(cur), sel_len, !opt.forward);
3880 bv->processUpdateFlags(Update::Force);
3885 /// Perform a FindAdv operation.
3886 bool findAdv(BufferView * bv, FindAndReplaceOptions const & opt)
3891 // e.g., when invoking word-findadv from mini-buffer wither with
3892 // wrong options syntax or before ever opening advanced F&R pane
3893 if (theBufferList().getBuffer(FileName(to_utf8(opt.find_buf_name)), true) == 0)
3897 MatchStringAdv matchAdv(bv->buffer(), opt);
3898 #if (QT_VERSION >= 0x050000)
3899 if (!matchAdv.regexIsValid) {
3900 bv->message(lyx::from_utf8(matchAdv.regexError));
3904 int length = bv->cursor().selectionEnd().pos() - bv->cursor().selectionBegin().pos();
3906 bv->putSelectionAt(bv->cursor().selectionBegin(), length, !opt.forward);
3907 num_replaced += findAdvReplace(bv, opt, matchAdv);
3910 match_len = findForwardAdv(cur, matchAdv);
3912 match_len = findBackwardsAdv(cur, matchAdv);
3914 // This may only be raised by lyx::regex()
3915 bv->message(_("Invalid regular expression!"));
3919 if (match_len == 0) {
3920 if (num_replaced > 0) {
3921 switch (num_replaced)
3924 bv->message(_("One match has been replaced."));
3927 bv->message(_("Two matches have been replaced."));
3930 bv->message(bformat(_("%1$d matches have been replaced."), num_replaced));
3936 bv->message(_("Match not found."));
3941 if (num_replaced > 0)
3942 bv->message(_("Match has been replaced."));
3944 bv->message(_("Match found."));
3946 LYXERR(Debug::FIND, "Putting selection at cur=" << cur << " with len: " << match_len);
3947 bv->putSelectionAt(cur, match_len, !opt.forward);
3953 ostringstream & operator<<(ostringstream & os, FindAndReplaceOptions const & opt)
3955 os << to_utf8(opt.find_buf_name) << "\nEOSS\n"
3956 << opt.casesensitive << ' '
3957 << opt.matchword << ' '
3958 << opt.forward << ' '
3959 << opt.expandmacros << ' '
3960 << opt.ignoreformat << ' '
3961 << opt.replace_all << ' '
3962 << to_utf8(opt.repl_buf_name) << "\nEOSS\n"
3963 << opt.keep_case << ' '
3964 << int(opt.scope) << ' '
3967 LYXERR(Debug::FIND, "built: " << os.str());
3973 istringstream & operator>>(istringstream & is, FindAndReplaceOptions & opt)
3975 LYXERR(Debug::FIND, "parsing");
3979 while (line != "EOSS") {
3983 if (is.eof()) // Tolerate malformed request
3987 LYXERR(Debug::FIND, "file_buf_name: '" << s << "'");
3988 opt.find_buf_name = from_utf8(s);
3989 is >> opt.casesensitive >> opt.matchword >> opt.forward >> opt.expandmacros >> opt.ignoreformat >> opt.replace_all;
3990 is.get(); // Waste space before replace string
3993 while (line != "EOSS") {
3997 if (is.eof()) // Tolerate malformed request
4001 LYXERR(Debug::FIND, "repl_buf_name: '" << s << "'");
4002 opt.repl_buf_name = from_utf8(s);
4003 is >> opt.keep_case;
4006 opt.scope = FindAndReplaceOptions::SearchScope(i);
4008 opt.restr = FindAndReplaceOptions::SearchRestriction(i);
4010 LYXERR(Debug::FIND, "parsed: " << opt.casesensitive << ' ' << opt.matchword << ' ' << opt.forward << ' '
4011 << opt.expandmacros << ' ' << opt.ignoreformat << ' ' << opt.keep_case << ' '
4012 << opt.scope << ' ' << opt.restr);