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
12 * Full author contact details are available in file CREDITS.
20 #include "buffer_funcs.h"
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"
32 #include "ParIterator.h"
36 #include "frontends/Application.h"
37 #include "frontends/alert.h"
39 #include "mathed/InsetMath.h"
40 #include "mathed/InsetMathGrid.h"
41 #include "mathed/InsetMathHull.h"
42 #include "mathed/MathData.h"
43 #include "mathed/MathStream.h"
44 #include "mathed/MathSupport.h"
46 #include "support/convert.h"
47 #include "support/debug.h"
48 #include "support/docstream.h"
49 #include "support/FileName.h"
50 #include "support/gettext.h"
51 #include "support/lassert.h"
52 #include "support/lstrings.h"
54 #include "support/regex.h"
58 using namespace lyx::support;
63 // Helper class for deciding what should be ignored
68 : ignoreFamily_(false), ignoreSeries_(false),
69 ignoreShape_(false), ignoreUnderline_(false),
70 ignoreMarkUp_(false), ignoreStrikeOut_(false),
71 ignoreSectioning_(false), ignoreFrontMatter_(true),
72 ignoreColor_(false), ignoreLanguage_(false) {}
74 bool getFamily() { return ignoreFamily_; };
76 bool getSeries() { return ignoreSeries_; };
78 bool getShape() { return ignoreShape_; };
80 bool getUnderline() { return ignoreUnderline_; };
82 bool getMarkUp() { return ignoreMarkUp_; };
84 bool getStrikeOut() { return ignoreStrikeOut_; };
86 bool getSectioning() { return ignoreSectioning_; };
88 bool getFrontMatter() { return ignoreFrontMatter_; };
90 bool getColor() { return ignoreColor_; };
92 bool getLanguage() { return ignoreLanguage_; };
94 void setIgnoreFormat(string type, bool value);
104 bool ignoreUnderline_;
108 bool ignoreStrikeOut_;
110 bool ignoreSectioning_;
112 bool ignoreFrontMatter_;
116 bool ignoreLanguage_;
120 void IgnoreFormats::setIgnoreFormat(string type, bool value)
122 if (type == "color") {
123 ignoreColor_ = value;
125 else if (type == "language") {
126 ignoreLanguage_ = value;
128 else if (type == "sectioning") {
129 ignoreSectioning_ = value;
130 ignoreFrontMatter_ = value;
132 else if (type == "font") {
133 ignoreSeries_ = value;
134 ignoreShape_ = value;
135 ignoreFamily_ = value;
137 else if (type == "series") {
138 ignoreSeries_ = value;
140 else if (type == "shape") {
141 ignoreShape_ = value;
143 else if (type == "family") {
144 ignoreFamily_ = value;
146 else if (type == "markup") {
147 ignoreMarkUp_ = value;
149 else if (type == "underline") {
150 ignoreUnderline_ = value;
152 else if (type == "strike") {
153 ignoreStrikeOut_ = value;
157 // The global variable that can be changed from outside
158 IgnoreFormats ignoreFormats;
161 void setIgnoreFormat(string type, bool value)
163 ignoreFormats.setIgnoreFormat(type, value);
169 bool parse_bool(docstring & howto)
174 howto = split(howto, var, ' ');
179 class MatchString : public binary_function<Paragraph, pos_type, int>
182 MatchString(docstring const & str, bool cs, bool mw)
183 : str(str), case_sens(cs), whole_words(mw)
186 // returns true if the specified string is at the specified position
187 // del specifies whether deleted strings in ct mode will be considered
188 int operator()(Paragraph const & par, pos_type pos, bool del = true) const
190 return par.find(str, case_sens, whole_words, pos, del);
198 // match whole words only
203 int findForward(DocIterator & cur, MatchString const & match,
204 bool find_del = true)
206 for (; cur; cur.forwardChar())
207 if (cur.inTexted()) {
208 int len = match(cur.paragraph(), cur.pos(), find_del);
216 int findBackwards(DocIterator & cur, MatchString const & match,
217 bool find_del = true)
221 if (cur.inTexted()) {
222 int len = match(cur.paragraph(), cur.pos(), find_del);
231 bool searchAllowed(docstring const & str)
234 frontend::Alert::error(_("Search error"), _("Search string is empty"));
241 bool findOne(BufferView * bv, docstring const & searchstr,
242 bool case_sens, bool whole, bool forward,
243 bool find_del = true, bool check_wrap = false)
245 if (!searchAllowed(searchstr))
248 DocIterator cur = forward
249 ? bv->cursor().selectionEnd()
250 : bv->cursor().selectionBegin();
252 MatchString const match(searchstr, case_sens, whole);
254 int match_len = forward
255 ? findForward(cur, match, find_del)
256 : findBackwards(cur, match, find_del);
259 bv->putSelectionAt(cur, match_len, !forward);
260 else if (check_wrap) {
261 DocIterator cur_orig(bv->cursor());
264 q = _("End of file reached while searching forward.\n"
265 "Continue searching from the beginning?");
267 q = _("Beginning of file reached while searching backward.\n"
268 "Continue searching from the end?");
269 int wrap_answer = frontend::Alert::prompt(_("Wrap search?"),
270 q, 0, 1, _("&Yes"), _("&No"));
271 if (wrap_answer == 0) {
273 bv->cursor().clear();
274 bv->cursor().push_back(CursorSlice(bv->buffer().inset()));
276 bv->cursor().setCursor(doc_iterator_end(&bv->buffer()));
277 bv->cursor().backwardPos();
279 bv->clearSelection();
280 if (findOne(bv, searchstr, case_sens, whole, forward, find_del, false))
283 bv->cursor().setCursor(cur_orig);
287 return match_len > 0;
291 int replaceAll(BufferView * bv,
292 docstring const & searchstr, docstring const & replacestr,
293 bool case_sens, bool whole)
295 Buffer & buf = bv->buffer();
297 if (!searchAllowed(searchstr) || buf.isReadonly())
300 DocIterator cur_orig(bv->cursor());
302 MatchString const match(searchstr, case_sens, whole);
305 int const rsize = replacestr.size();
306 int const ssize = searchstr.size();
309 cur.setCursor(doc_iterator_begin(&buf));
310 int match_len = findForward(cur, match, false);
311 while (match_len > 0) {
312 // Backup current cursor position and font.
313 pos_type const pos = cur.pos();
314 Font const font = cur.paragraph().getFontSettings(buf.params(), pos);
316 int striked = ssize -
317 cur.paragraph().eraseChars(pos, pos + match_len,
318 buf.params().track_changes);
319 cur.paragraph().insert(pos, replacestr, font,
320 Change(buf.params().track_changes
322 : Change::UNCHANGED));
323 for (int i = 0; i < rsize + striked; ++i)
326 match_len = findForward(cur, match, false);
329 bv->putSelectionAt(doc_iterator_begin(&buf), 0, false);
331 cur_orig.fixIfBroken();
332 bv->setCursor(cur_orig);
338 // the idea here is that we are going to replace the string that
339 // is selected IF it is the search string.
340 // if there is a selection, but it is not the search string, then
341 // we basically ignore it. (FIXME We ought to replace only within
343 // if there is no selection, then:
344 // (i) if some search string has been provided, then we find it.
345 // (think of how the dialog works when you hit "replace" the
347 // (ii) if no search string has been provided, then we treat the
348 // word the cursor is in as the search string. (why? i have no
349 // idea.) but this only works in text?
351 // returns the number of replacements made (one, if any) and
352 // whether anything at all was done.
353 pair<bool, int> replaceOne(BufferView * bv, docstring searchstr,
354 docstring const & replacestr, bool case_sens,
355 bool whole, bool forward, bool findnext)
357 Cursor & cur = bv->cursor();
359 if (!cur.selection()) {
360 // no selection, non-empty search string: find it
361 if (!searchstr.empty()) {
362 found = findOne(bv, searchstr, case_sens, whole, forward, true, findnext);
363 return make_pair(found, 0);
365 // empty search string
368 return make_pair(false, 0);
369 // select current word and treat it as the search string.
370 // This causes a minor bug as undo will restore this selection,
371 // which the user did not create (#8986).
372 cur.innerText()->selectWord(cur, WHOLE_WORD);
373 searchstr = cur.selectionAsString(false);
376 // if we still don't have a search string, report the error
378 if (!searchAllowed(searchstr))
379 return make_pair(false, 0);
381 bool have_selection = cur.selection();
382 docstring const selected = cur.selectionAsString(false);
385 ? searchstr == selected
386 : compare_no_case(searchstr, selected) == 0;
388 // no selection or current selection is not search word:
389 // just find the search word
390 if (!have_selection || !match) {
391 found = findOne(bv, searchstr, case_sens, whole, forward, true, findnext);
392 return make_pair(found, 0);
395 // we're now actually ready to replace. if the buffer is
396 // read-only, we can't, though.
397 if (bv->buffer().isReadonly())
398 return make_pair(false, 0);
400 cap::replaceSelectionWithString(cur, replacestr);
402 cur.pos() += replacestr.length();
403 LASSERT(cur.pos() <= cur.lastpos(),
404 cur.pos() = cur.lastpos());
407 findOne(bv, searchstr, case_sens, whole, forward, false, findnext);
409 return make_pair(true, 1);
415 docstring const find2string(docstring const & search,
416 bool casesensitive, bool matchword, bool forward)
420 << int(casesensitive) << ' '
421 << int(matchword) << ' '
427 docstring const replace2string(docstring const & replace,
428 docstring const & search,
429 bool casesensitive, bool matchword,
430 bool all, bool forward, bool findnext)
433 ss << replace << '\n'
435 << int(casesensitive) << ' '
436 << int(matchword) << ' '
438 << int(forward) << ' '
444 bool lyxfind(BufferView * bv, FuncRequest const & ev)
446 if (!bv || ev.action() != LFUN_WORD_FIND)
449 //lyxerr << "find called, cmd: " << ev << endl;
451 // data is of the form
453 // <casesensitive> <matchword> <forward>"
455 docstring howto = split(ev.argument(), search, '\n');
457 bool casesensitive = parse_bool(howto);
458 bool matchword = parse_bool(howto);
459 bool forward = parse_bool(howto);
461 return findOne(bv, search, casesensitive, matchword, forward, true, true);
465 bool lyxreplace(BufferView * bv,
466 FuncRequest const & ev, bool has_deleted)
468 if (!bv || ev.action() != LFUN_WORD_REPLACE)
471 // data is of the form
474 // <casesensitive> <matchword> <all> <forward> <findnext>"
477 docstring howto = split(ev.argument(), rplc, '\n');
478 howto = split(howto, search, '\n');
480 bool casesensitive = parse_bool(howto);
481 bool matchword = parse_bool(howto);
482 bool all = parse_bool(howto);
483 bool forward = parse_bool(howto);
484 bool findnext = howto.empty() ? true : parse_bool(howto);
489 int replace_count = 0;
491 replace_count = replaceAll(bv, search, rplc, casesensitive, matchword);
492 update = replace_count > 0;
495 replaceOne(bv, search, rplc, casesensitive, matchword, forward, findnext);
497 replace_count = rv.second;
500 Buffer const & buf = bv->buffer();
502 // emit message signal.
503 buf.message(_("String not found."));
505 if (replace_count == 0) {
506 buf.message(_("String found."));
507 } else if (replace_count == 1) {
508 buf.message(_("String has been replaced."));
510 docstring const str =
511 bformat(_("%1$d strings have been replaced."), replace_count);
515 } else if (findnext) {
516 // if we have deleted characters, we do not replace at all, but
517 // rather search for the next occurence
518 if (findOne(bv, search, casesensitive, matchword, forward, true, findnext))
521 bv->message(_("String not found."));
527 bool findNextChange(BufferView * bv, Cursor & cur, bool const check_wrap)
529 for (; cur; cur.forwardPos())
530 if (cur.inTexted() && cur.paragraph().isChanged(cur.pos()))
534 DocIterator cur_orig(bv->cursor());
535 docstring q = _("End of file reached while searching forward.\n"
536 "Continue searching from the beginning?");
537 int wrap_answer = frontend::Alert::prompt(_("Wrap search?"),
538 q, 0, 1, _("&Yes"), _("&No"));
539 if (wrap_answer == 0) {
540 bv->cursor().clear();
541 bv->cursor().push_back(CursorSlice(bv->buffer().inset()));
542 bv->clearSelection();
543 cur.setCursor(bv->cursor().selectionBegin());
544 if (findNextChange(bv, cur, false))
547 bv->cursor().setCursor(cur_orig);
554 bool findPreviousChange(BufferView * bv, Cursor & cur, bool const check_wrap)
556 for (cur.backwardPos(); cur; cur.backwardPos()) {
557 if (cur.inTexted() && cur.paragraph().isChanged(cur.pos()))
562 DocIterator cur_orig(bv->cursor());
563 docstring q = _("Beginning of file reached while searching backward.\n"
564 "Continue searching from the end?");
565 int wrap_answer = frontend::Alert::prompt(_("Wrap search?"),
566 q, 0, 1, _("&Yes"), _("&No"));
567 if (wrap_answer == 0) {
568 bv->cursor().setCursor(doc_iterator_end(&bv->buffer()));
569 bv->cursor().backwardPos();
570 bv->clearSelection();
571 cur.setCursor(bv->cursor().selectionBegin());
572 if (findPreviousChange(bv, cur, false))
575 bv->cursor().setCursor(cur_orig);
582 bool selectChange(Cursor & cur, bool forward)
584 if (!cur.inTexted() || !cur.paragraph().isChanged(cur.pos()))
586 Change ch = cur.paragraph().lookupChange(cur.pos());
588 CursorSlice tip1 = cur.top();
589 for (; tip1.pit() < tip1.lastpit() || tip1.pos() < tip1.lastpos(); tip1.forwardPos()) {
590 Change ch2 = tip1.paragraph().lookupChange(tip1.pos());
591 if (!ch2.isSimilarTo(ch))
594 CursorSlice tip2 = cur.top();
595 for (; tip2.pit() > 0 || tip2.pos() > 0;) {
597 Change ch2 = tip2.paragraph().lookupChange(tip2.pos());
598 if (!ch2.isSimilarTo(ch)) {
599 // take a step forward to correctly set the selection
607 cur.bv().mouseSetCursor(cur, false);
609 cur.bv().mouseSetCursor(cur, true);
617 bool findChange(BufferView * bv, bool forward)
620 cur.setCursor(forward ? bv->cursor().selectionEnd()
621 : bv->cursor().selectionBegin());
622 forward ? findNextChange(bv, cur, true) : findPreviousChange(bv, cur, true);
623 return selectChange(cur, forward);
628 bool findNextChange(BufferView * bv)
630 return findChange(bv, true);
634 bool findPreviousChange(BufferView * bv)
636 return findChange(bv, false);
643 typedef vector<pair<string, string> > Escapes;
645 /// A map of symbols and their escaped equivalent needed within a regex.
646 /// @note Beware of order
647 Escapes const & get_regexp_escapes()
649 typedef std::pair<std::string, std::string> P;
651 static Escapes escape_map;
652 if (escape_map.empty()) {
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(")", "_x_)"));
660 escape_map.push_back(P("+", "_x_+"));
661 escape_map.push_back(P("*", "_x_*"));
662 escape_map.push_back(P(".", "_x_."));
663 escape_map.push_back(P("\\", "(?:\\\\|\\\\backslash)"));
664 escape_map.push_back(P("~", "(?:\\\\textasciitilde|\\\\sim)"));
665 escape_map.push_back(P("^", "(?:\\^|\\\\textasciicircum\\{\\}|\\\\textasciicircum|\\\\mathcircumflex)"));
666 escape_map.push_back(P("_x_", "\\"));
671 /// A map of lyx escaped strings and their unescaped equivalent.
672 Escapes const & get_lyx_unescapes()
674 typedef std::pair<std::string, std::string> P;
676 static Escapes escape_map;
677 if (escape_map.empty()) {
678 escape_map.push_back(P("\\%", "%"));
679 escape_map.push_back(P("\\mathcircumflex ", "^"));
680 escape_map.push_back(P("\\mathcircumflex", "^"));
681 escape_map.push_back(P("\\backslash ", "\\"));
682 escape_map.push_back(P("\\backslash", "\\"));
683 escape_map.push_back(P("\\\\{", "_x_<"));
684 escape_map.push_back(P("\\\\}", "_x_>"));
685 escape_map.push_back(P("\\sim ", "~"));
686 escape_map.push_back(P("\\sim", "~"));
691 /// A map of escapes turning a regexp matching text to one matching latex.
692 Escapes const & get_regexp_latex_escapes()
694 typedef std::pair<std::string, std::string> P;
696 static Escapes escape_map;
697 if (escape_map.empty()) {
698 escape_map.push_back(P("\\\\", "(?:\\\\\\\\|\\\\backslash|\\\\textbackslash\\{\\}|\\\\textbackslash)"));
699 escape_map.push_back(P("(<?!\\\\\\\\textbackslash)\\{", "\\\\\\{"));
700 escape_map.push_back(P("(<?!\\\\\\\\textbackslash\\\\\\{)\\}", "\\\\\\}"));
701 escape_map.push_back(P("\\[", "\\{\\[\\}"));
702 escape_map.push_back(P("\\]", "\\{\\]\\}"));
703 escape_map.push_back(P("\\^", "(?:\\^|\\\\textasciicircum\\{\\}|\\\\textasciicircum|\\\\mathcircumflex)"));
704 escape_map.push_back(P("%", "\\\\\\%"));
705 escape_map.push_back(P("#", "\\\\#"));
710 /** @todo Probably the maps need to be migrated to regexps, in order to distinguish if
711 ** the found occurrence were escaped.
713 string apply_escapes(string s, Escapes const & escape_map)
715 LYXERR(Debug::FIND, "Escaping: '" << s << "'");
716 Escapes::const_iterator it;
717 for (it = escape_map.begin(); it != escape_map.end(); ++it) {
718 // LYXERR(Debug::FIND, "Escaping " << it->first << " as " << it->second);
719 unsigned int pos = 0;
720 while (pos < s.length() && (pos = s.find(it->first, pos)) < s.length()) {
721 s.replace(pos, it->first.length(), it->second);
722 LYXERR(Debug::FIND, "After escape: " << s);
723 pos += it->second.length();
724 // LYXERR(Debug::FIND, "pos: " << pos);
727 LYXERR(Debug::FIND, "Escaped : '" << s << "'");
732 /// Within \regexp{} apply get_lyx_unescapes() only (i.e., preserve regexp semantics of the string),
733 /// while outside apply get_lyx_unescapes()+get_regexp_escapes().
734 /// If match_latex is true, then apply regexp_latex_escapes() to \regexp{} contents as well.
735 string escape_for_regex(string s, bool match_latex)
738 while (pos < s.size()) {
739 size_t new_pos = s.find("\\regexp{", pos);
740 if (new_pos == string::npos)
742 LYXERR(Debug::FIND, "new_pos: " << new_pos);
743 string t = apply_escapes(s.substr(pos, new_pos - pos), get_lyx_unescapes());
744 LYXERR(Debug::FIND, "t [lyx]: " << t);
745 t = apply_escapes(t, get_regexp_escapes());
746 LYXERR(Debug::FIND, "t [rxp]: " << t);
747 s.replace(pos, new_pos - pos, t);
748 new_pos = pos + t.size();
749 LYXERR(Debug::FIND, "Regexp after escaping: " << s);
750 LYXERR(Debug::FIND, "new_pos: " << new_pos);
751 if (new_pos == s.size())
753 // Might fail if \\endregexp{} is preceeded by unexpected stuff (weird escapes)
754 size_t end_pos = s.find("\\endregexp{}}", new_pos + 8);
755 LYXERR(Debug::FIND, "end_pos: " << end_pos);
756 t = s.substr(new_pos + 8, end_pos - (new_pos + 8));
757 LYXERR(Debug::FIND, "t in regexp : " << t);
758 t = apply_escapes(t, get_lyx_unescapes());
759 LYXERR(Debug::FIND, "t in regexp [lyx]: " << t);
761 t = apply_escapes(t, get_regexp_latex_escapes());
762 LYXERR(Debug::FIND, "t in regexp [ltx]: " << t);
764 if (end_pos == s.size()) {
765 s.replace(new_pos, end_pos - new_pos, t);
766 LYXERR(Debug::FIND, "Regexp after \\regexp{} removal: " << s);
769 s.replace(new_pos, end_pos + 13 - new_pos, t);
770 LYXERR(Debug::FIND, "Regexp after \\regexp{...\\endregexp{}} removal: " << s);
771 pos = new_pos + t.size();
772 LYXERR(Debug::FIND, "pos: " << pos);
778 /// Wrapper for lyx::regex_replace with simpler interface
779 bool regex_replace(string const & s, string & t, string const & searchstr,
780 string const & replacestr)
782 lyx::regex e(searchstr, regex_constants::ECMAScript);
784 ostream_iterator<char, char> it(oss);
785 lyx::regex_replace(it, s.begin(), s.end(), e, replacestr);
786 // tolerate t and s be references to the same variable
787 bool rv = (s != oss.str());
793 /** Checks if supplied string segment is well-formed from the standpoint of matching open-closed braces.
795 ** Verify that closed braces exactly match open braces. This avoids that, for example,
796 ** \frac{.*}{x} matches \frac{x+\frac{y}{x}}{z} with .* being 'x+\frac{y'.
799 ** Number of open braces that must remain open at the end for the verification to succeed.
801 bool braces_match(string::const_iterator const & beg,
802 string::const_iterator const & end,
806 string::const_iterator it = beg;
807 LYXERR(Debug::FIND, "Checking " << unmatched << " unmatched braces in '" << string(beg, end) << "'");
808 for (; it != end; ++it) {
809 // Skip escaped braces in the count
814 } else if (*it == '{') {
816 } else if (*it == '}') {
817 if (open_pars == 0) {
818 LYXERR(Debug::FIND, "Found unmatched closed brace");
824 if (open_pars != unmatched) {
825 LYXERR(Debug::FIND, "Found " << open_pars
826 << " instead of " << unmatched
827 << " unmatched open braces at the end of count");
830 LYXERR(Debug::FIND, "Braces match as expected");
835 /** The class performing a match between a position in the document and the FindAdvOptions.
837 class MatchStringAdv {
839 MatchStringAdv(lyx::Buffer & buf, FindAndReplaceOptions const & opt);
841 /** Tests if text starting at the supplied position matches with the one provided to the MatchStringAdv
842 ** constructor as opt.search, under the opt.* options settings.
845 ** If set, then match is searched only against beginning of text starting at cur.
846 ** If unset, then match is searched anywhere in text starting at cur.
849 ** The length of the matching text, or zero if no match was found.
851 int operator()(DocIterator const & cur, int len = -1, bool at_begin = true) const;
856 /// first buffer on which search was started
857 lyx::Buffer * const p_first_buf;
859 FindAndReplaceOptions const & opt;
862 /// Auxiliary find method (does not account for opt.matchword)
863 int findAux(DocIterator const & cur, int len = -1, bool at_begin = true) const;
865 /** Normalize a stringified or latexified LyX paragraph.
869 ** <li>if search is not casesensitive, then lowercase the string;
870 ** <li>remove any newline at begin or end of the string;
871 ** <li>replace any newline in the middle of the string with a simple space;
872 ** <li>remove stale empty styles and environments, like \emph{} and \textbf{}.
875 ** @todo Normalization should also expand macros, if the corresponding
876 ** search option was checked.
878 string normalize(docstring const & s, bool hack_braces) const;
879 // normalized string to search
880 string par_as_string;
881 // regular expression to use for searching
883 // same as regexp, but prefixed with a ".*"
885 // leading format material as string
886 string lead_as_string;
887 // par_as_string after removal of lead_as_string
888 string par_as_string_nolead;
889 // unmatched open braces in the search string/regexp
891 // number of (.*?) subexpressions added at end of search regexp for closing
892 // environments, math mode, styles, etc...
894 // Are we searching with regular expressions ?
899 static docstring buffer_to_latex(Buffer & buffer)
901 OutputParams runparams(&buffer.params().encoding());
902 odocstringstream ods;
904 runparams.nice = true;
905 runparams.flavor = OutputParams::LATEX;
906 runparams.linelen = 100000; //lyxrc.plaintext_linelen;
907 // No side effect of file copying and image conversion
908 runparams.dryrun = true;
909 runparams.for_search = true;
910 pit_type const endpit = buffer.paragraphs().size();
911 for (pit_type pit = 0; pit != endpit; ++pit) {
912 TeXOnePar(buffer, buffer.text(), pit, os, runparams);
913 LYXERR(Debug::FIND, "searchString up to here: " << ods.str());
919 static docstring stringifySearchBuffer(Buffer & buffer, FindAndReplaceOptions const & opt)
922 if (!opt.ignoreformat) {
923 str = buffer_to_latex(buffer);
925 OutputParams runparams(&buffer.params().encoding());
926 runparams.nice = true;
927 runparams.flavor = OutputParams::LATEX;
928 runparams.linelen = 100000; //lyxrc.plaintext_linelen;
929 runparams.dryrun = true;
930 runparams.for_search = true;
931 for (pos_type pit = pos_type(0); pit < (pos_type)buffer.paragraphs().size(); ++pit) {
932 Paragraph const & par = buffer.paragraphs().at(pit);
933 LYXERR(Debug::FIND, "Adding to search string: '"
934 << par.asString(pos_type(0), par.size(),
935 AS_STR_INSETS | AS_STR_SKIPDELETE | AS_STR_PLAINTEXT,
938 str += par.asString(pos_type(0), par.size(),
939 AS_STR_INSETS | AS_STR_SKIPDELETE | AS_STR_PLAINTEXT,
947 /// Return separation pos between the leading material and the rest
948 static size_t identifyLeading(string const & s)
951 // @TODO Support \item[text]
952 // Kornel: Added textsl, textsf, textit, texttt and noun
953 // + allow to search for colored text too
954 while (regex_replace(t, t, REGEX_BOS "\\\\(((emph|noun|minisec|text(bf|md|sl|sf|it|tt))|((textcolor|foreignlanguage)\\{[a-z]+\\})|(u|uu)line|(s|x)out|uwave)|((sub)?(((sub)?section)|paragraph)|part|chapter)\\*?)\\{", "")
955 || regex_replace(t, t, REGEX_BOS "\\$", "")
956 || regex_replace(t, t, REGEX_BOS "\\\\\\[ ", "")
957 || regex_replace(t, t, REGEX_BOS " ?\\\\item\\{[a-z]+\\}", "")
958 || regex_replace(t, t, REGEX_BOS "\\\\begin\\{[a-zA-Z_]*\\*?\\} ", ""))
960 LYXERR(Debug::FIND, " after removing leading $, \\[ , \\emph{, \\textbf{, etc.: '" << t << "'");
965 * Given a latexified string, retrieve some handled features
966 * The features of the regex will later be compared with the features
967 * of the searched text. If the regex features are not a
968 * subset of the analized, then, in not format ignoring search
969 * we can early stop the search in the relevant inset.
971 typedef map<string, bool> Features;
973 static Features identifyFeatures(string const & s)
975 static regex const feature("\\\\(([a-z]+(\\{([a-z]+)\\}|\\*)?))\\{");
976 static regex const valid("^(((emph|noun|text(bf|md|sl|sf|it|tt)|(textcolor|foreignlanguage|item)\\{[a-z]+\\})|(u|uu)line|(s|x)out|uwave)|((sub)?(((sub)?section)|paragraph)|part|chapter)\\*?)$");
981 for (sregex_iterator it(s.begin(), s.end(), feature), end; it != end; ++it) {
984 if (sub.str(1).compare("regexp") == 0) {
988 string token = sub.str(1);
990 if (regex_match(token, sub2, valid)) {
998 if (sub.str(1).compare("endregexp") == 0) {
1008 * defines values features of a key "\\[a-z]+{"
1015 isMain, /* for \\foreignlanguage */
1023 isIgnored /* to be ignored by creating infos */
1028 parenthesiscount(1),
1032 KeyInfo(KeyType type, int parcount, bool disable)
1034 parenthesiscount(parcount),
1043 int parenthesiscount;
1045 bool used; /* by pattern */
1050 Border(int l=0, int u=0) : low(l), upper(u) {};
1055 #define MAXOPENED 30
1057 bool isPatternString;
1059 Intervall(bool isPattern) : isPatternString(isPattern), ignoreidx(-1), actualdeptindex(0) { depts[0] = 0;};
1062 int depts[MAXOPENED];
1063 int closes[MAXOPENED];
1064 int actualdeptindex;
1065 Border borders[2*MAXOPENED];
1066 // int previousNotIgnored(int);
1067 int nextNotIgnored(int);
1068 void handleOpenP(int i);
1069 void handleCloseP(int i, bool closingAllowed);
1070 void resetOpenedP(int openPos);
1071 void addIntervall(int upper);
1072 void addIntervall(int low, int upper); /* if explicit */
1073 void setForDefaultLang(int upTo);
1074 int findclosing(int start, int end, char up, char down);
1075 void handleParentheses(int lastpos, bool closingAllowed);
1076 void output(ostringstream &os, int lastpos);
1077 // string show(int lastpos);
1080 void Intervall::setForDefaultLang(int upTo)
1082 // Enable the use of first token again
1083 if (ignoreidx >= 0) {
1084 if (borders[0].low < upTo)
1085 borders[0].low = upTo;
1086 if (borders[0].upper < upTo)
1087 borders[0].upper = upTo;
1091 static void checkDepthIndex(int val)
1093 static int maxdepthidx = MAXOPENED-2;
1094 if (val > maxdepthidx) {
1096 LYXERR0("maxdepthidx now " << val);
1100 static void checkIgnoreIdx(int val)
1102 static int maxignoreidx = 2*MAXOPENED - 4;
1103 if (val > maxignoreidx) {
1105 LYXERR0("maxignoreidx now " << val);
1110 * Expand the region of ignored parts of the input latex string
1111 * The region is only relevant in output()
1113 void Intervall::addIntervall(int low, int upper)
1116 if (low == upper) return;
1117 for (idx = ignoreidx+1; idx > 0; --idx) {
1118 if (low > borders[idx-1].upper) {
1122 Border br(low, upper);
1123 if (idx > ignoreidx) {
1126 checkIgnoreIdx(ignoreidx);
1130 // Expand only if one of the new bound is inside the interwall
1131 // We know here that br.low > borders[idx-1].upper
1132 if (br.upper < borders[idx].low) {
1133 // We have to insert at this pos
1134 for (int i = ignoreidx+1; i > idx; --i) {
1135 borders[i] = borders[i-1];
1139 checkIgnoreIdx(ignoreidx);
1142 // Here we know, that we are overlapping
1143 if (br.low > borders[idx].low)
1144 br.low = borders[idx].low;
1145 // check what has to be concatenated
1147 for (int i = idx; i <= ignoreidx; i++) {
1148 if (br.upper >= borders[i].low) {
1150 if (br.upper < borders[i].upper)
1151 br.upper = borders[i].upper;
1157 // count should be >= 1 here
1160 for (int i = idx + count; i <= ignoreidx; i++) {
1161 borders[i-count+1] = borders[i];
1163 ignoreidx -= count - 1;
1169 void Intervall::handleOpenP(int i)
1172 depts[actualdeptindex] = i+1;
1173 closes[actualdeptindex] = -1;
1174 checkDepthIndex(actualdeptindex);
1177 void Intervall::handleCloseP(int i, bool closingAllowed)
1179 if (actualdeptindex <= 0) {
1180 if (! closingAllowed)
1181 LYXERR(Debug::FIND, "Bad closing parenthesis in latex"); /* should not happen, but the latex input may be wrong */
1182 // if we are at the very end
1183 addIntervall(i, i+1);
1186 closes[actualdeptindex] = i+1;
1191 void Intervall::resetOpenedP(int openPos)
1193 // Used as initializer for foreignlanguage entry
1194 actualdeptindex = 1;
1195 depts[1] = openPos+1;
1200 int Intervall::previousNotIgnored(int start)
1202 int idx = 0; /* int intervalls */
1203 for (idx = ignoreidx; idx >= 0; --idx) {
1204 if (start > borders[idx].upper)
1206 if (start >= borders[idx].low)
1207 start = borders[idx].low-1;
1213 int Intervall::nextNotIgnored(int start)
1215 int idx = 0; /* int intervalls */
1216 for (idx = 0; idx <= ignoreidx; idx++) {
1217 if (start < borders[idx].low)
1219 if (start < borders[idx].upper)
1220 start = borders[idx].upper;
1225 typedef map<string, KeyInfo> KeysMap;
1226 typedef vector< KeyInfo> Entries;
1227 static KeysMap keys = map<string, KeyInfo>();
1234 void buildKeys(bool);
1235 void buildEntries(bool);
1236 void makeKey(const string &, KeyInfo, bool isPatternString);
1237 void processRegion(int start, int region_end); /* remove {} parts */
1238 void removeHead(KeyInfo&, int count=0);
1241 LatexInfo(string par, bool isPatternString) : interval(isPatternString) {
1243 buildKeys(isPatternString);
1244 entries = vector<KeyInfo>();
1245 buildEntries(isPatternString);
1249 if (entries.empty()) {
1256 if (int(entries.size()) > entidx) {
1263 bool setNextKey(int idx) {
1264 if ((idx == entidx) && (entidx >= 0)) {
1271 int process(ostringstream &os, KeyInfo &actual);
1272 int dispatch(ostringstream &os, int previousStart, KeyInfo &actual);
1273 // string show(int lastpos) { return interval.show(lastpos);};
1274 int nextNotIgnored(int start) { return interval.nextNotIgnored(start);};
1275 KeyInfo &getKeyInfo(int keyinfo) {
1276 static KeyInfo invalidInfo = KeyInfo();
1277 if ((keyinfo < 0) || ( keyinfo >= int(entries.size())))
1280 return entries[keyinfo];
1282 void setForDefaultLang(int upTo) {interval.setForDefaultLang(upTo);};
1286 int Intervall::findclosing(int start, int end, char up = '{', char down = '}')
1290 for (int i = start; i < end; i += 1 + skip) {
1294 if (c == '\\') skip = 1;
1298 else if (c == down) {
1299 if (depth == 0) return i;
1315 vector<MathEntry> entries;
1320 void insert(string wait, size_t start, size_t end) {
1321 MathEntry m = MathEntry();
1323 m.mathStart = start;
1325 m.mathSize = end - start;
1326 entries.push_back(m);
1328 bool evaluating(size_t pos) {
1329 while (actualIdx < entries.size()) {
1330 if (pos < entries[actualIdx].mathStart)
1332 if (pos < entries[actualIdx].mathEnd)
1338 bool empty() { return entries.empty(); };
1339 size_t getEndPos() {
1340 if (entries.empty() || (actualIdx >= entries.size())) {
1343 return entries[actualIdx].mathEnd;
1345 size_t getStartPos() {
1346 if (entries.empty() || (actualIdx >= entries.size())) {
1347 return 100000; /* definitely enough? */
1349 return entries[actualIdx].mathStart;
1351 size_t getFirstPos() {
1353 return getStartPos();
1356 if (entries.empty() || (actualIdx >= entries.size())) {
1359 return entries[actualIdx].mathSize;
1361 void incrEntry() { actualIdx++; };
1364 void LatexInfo::buildEntries(bool isPatternString)
1366 static regex const rmath("\\$|\\\\\\[|\\\\\\]|\\\\(begin|end)\\{((eqnarray|equation|flalign|gather|multline|align|alignat)\\*?)\\}");
1367 static regex const rkeys("\\$|\\\\\\[|\\\\\\]|\\\\((([a-zA-Z]+\\*?)(\\{([a-z]+\\*?)\\}|=[0-9]+[a-z]+)?))");
1368 static bool disableLanguageOverride = false;
1369 smatch sub, submath;
1370 bool evaluatingRegexp = false;
1372 bool evaluatingMath = false;
1374 bool math_end_waiting = false;
1375 size_t math_pos = 10000;
1378 for (sregex_iterator itmath(interval.par.begin(), interval.par.end(), rmath), end; itmath != end; ++itmath) {
1380 if (math_end_waiting) {
1381 size_t pos = submath.position(size_t(0));
1382 if ((math_end == "$") &&
1383 (submath.str(0) == "$") &&
1384 (interval.par[pos-1] != '\\')) {
1385 mi.insert("$", math_pos, pos + 1);
1386 math_end_waiting = false;
1388 else if ((math_end == "\\]") &&
1389 (submath.str(0) == "\\]")) {
1390 mi.insert("\\]", math_pos, pos + 2);
1391 math_end_waiting = false;
1393 else if ((submath.str(1).compare("end") == 0) &&
1394 (submath.str(2).compare(math_end) == 0)) {
1395 mi.insert(math_end, math_pos, pos + submath.str(0).length());
1396 math_end_waiting = false;
1402 if (submath.str(1).compare("begin") == 0) {
1403 math_end_waiting = true;
1404 math_end = submath.str(2);
1405 math_pos = submath.position(size_t(0));
1407 else if (submath.str(0).compare("\\[") == 0) {
1408 math_end_waiting = true;
1410 math_pos = submath.position(size_t(0));
1412 else if (submath.str(0) == "$") {
1413 size_t pos = submath.position(size_t(0));
1414 if ((pos == 0) || (interval.par[pos-1] != '\\')) {
1415 math_end_waiting = true;
1422 // Ignore language if there is math somewhere in pattern-string
1423 if (isPatternString) {
1426 keys["foreignlanguage"].disabled = true;
1427 disableLanguageOverride = true;
1430 disableLanguageOverride = false;
1433 if (disableLanguageOverride) {
1434 keys["foreignlanguage"].disabled = true;
1437 math_pos = mi.getFirstPos();
1438 for (sregex_iterator it(interval.par.begin(), interval.par.end(), rkeys), end; it != end; ++it) {
1440 string key = sub.str(3);
1442 if (sub.str(0)[0] == '\\')
1443 key = sub.str(0)[1];
1447 if (evaluatingRegexp) {
1448 if (sub.str(1).compare("endregexp") == 0) {
1449 evaluatingRegexp = false;
1450 // found._tokenstart already set
1451 found._dataEnd = sub.position(size_t(0)) + 13;
1452 found._dataStart = found._dataEnd;
1453 found._tokensize = found._dataEnd - found._tokenstart;
1454 found.parenthesiscount = 0;
1458 if (evaluatingMath) {
1459 if (size_t(sub.position(size_t(0))) < mi.getEndPos())
1461 evaluatingMath = false;
1463 math_pos = mi.getStartPos();
1465 if (keys.find(key) == keys.end()) {
1466 LYXERR(Debug::FIND, "Found unknown key " << sub.str(0));
1470 if (key.compare("regexp") == 0) {
1471 evaluatingRegexp = true;
1472 found._tokenstart = sub.position(size_t(0));
1473 found._tokensize = 0;
1477 // Handle the other params of key
1478 if (found.keytype == KeyInfo::isIgnored)
1480 else if (found.keytype == KeyInfo::isMath) {
1481 if (size_t(sub.position(size_t(0))) == math_pos) {
1483 found._tokenstart = sub.position(size_t(0));
1484 found._tokensize = mi.getSize();
1485 found._dataEnd = found._tokenstart + found._tokensize;
1486 found._dataStart = found._dataEnd;
1487 found.parenthesiscount = 0;
1488 evaluatingMath = true;
1491 // begin|end of unknown env, discard
1492 // First handle tables
1493 // longtable|tabular
1494 bool discardComment;
1495 if ((sub.str(5).compare("longtable") == 0) ||
1496 (sub.str(5).compare("tabular") == 0)) {
1497 discardComment = true; /* '%' */
1500 discardComment = false;
1502 // discard spaces before pos(0)
1503 int pos = sub.position(size_t(0));
1505 for (count = 0; pos - count > 0; count++) {
1506 char c = interval.par[pos-count-1];
1507 if (discardComment) {
1508 if ((c != ' ') && (c != '%'))
1514 found.keytype = KeyInfo::doRemove;
1515 found._tokenstart = pos - count;
1516 if (sub.str(1).compare(0, 5, "begin") == 0) {
1517 size_t pos1 = pos + sub.str(0).length();
1518 if (interval.par[pos1] == '[') {
1519 pos1 = interval.findclosing(pos1+1, interval.par.length(), '[', ']')+1;
1521 if (interval.par[pos1] == '{') {
1522 found._dataEnd = interval.findclosing(pos1+1, interval.par.length()) + 1;
1525 found._dataEnd = pos1;
1527 found._dataStart = found._dataEnd;
1530 found._dataStart = pos + sub.str(0).length();
1531 found._dataEnd = found._dataStart;
1533 found._tokensize = count + found._dataEnd - pos;
1534 found.parenthesiscount = 0;
1535 found.disabled = true;
1538 else if (found.keytype != KeyInfo::isRegex) {
1539 found._tokenstart = sub.position(size_t(0));
1540 if (found.parenthesiscount == 0) {
1541 // Probably to be discarded
1542 char following = interval.par[sub.position(size_t(0)) + sub.str(3).length() + 1];
1543 if (following == ' ')
1544 found.head = "\\" + sub.str(3) + " ";
1545 else if (following == '=') {
1546 // like \uldepth=1000pt
1547 found.head = sub.str(0);
1550 found.head = "\\" + key;
1551 found._tokensize = found.head.length();
1552 found._dataEnd = found._tokenstart + found._tokensize;
1553 found._dataStart = found._dataEnd;
1556 if (found.parenthesiscount == 1) {
1557 found.head = "\\" + key + "{";
1559 else if (found.parenthesiscount == 2) {
1560 found.head = sub.str(0) + "{";
1562 found._tokensize = found.head.length();
1563 found._dataStart = found._tokenstart + found.head.length();
1564 size_t endpos = interval.findclosing(found._dataStart, interval.par.length());
1565 if ((endpos == interval.par.length()) &&
1566 (found.keytype == KeyInfo::doRemove)) {
1567 // Missing closing => error in latex-input?
1568 // therefore do not delete remaining data
1569 found._dataStart -= 1;
1570 found._dataEnd = found._dataStart;
1573 found._dataEnd = endpos;
1574 if (isPatternString) {
1575 keys[key].used = true;
1579 entries.push_back(found);
1583 void LatexInfo::makeKey(const string &keysstring, KeyInfo keyI, bool isPatternString)
1585 stringstream s(keysstring);
1587 const char delim = '|';
1588 while (getline(s, key, delim)) {
1589 KeyInfo keyII(keyI);
1590 if (isPatternString) {
1593 else if ( !keys[key].used)
1594 keyII.disabled = true;
1599 void LatexInfo::buildKeys(bool isPatternString)
1602 static bool keysBuilt = false;
1603 if (keysBuilt && !isPatternString) return;
1605 // Know standard keys with 1 parameter.
1606 // Split is done, if not at start of region
1607 makeKey("textsf|textss|texttt", KeyInfo(KeyInfo::isStandard, 1, ignoreFormats.getFamily()), isPatternString);
1608 makeKey("textbf", KeyInfo(KeyInfo::isStandard, 1, ignoreFormats.getSeries()), isPatternString);
1609 makeKey("textit|textsc|textsl", KeyInfo(KeyInfo::isStandard, 1, ignoreFormats.getShape()), isPatternString);
1610 makeKey("uuline|uline|uwave", KeyInfo(KeyInfo::isStandard, 1, ignoreFormats.getUnderline()), isPatternString);
1611 makeKey("emph|noun", KeyInfo(KeyInfo::isStandard, 1, ignoreFormats.getMarkUp()), isPatternString);
1612 makeKey("sout|xout", KeyInfo(KeyInfo::isStandard, 1, ignoreFormats.getStrikeOut()), isPatternString);
1614 makeKey("section|subsection|subsubsection|paragraph|subparagraph|minisec",
1615 KeyInfo(KeyInfo::isSectioning, 1, ignoreFormats.getSectioning()), isPatternString);
1616 makeKey("section*|subsection*|subsubsection*|paragraph*",
1617 KeyInfo(KeyInfo::isSectioning, 1, ignoreFormats.getSectioning()), isPatternString);
1618 makeKey("part|part*|chapter|chapter*", KeyInfo(KeyInfo::isSectioning, 1, ignoreFormats.getSectioning()), isPatternString);
1619 makeKey("title|subtitle|author|subject|publishers|dedication|uppertitleback|lowertitleback|extratitle|lyxaddress|lyxrightaddress", KeyInfo(KeyInfo::isSectioning, 1, ignoreFormats.getFrontMatter()), isPatternString);
1621 makeKey("regexp", KeyInfo(KeyInfo::isRegex, 1, false), isPatternString);
1623 // Split is done, if not at start of region
1624 makeKey("textcolor", KeyInfo(KeyInfo::isStandard, 2, ignoreFormats.getColor()), isPatternString);
1626 // Split is done always.
1627 makeKey("foreignlanguage", KeyInfo(KeyInfo::isMain, 2, ignoreFormats.getLanguage()), isPatternString);
1631 makeKey("backslash|textbackslash|textasciicircum|textasciitilde|ldots", KeyInfo(KeyInfo::isChar, 1, false), isPatternString);
1632 // Found in fr/UserGuide.lyx
1633 makeKey("og|fg", KeyInfo(KeyInfo::isChar, 0, false), isPatternString);
1635 // Known macros to remove (including their parameter)
1637 makeKey("inputencoding|shortcut|label|ref", KeyInfo(KeyInfo::doRemove, 1, false), isPatternString);
1639 // Macros to remove, but let the parameter survive
1641 makeKey("url|href|menuitem|footnote|code|index|textmd", KeyInfo(KeyInfo::isStandard, 1, true), isPatternString);
1643 // Same effect as previous, parameter will survive (because there is no one anyway)
1645 makeKey("noindent", KeyInfo(KeyInfo::isStandard, 0, true), isPatternString);
1646 // Remove table decorations
1647 makeKey("hline|tabularnewline|toprule|bottomrule|midrule", KeyInfo(KeyInfo::doRemove, 0, true), isPatternString);
1648 // Discard shape-header
1649 makeKey("circlepar|diamondpar|heartpar|nutpar", KeyInfo(KeyInfo::isStandard, 1, true), isPatternString);
1650 makeKey("trianglerightpar|hexagonpar|starpar", KeyInfo(KeyInfo::isStandard, 1, true), isPatternString);
1651 makeKey("triangleuppar|triangledownpar|droppar", KeyInfo(KeyInfo::isStandard, 1, true), isPatternString);
1652 makeKey("triangleleftpar|shapepar|dropuppar", KeyInfo(KeyInfo::isStandard, 1, true), isPatternString);
1653 // like ('tiny{}' or '\tiny ' ... )
1654 makeKey("footnotesize|tiny|scriptsize|small|large|Large|LARGE|huge|Huge", KeyInfo(KeyInfo::isSize, 0, true), isPatternString);
1656 // Survives, like known character
1657 makeKey("lyx|latex|tex", KeyInfo(KeyInfo::isIgnored, 0, false), isPatternString);
1658 makeKey("item", KeyInfo(KeyInfo::isList, 1, false), isPatternString);
1660 makeKey("begin|end", KeyInfo(KeyInfo::isMath, 1, false), isPatternString);
1661 makeKey("[|]", KeyInfo(KeyInfo::isMath, 1, false), isPatternString);
1662 makeKey("$", KeyInfo(KeyInfo::isMath, 1, false), isPatternString);
1664 makeKey("par|uldepth|ULdepth|protect", KeyInfo(KeyInfo::doRemove, 0, true), isPatternString);
1666 if (isPatternString) {
1667 // Allow the first searched string to rebuild the keys too
1671 // no need to rebuild again
1677 * Keep the list of actual opened parentheses actual
1678 * (e.g. depth == 4 means there are 4 '{' not processed yet)
1680 void Intervall::handleParentheses(int lastpos, bool closingAllowed)
1683 for (int i = depts[actualdeptindex]; i < lastpos; i+= 1 + skip) {
1687 if (c == '\\') skip = 1;
1688 else if (c == '{') {
1691 else if (c == '}') {
1692 handleCloseP(i, closingAllowed);
1698 string Intervall::show(int lastpos)
1700 int idx = 0; /* int intervalls */
1704 for (idx = 0; idx <= ignoreidx; idx++) {
1705 while (i < lastpos) {
1707 if (i <= borders[idx].low) {
1708 if (borders[idx].low > lastpos)
1709 printsize = lastpos - i;
1711 printsize = borders[idx].low - i;
1712 s += par.substr(i, printsize);
1714 if (i >= borders[idx].low)
1715 i = borders[idx].upper;
1718 i = borders[idx].upper;
1724 s += par.substr(i, lastpos-i);
1730 void Intervall::output(ostringstream &os, int lastpos)
1732 // get number of chars to output
1733 int idx = 0; /* int intervalls */
1735 for (idx = 0; idx <= ignoreidx; idx++) {
1738 if (i <= borders[idx].low) {
1739 if (borders[idx].low > lastpos)
1740 printsize = lastpos - i;
1742 printsize = borders[idx].low - i;
1743 os << par.substr(i, printsize);
1745 handleParentheses(i, false);
1746 if (i >= borders[idx].low)
1747 i = borders[idx].upper;
1750 i = borders[idx].upper;
1757 os << par.substr(i, lastpos-i);
1759 handleParentheses(lastpos, false);
1760 for (int i = actualdeptindex; i > 0; --i) {
1763 if (! isPatternString)
1765 handleParentheses(lastpos, true); /* extra closings '}' allowed here */
1768 void LatexInfo::processRegion(int start, int region_end)
1770 while (start < region_end) { /* Let {[} and {]} survive */
1771 if ((interval.par[start] == '{') &&
1772 (interval.par[start+1] != ']') &&
1773 (interval.par[start+1] != '[')) {
1774 // Closing is allowed past the region
1775 int closing = interval.findclosing(start+1, interval.par.length());
1776 interval.addIntervall(start, start+1);
1777 interval.addIntervall(closing, closing+1);
1779 start = interval.nextNotIgnored(start+1);
1783 void LatexInfo::removeHead(KeyInfo &actual, int count)
1785 if (actual.parenthesiscount == 0) {
1786 // "{\tiny{} ...}" ==> "{{} ...}"
1787 interval.addIntervall(actual._tokenstart-count, actual._tokenstart + actual._tokensize);
1790 // Remove header hull, that is "\url{abcd}" ==> "abcd"
1791 interval.addIntervall(actual._tokenstart, actual._dataStart);
1792 interval.addIntervall(actual._dataEnd, actual._dataEnd+1);
1796 int LatexInfo::dispatch(ostringstream &os, int previousStart, KeyInfo &actual)
1799 switch (actual.keytype)
1801 case KeyInfo::isChar: {
1802 nextKeyIdx = getNextKey();
1805 case KeyInfo::isSize: {
1806 if (actual.disabled) {
1808 processRegion(actual._dataEnd, actual._dataEnd+1); /* remove possibly following {} */
1809 interval.addIntervall(actual._tokenstart, actual._dataEnd+1);
1810 nextKeyIdx = getNextKey();
1812 // Split on this key if not at start
1813 int start = interval.nextNotIgnored(previousStart);
1814 if (start < actual._tokenstart) {
1815 interval.output(os, actual._tokenstart);
1816 interval.addIntervall(start, actual._tokenstart);
1818 // discard entry if at end of actual
1819 nextKeyIdx = process(os, actual);
1823 case KeyInfo::isStandard: {
1824 if (actual.disabled) {
1826 processRegion(actual._dataStart, actual._dataStart+1);
1827 nextKeyIdx = getNextKey();
1829 // Split on this key if not at start
1830 int start = interval.nextNotIgnored(previousStart);
1831 if (start < actual._tokenstart) {
1832 interval.output(os, actual._tokenstart);
1833 interval.addIntervall(start, actual._tokenstart);
1835 // discard entry if at end of actual
1836 nextKeyIdx = process(os, actual);
1840 case KeyInfo::doRemove: {
1841 // Remove the key with all parameters and following spaces
1843 for (pos = actual._dataEnd+1; pos < interval.par.length(); pos++) {
1844 if (interval.par[pos] != ' ')
1847 interval.addIntervall(actual._tokenstart, pos);
1848 nextKeyIdx = getNextKey();
1851 case KeyInfo::isList: {
1852 // Discard space before _tokenstart
1854 for (count = 0; count < actual._tokenstart; count++) {
1855 if (interval.par[actual._tokenstart-count-1] != ' ')
1858 if (actual.disabled) {
1859 interval.addIntervall(actual._tokenstart-count, actual._dataEnd+1);
1862 interval.addIntervall(actual._tokenstart-count, actual._tokenstart);
1864 // Discard extra parentheses '[]'
1865 if (interval.par[actual._dataEnd+1] == '[') {
1866 int posdown = interval.findclosing(actual._dataEnd+2, interval.par.length(), '[', ']');
1867 if ((interval.par[actual._dataEnd+2] == '{') &&
1868 (interval.par[posdown-1] == '}')) {
1869 interval.addIntervall(actual._dataEnd+1,actual._dataEnd+3);
1870 interval.addIntervall(posdown-1, posdown+1);
1873 interval.addIntervall(actual._dataEnd+1, actual._dataEnd+2);
1874 interval.addIntervall(posdown, posdown+1);
1876 int blk = interval.nextNotIgnored(actual._dataEnd+1);
1877 if (blk > posdown) {
1878 // Discard at most 1 space after empty item
1880 for (count = 0; count < 1; count++) {
1881 if (interval.par[blk+count] != ' ')
1885 interval.addIntervall(blk, blk+count);
1888 nextKeyIdx = getNextKey();
1891 case KeyInfo::isSectioning: {
1892 // Discard spaces before _tokenstart
1894 for (count = 0; count < actual._tokenstart; count++) {
1895 if (interval.par[actual._tokenstart-count-1] != ' ')
1898 if (actual.disabled) {
1899 removeHead(actual, count);
1900 nextKeyIdx = getNextKey();
1902 interval.addIntervall(actual._tokenstart-count, actual._tokenstart);
1903 nextKeyIdx = process(os, actual);
1907 case KeyInfo::isMath: {
1908 // Same as regex, use the content unchanged
1909 nextKeyIdx = getNextKey();
1912 case KeyInfo::isRegex: {
1913 // DO NOT SPLIT ON REGEX
1915 nextKeyIdx = getNextKey();
1918 case KeyInfo::isIgnored: {
1919 // Treat like a character for now
1920 nextKeyIdx = getNextKey();
1923 case KeyInfo::isMain: {
1924 if (actual.disabled) {
1926 if ((interval.par.substr(actual._dataStart, 3) == " \\[") ||
1927 (interval.par.substr(actual._dataStart, 8) == " \\begin{")) {
1928 // Discard also the space before math-equation
1929 interval.addIntervall(actual._dataStart, actual._dataStart+1);
1931 interval.resetOpenedP(actual._dataStart-1);
1934 if (actual._tokenstart == 0) {
1935 // for the first (and maybe dummy) language
1936 interval.setForDefaultLang(actual._tokenstart + actual._tokensize);
1938 interval.resetOpenedP(actual._dataStart-1);
1942 case KeyInfo::invalid:
1943 // This cannot happen, already handled
1946 // LYXERR0("Unhandled keytype");
1947 nextKeyIdx = getNextKey();
1954 int LatexInfo::process(ostringstream &os, KeyInfo &actual )
1956 int end = interval.nextNotIgnored(actual._dataEnd);
1957 int oldStart = actual._dataStart;
1958 int nextKeyIdx = getNextKey();
1960 if ((nextKeyIdx < 0) ||
1961 (entries[nextKeyIdx]._tokenstart >= actual._dataEnd) ||
1962 (entries[nextKeyIdx].keytype == KeyInfo::invalid)) {
1963 if (oldStart <= end) {
1964 processRegion(oldStart, end);
1969 KeyInfo &nextKey = getKeyInfo(nextKeyIdx);
1971 if (nextKey.keytype == KeyInfo::isMain) {
1972 (void) dispatch(os, actual._dataStart, nextKey);
1973 end = nextKey._tokenstart;
1976 processRegion(oldStart, nextKey._tokenstart);
1977 nextKeyIdx = dispatch(os, actual._dataStart, nextKey);
1979 oldStart = nextKey._dataEnd+1;
1981 // now nextKey is either invalid or is outside of actual._dataEnd
1982 // output the remaining and discard myself
1983 if (oldStart <= end) {
1984 processRegion(oldStart, end);
1986 if (interval.par[end] == '}') {
1988 // This is the normal case.
1989 // But if using the firstlanguage, the closing may be missing
1991 // get minimum of 'end' and 'actual._dataEnd' in case that the nextKey.keytype was 'KeyInfo::isMain'
1993 if (actual._dataEnd < end)
1994 output_end = interval.nextNotIgnored(actual._dataEnd);
1996 output_end = interval.nextNotIgnored(end);
1997 if (interval.nextNotIgnored(actual._dataStart) < output_end)
1998 interval.output(os, output_end);
1999 interval.addIntervall(actual._tokenstart, end);
2003 string splitOnKnownMacros(string par, bool isPatternString) {
2005 LatexInfo li(par, isPatternString);
2006 KeyInfo DummyKey = KeyInfo(KeyInfo::KeyType::isMain, 2, true);
2008 DummyKey._tokensize = 0;
2009 DummyKey._tokenstart = 0;
2010 DummyKey._dataStart = 0;
2011 DummyKey._dataEnd = par.length();
2012 DummyKey.disabled = true;
2013 int firstkeyIdx = li.getFirstKey();
2015 if (firstkeyIdx >= 0) {
2016 KeyInfo firstKey = li.getKeyInfo(firstkeyIdx);
2018 if ((firstKey.keytype != KeyInfo::isMain) || firstKey.disabled) {
2019 // Use dummy firstKey
2020 firstKey = DummyKey;
2021 (void) li.setNextKey(firstkeyIdx);
2023 nextkeyIdx = li.process(os, firstKey);
2024 while (nextkeyIdx >= 0) {
2025 // Check for a possible gap between the last
2026 // entry and this one
2027 int datastart = li.nextNotIgnored(firstKey._dataStart);
2028 KeyInfo &nextKey = li.getKeyInfo(nextkeyIdx);
2029 if ((nextKey._tokenstart > datastart)) {
2031 firstKey._dataStart = datastart;
2032 firstKey._dataEnd = par.length();
2033 (void) li.setNextKey(nextkeyIdx);
2034 if (firstKey._tokensize > 0) {
2035 // Fake the last opened parenthesis
2036 li.setForDefaultLang(firstKey._tokensize);
2038 nextkeyIdx = li.process(os, firstKey);
2041 if (nextKey.keytype != KeyInfo::isMain) {
2042 firstKey._dataStart = datastart;
2043 firstKey._dataEnd = nextKey._dataEnd+1;
2044 (void) li.setNextKey(nextkeyIdx);
2045 if (firstKey._tokensize > 0)
2046 li.setForDefaultLang(firstKey._tokensize);
2047 nextkeyIdx = li.process(os, firstKey);
2050 nextkeyIdx = li.process(os, nextKey);
2054 // Handle the remaining
2055 firstKey._dataStart = li.nextNotIgnored(firstKey._dataStart);
2056 firstKey._dataEnd = par.length();
2058 if ((firstKey._dataStart < firstKey._dataEnd) &&
2059 (par[firstKey._dataStart] != '}')) {
2060 if (firstKey._tokensize > 0)
2061 li.setForDefaultLang(firstKey._tokensize);
2062 (void) li.process(os, firstKey);
2066 // return string definitelly impossible to match
2067 s = "\\foreignlanguage{ignore}{ }";
2071 s = par; /* no known macros found */
2076 * Try to unify the language specs in the latexified text.
2077 * Resulting modified string is set to "", if
2078 * the searched tex does not contain all the features in the search pattern
2080 static string correctlanguagesetting(string par, bool isPatternString, bool withformat)
2082 static Features regex_f;
2083 static int missed = 0;
2084 static bool regex_with_format = false;
2086 int parlen = par.length();
2088 while ((parlen > 0) && (par[parlen-1] == '\n')) {
2093 // Split the latex input into pieces which
2094 // can be digested by our search engine
2095 LYXERR(Debug::FIND, "input: \"" << par << "\"");
2096 result = splitOnKnownMacros(par, isPatternString);
2097 LYXERR(Debug::FIND, "After split: \"" << result << "\"");
2100 result = par.substr(0, parlen);
2101 if (isPatternString) {
2104 regex_f = identifyFeatures(result);
2105 string features = "";
2106 for (auto it = regex_f.cbegin(); it != regex_f.cend(); ++it) {
2107 string a = it->first;
2108 regex_with_format = true;
2109 features += " " + a;
2110 // LYXERR0("Identified regex format:" << a);
2112 LYXERR(Debug::FIND, "Identified Features" << features);
2115 } else if (regex_with_format) {
2116 Features info = identifyFeatures(result);
2117 for (auto it = regex_f.cbegin(); it != regex_f.cend(); ++it) {
2118 string a = it->first;
2119 bool b = it->second;
2120 if (b && ! info[a]) {
2122 LYXERR(Debug::FIND, "Missed(" << missed << " " << a <<", srclen = " << parlen );
2128 // LYXERR0("No regex formats");
2134 // Remove trailing closure of math, macros and environments, so to catch parts of them.
2135 static int identifyClosing(string & t)
2137 int open_braces = 0;
2139 LYXERR(Debug::FIND, "identifyClosing(): t now is '" << t << "'");
2140 if (regex_replace(t, t, "(.*[^\\\\])\\$" REGEX_EOS, "$1"))
2142 if (regex_replace(t, t, "(.*[^\\\\]) \\\\\\]" REGEX_EOS, "$1"))
2144 if (regex_replace(t, t, "(.*[^\\\\]) \\\\end\\{[a-zA-Z_]*\\*?\\}" REGEX_EOS, "$1"))
2146 if (regex_replace(t, t, "(.*[^\\\\])\\}" REGEX_EOS, "$1")) {
2156 MatchStringAdv::MatchStringAdv(lyx::Buffer & buf, FindAndReplaceOptions const & opt)
2157 : p_buf(&buf), p_first_buf(&buf), opt(opt)
2159 Buffer & find_buf = *theBufferList().getBuffer(FileName(to_utf8(opt.find_buf_name)), true);
2160 docstring const & ds = stringifySearchBuffer(find_buf, opt);
2161 use_regexp = lyx::to_utf8(ds).find("\\regexp{") != std::string::npos;
2162 // When using regexp, braces are hacked already by escape_for_regex()
2163 par_as_string = normalize(ds, !use_regexp);
2165 close_wildcards = 0;
2167 size_t lead_size = 0;
2168 // correct the language settings
2169 par_as_string = correctlanguagesetting(par_as_string, true, !opt.ignoreformat);
2170 if (opt.ignoreformat) {
2172 // if par_as_string_nolead were emty,
2173 // the following call to findAux will always *find* the string
2174 // in the checked data, and thus always using the slow
2175 // examining of the current text part.
2176 par_as_string_nolead = par_as_string;
2179 lead_size = identifyLeading(par_as_string);
2180 LYXERR(Debug::FIND, "Lead_size: " << lead_size);
2181 lead_as_string = par_as_string.substr(0, lead_size);
2182 par_as_string_nolead = par_as_string.substr(lead_size, par_as_string.size() - lead_size);
2186 open_braces = identifyClosing(par_as_string);
2187 identifyClosing(par_as_string_nolead);
2188 LYXERR(Debug::FIND, "Open braces: " << open_braces);
2189 LYXERR(Debug::FIND, "Built MatchStringAdv object: par_as_string = '" << par_as_string << "'");
2191 string lead_as_regexp;
2192 if (lead_size > 0) {
2193 // @todo No need to search for \regexp{} insets in leading material
2194 lead_as_regexp = escape_for_regex(par_as_string.substr(0, lead_size), !opt.ignoreformat);
2195 par_as_string = par_as_string_nolead;
2196 LYXERR(Debug::FIND, "lead_as_regexp is '" << lead_as_regexp << "'");
2197 LYXERR(Debug::FIND, "par_as_string now is '" << par_as_string << "'");
2199 par_as_string = escape_for_regex(par_as_string, !opt.ignoreformat);
2200 // Insert (.*?) before trailing closure of math, macros and environments, so to catch parts of them.
2201 LYXERR(Debug::FIND, "par_as_string now is '" << par_as_string << "'");
2203 // Insert .* before trailing '\$' ('$' has been escaped by escape_for_regex)
2204 regex_replace(par_as_string, par_as_string, "(.*[^\\\\])(\\\\\\$)\\'", "$1(.*?)$2")
2205 // Insert .* before trailing '\\\]' ('\]' has been escaped by escape_for_regex)
2206 || regex_replace(par_as_string, par_as_string, "(.*[^\\\\])( \\\\\\\\\\\\\\])\\'", "$1(.*?)$2")
2207 // Insert .* before trailing '\\end\{...}' ('\end{...}' has been escaped by escape_for_regex)
2208 || regex_replace(par_as_string, par_as_string,
2209 "(.*[^\\\\])( \\\\\\\\end\\\\\\{[a-zA-Z_]*)(\\\\\\*)?(\\\\\\})\\'", "$1(.*?)$2$3$4")
2210 // Insert .* before trailing '\}' ('}' has been escaped by escape_for_regex)
2211 || regex_replace(par_as_string, par_as_string, "(.*[^\\\\])(\\\\\\})\\'", "$1(.*?)$2")
2215 if (!opt.ignoreformat) {
2216 // Remove extra '\}' at end
2217 while ( regex_replace(par_as_string, par_as_string, "(.*)\\\\}$", "$1")) {
2222 regex_replace(par_as_string, par_as_string, "\\\\\\.", "_xxbdotxx_");
2223 // handle '.' -> '[^]', replace later as '[^\}\{\\]'
2224 regex_replace(par_as_string, par_as_string, "\\.", "[^]");
2225 // replace '[^...]' with '[^...\}\{\\]'
2226 regex_replace(par_as_string, par_as_string, "\\[\\^([^\\\\\\]]*)\\]", "_xxbrlxx_$1\\}\\{\\\\_xxbrrxx_");
2227 regex_replace(par_as_string, par_as_string, "_xxbrlxx_", "[^");
2228 regex_replace(par_as_string, par_as_string, "_xxbrrxx_", "]");
2230 regex_replace(par_as_string, par_as_string, "_xxbdotxx_", "\\.");
2233 LYXERR(Debug::FIND, "par_as_string now is '" << par_as_string << "'");
2234 LYXERR(Debug::FIND, "Open braces: " << open_braces);
2235 LYXERR(Debug::FIND, "Close .*? : " << close_wildcards);
2236 LYXERR(Debug::FIND, "Replaced text (to be used as regex): " << par_as_string);
2238 // If entered regexp must match at begin of searched string buffer
2239 // Kornel: Added parentheses to use $1 for size of the leading string
2243 // TODO: Adapt '\[12345678]' in par_as_string to acount for the first '()
2244 // Unfortunately is '\1', '\2', etc not working for strings with extra format
2245 // so the convert has no effect in that case
2246 for (int i = 8; i > 0; --i) {
2247 string orig = "\\\\" + std::to_string(i);
2248 string dest = "\\" + std::to_string(i+1);
2249 while (regex_replace(par_as_string, par_as_string, orig, dest));
2251 regexp_str = "(" + lead_as_regexp + ")" + par_as_string;
2252 regexp2_str = "(" + lead_as_regexp + ").*" + par_as_string;
2254 LYXERR(Debug::FIND, "Setting regexp to : '" << regexp_str << "'");
2255 regexp = lyx::regex(regexp_str);
2257 LYXERR(Debug::FIND, "Setting regexp2 to: '" << regexp2_str << "'");
2258 regexp2 = lyx::regex(regexp2_str);
2263 // Count number of characters in string
2267 // \\[a-zA-Z]+ ==> 1
2268 static int computeSize(string s, int len)
2274 for (int i = 0; i < len; i += skip, count++) {
2277 if (isalpha(s[i+1])) {
2278 for (int j = 2; i+j < len; j++) {
2279 if (! isalpha(s[i+j])) {
2282 else if ((s[i+j] == '{') && s[i+j+1] == '}')
2290 else if (s[i] == '{') {
2296 else if (s[i] == '-') {
2297 if (s[i+1] == '-') {
2313 int MatchStringAdv::findAux(DocIterator const & cur, int len, bool at_begin) const
2316 (opt.restr == FindAndReplaceOptions::R_ONLY_MATHS && !cur.inMathed()) )
2319 docstring docstr = stringifyFromForSearch(opt, cur, len);
2320 string str = normalize(docstr, true);
2321 if (!opt.ignoreformat) {
2322 str = correctlanguagesetting(str, false, !opt.ignoreformat);
2324 if (str.empty()) return(-1);
2325 LYXERR(Debug::FIND, "Matching against '" << lyx::to_utf8(docstr) << "'");
2326 LYXERR(Debug::FIND, "After normalization: '" << str << "'");
2329 LYXERR(Debug::FIND, "Searching in regexp mode: at_begin=" << at_begin);
2330 regex const *p_regexp;
2331 regex_constants::match_flag_type flags;
2333 flags = regex_constants::match_continuous;
2336 flags = regex_constants::match_default;
2337 p_regexp = ®exp2;
2339 sregex_iterator re_it(str.begin(), str.end(), *p_regexp, flags);
2340 if (re_it == sregex_iterator())
2342 match_results<string::const_iterator> const & m = *re_it;
2344 if (0) { // Kornel Benko: DO NOT CHECKK
2345 // Check braces on the segment that matched the entire regexp expression,
2346 // plus the last subexpression, if a (.*?) was inserted in the constructor.
2347 if (!braces_match(m[0].first, m[0].second, open_braces))
2351 // Check braces on segments that matched all (.*?) subexpressions,
2352 // except the last "padding" one inserted by lyx.
2353 for (size_t i = 1; i < m.size() - 1; ++i)
2354 if (!braces_match(m[i].first, m[i].second, open_braces))
2357 // Exclude from the returned match length any length
2358 // due to close wildcards added at end of regexp
2359 // and also the length of the leading (e.g. '\emph{')
2361 // Whole found string, including the leading: m[0].second - m[0].first
2362 // Size of the leading string: m[1].second - m[1].first
2363 int leadingsize = 0;
2365 leadingsize = m[1].second - m[1].first;
2367 for (size_t i = 0; i < m.size(); i++) {
2368 LYXERR(Debug::FIND, "Match " << i << " is " << m[i].second - m[i].first << " long");
2370 if (close_wildcards == 0)
2371 result = m[0].second - m[0].first;
2374 result = m[m.size() - close_wildcards].first - m[0].first;
2376 size_t pos = m.position(0);
2377 // Ignore last closing characters
2378 while (result > 0) {
2379 if (str[pos+result-1] == '}')
2384 if (result > leadingsize)
2385 result -= leadingsize;
2388 return computeSize(str.substr(pos+leadingsize,result), result);
2391 // else !use_regexp: but all code paths above return
2392 LYXERR(Debug::FIND, "Searching in normal mode: par_as_string='"
2393 << par_as_string << "', str='" << str << "'");
2394 LYXERR(Debug::FIND, "Searching in normal mode: lead_as_string='"
2395 << lead_as_string << "', par_as_string_nolead='"
2396 << par_as_string_nolead << "'");
2399 LYXERR(Debug::FIND, "size=" << par_as_string.size()
2400 << ", substr='" << str.substr(0, par_as_string.size()) << "'");
2401 if (str.substr(0, par_as_string.size()) == par_as_string)
2402 return par_as_string.size();
2404 size_t pos = str.find(par_as_string_nolead);
2405 if (pos != string::npos)
2406 return par_as_string.size();
2412 int MatchStringAdv::operator()(DocIterator const & cur, int len, bool at_begin) const
2414 int res = findAux(cur, len, at_begin);
2416 "res=" << res << ", at_begin=" << at_begin
2417 << ", matchword=" << opt.matchword
2418 << ", inTexted=" << cur.inTexted());
2419 if (res == 0 || !at_begin || !opt.matchword || !cur.inTexted())
2421 Paragraph const & par = cur.paragraph();
2422 bool ws_left = (cur.pos() > 0)
2423 ? par.isWordSeparator(cur.pos() - 1)
2425 bool ws_right = (cur.pos() + res < par.size())
2426 ? par.isWordSeparator(cur.pos() + res)
2429 "cur.pos()=" << cur.pos() << ", res=" << res
2430 << ", separ: " << ws_left << ", " << ws_right
2432 if (ws_left && ws_right)
2438 string MatchStringAdv::normalize(docstring const & s, bool hack_braces) const
2441 if (! opt.casesensitive)
2442 t = lyx::to_utf8(lowercase(s));
2444 t = lyx::to_utf8(s);
2445 // Remove \n at begin
2446 while (!t.empty() && t[0] == '\n')
2449 while (!t.empty() && t[t.size() - 1] == '\n')
2450 t = t.substr(0, t.size() - 1);
2452 // Replace all other \n with spaces
2453 while ((pos = t.find("\n")) != string::npos)
2454 t.replace(pos, 1, " ");
2455 // Remove stale empty \emph{}, \textbf{} and similar blocks from latexify
2456 // Kornel: Added textsl, textsf, textit, texttt and noun
2457 // + allow to seach for colored text too
2458 LYXERR(Debug::FIND, "Removing stale empty \\emph{}, \\textbf{}, \\*section{} macros from: " << t);
2459 while (regex_replace(t, t, "\\\\(emph|noun|text(bf|sl|sf|it|tt)|(u|uu)line|(s|x)out|uwave)(\\{(\\{\\})?\\})+", ""))
2460 LYXERR(Debug::FIND, " further removing stale empty \\emph{}, \\textbf{} macros from: " << t);
2461 while (regex_replace(t, t, "\\\\((sub)?(((sub)?section)|paragraph)|part)\\*?(\\{(\\{\\})?\\})+", ""))
2462 LYXERR(Debug::FIND, " further removing stale empty \\emph{}, \\textbf{} macros from: " << t);
2464 while (regex_replace(t, t, "\\\\(foreignlanguage|textcolor|item)\\{[a-z]+\\}(\\{(\\{\\})?\\})+", ""));
2465 // FIXME - check what preceeds the brace
2467 if (opt.ignoreformat)
2468 while (regex_replace(t, t, "\\{", "_x_<")
2469 || regex_replace(t, t, "\\}", "_x_>"))
2470 LYXERR(Debug::FIND, "After {} replacement: '" << t << "'");
2472 while (regex_replace(t, t, "\\\\\\{", "_x_<")
2473 || regex_replace(t, t, "\\\\\\}", "_x_>"))
2474 LYXERR(Debug::FIND, "After {} replacement: '" << t << "'");
2481 docstring stringifyFromCursor(DocIterator const & cur, int len)
2483 LYXERR(Debug::FIND, "Stringifying with len=" << len << " from cursor at pos: " << cur);
2484 if (cur.inTexted()) {
2485 Paragraph const & par = cur.paragraph();
2486 // TODO what about searching beyond/across paragraph breaks ?
2487 // TODO Try adding a AS_STR_INSERTS as last arg
2488 pos_type end = ( len == -1 || cur.pos() + len > int(par.size()) ) ?
2489 int(par.size()) : cur.pos() + len;
2490 OutputParams runparams(&cur.buffer()->params().encoding());
2491 runparams.nice = true;
2492 runparams.flavor = OutputParams::LATEX;
2493 runparams.linelen = 100000; //lyxrc.plaintext_linelen;
2494 // No side effect of file copying and image conversion
2495 runparams.dryrun = true;
2496 LYXERR(Debug::FIND, "Stringifying with cur: "
2497 << cur << ", from pos: " << cur.pos() << ", end: " << end);
2498 return par.asString(cur.pos(), end,
2499 AS_STR_INSETS | AS_STR_SKIPDELETE | AS_STR_PLAINTEXT,
2501 } else if (cur.inMathed()) {
2502 CursorSlice cs = cur.top();
2503 MathData md = cs.cell();
2504 MathData::const_iterator it_end =
2505 (( len == -1 || cs.pos() + len > int(md.size()))
2507 : md.begin() + cs.pos() + len );
2509 for (MathData::const_iterator it = md.begin() + cs.pos();
2512 docstring s = asString(md2);
2513 LYXERR(Debug::FIND, "Stringified math: '" << s << "'");
2516 LYXERR(Debug::FIND, "Don't know how to stringify from here: " << cur);
2521 /** Computes the LaTeX export of buf starting from cur and ending len positions
2522 * after cur, if len is positive, or at the paragraph or innermost inset end
2525 docstring latexifyFromCursor(DocIterator const & cur, int len)
2527 LYXERR(Debug::FIND, "Latexifying with len=" << len << " from cursor at pos: " << cur);
2528 LYXERR(Debug::FIND, " with cur.lastpost=" << cur.lastpos() << ", cur.lastrow="
2529 << cur.lastrow() << ", cur.lastcol=" << cur.lastcol());
2530 Buffer const & buf = *cur.buffer();
2532 odocstringstream ods;
2534 OutputParams runparams(&buf.params().encoding());
2535 runparams.nice = false;
2536 runparams.flavor = OutputParams::LATEX;
2537 runparams.linelen = 8000; //lyxrc.plaintext_linelen;
2538 // No side effect of file copying and image conversion
2539 runparams.dryrun = true;
2540 runparams.for_search = true;
2542 if (cur.inTexted()) {
2543 // @TODO what about searching beyond/across paragraph breaks ?
2544 pos_type endpos = cur.paragraph().size();
2545 if (len != -1 && endpos > cur.pos() + len)
2546 endpos = cur.pos() + len;
2547 TeXOnePar(buf, *cur.innerText(), cur.pit(), os, runparams,
2548 string(), cur.pos(), endpos);
2549 string s = lyx::to_utf8(ods.str());
2550 LYXERR(Debug::FIND, "Latexified +modified text: '" << s << "'");
2551 return(lyx::from_utf8(s));
2552 } else if (cur.inMathed()) {
2553 // Retrieve the math environment type, and add '$' or '$[' or others (\begin{equation}) accordingly
2554 for (int s = cur.depth() - 1; s >= 0; --s) {
2555 CursorSlice const & cs = cur[s];
2556 if (cs.asInsetMath() && cs.asInsetMath()->asHullInset()) {
2558 cs.asInsetMath()->asHullInset()->header_write(ws);
2563 CursorSlice const & cs = cur.top();
2564 MathData md = cs.cell();
2565 MathData::const_iterator it_end =
2566 ((len == -1 || cs.pos() + len > int(md.size()))
2568 : md.begin() + cs.pos() + len);
2570 for (MathData::const_iterator it = md.begin() + cs.pos();
2574 ods << asString(md2);
2575 // Retrieve the math environment type, and add '$' or '$]'
2576 // or others (\end{equation}) accordingly
2577 for (int s = cur.depth() - 1; s >= 0; --s) {
2578 CursorSlice const & cs2 = cur[s];
2579 InsetMath * inset = cs2.asInsetMath();
2580 if (inset && inset->asHullInset()) {
2582 inset->asHullInset()->footer_write(ws);
2586 LYXERR(Debug::FIND, "Latexified math: '" << lyx::to_utf8(ods.str()) << "'");
2588 LYXERR(Debug::FIND, "Don't know how to stringify from here: " << cur);
2594 /** Finalize an advanced find operation, advancing the cursor to the innermost
2595 ** position that matches, plus computing the length of the matching text to
2598 int findAdvFinalize(DocIterator & cur, MatchStringAdv const & match)
2600 // Search the foremost position that matches (avoids find of entire math
2601 // inset when match at start of it)
2603 DocIterator old_cur(cur.buffer());
2605 LYXERR(Debug::FIND, "Forwarding one step (searching for innermost match)");
2609 } while (cur && cur.depth() > d && match(cur) > 0);
2611 if (match(cur) <= 0) return 0;
2612 LYXERR(Debug::FIND, "Ok");
2614 // Compute the match length
2616 if (cur.pos() + len > cur.lastpos())
2618 LYXERR(Debug::FIND, "verifying unmatch with len = " << len);
2619 while (cur.pos() + len <= cur.lastpos() && match(cur, len) <= 0) {
2621 LYXERR(Debug::FIND, "verifying unmatch with len = " << len);
2623 // Length of matched text (different from len param)
2624 int old_match = match(cur, len);
2627 int prev_old_match = old_match;
2631 if (match.opt.matchword)
2633 while (step == 20) {
2634 if (cur.pos() + len + step >= cur.lastpos()) {
2637 old_match = prev_old_match;
2640 new_match = match(cur, len + step);
2641 if (new_match > old_match) {
2642 prev_old_match = old_match;
2643 old_match = new_match;
2650 old_match = prev_old_match;
2654 // Greedy behaviour while matching regexps
2655 bool examining = true;
2658 // Kornel: The loop is needed, since it looks like
2659 // incrementing 'cur.pos()' does not always lead to the following
2660 // char which we could then match.
2662 if (match.opt.matchword)
2666 for (int count = 1; count < maxcnt; ++count) {
2667 if (cur.pos() + len + count > cur.lastpos()) {
2670 new_match = match(cur, len + count);
2671 if (new_match > old_match) {
2673 old_match = new_match;
2684 int findForwardAdv(DocIterator & cur, MatchStringAdv & match)
2688 while (!theApp()->longOperationCancelled() && cur) {
2689 LYXERR(Debug::FIND, "findForwardAdv() cur: " << cur);
2690 int match_len = match(cur, -1, false);
2691 LYXERR(Debug::FIND, "match_len: " << match_len);
2692 if (match_len > 0) {
2693 int match_len_zero_count = 0;
2694 for (; !theApp()->longOperationCancelled() && cur; cur.forwardPos()) {
2695 LYXERR(Debug::FIND, "Advancing cur: " << cur);
2696 int match_len2 = match(cur);
2697 LYXERR(Debug::FIND, "match_len2: " << match_len2);
2698 if (match_len2 > 0) {
2699 // Sometimes in finalize we understand it wasn't a match
2700 // and we need to continue the outest loop
2701 int len = findAdvFinalize(cur, match);
2706 if (match_len2 >= 0) {
2707 if (match_len2 == 0)
2708 match_len_zero_count++;
2710 match_len_zero_count = 0;
2713 if (++match_len_zero_count > 3) {
2714 LYXERR(Debug::FIND, "match_len2_zero_count: " << match_len_zero_count << ", match_len was " << match_len);
2715 match_len_zero_count = 0;
2723 if (match_len >= 0 && cur.pit() < cur.lastpit()) {
2724 LYXERR(Debug::FIND, "Advancing par: cur=" << cur);
2727 // This should exit nested insets, if any, or otherwise undefine the currsor.
2728 cur.pos() = cur.lastpos();
2729 LYXERR(Debug::FIND, "Advancing pos: cur=" << cur);
2737 /// Find the most backward consecutive match within same paragraph while searching backwards.
2738 int findMostBackwards(DocIterator & cur, MatchStringAdv const & match)
2740 DocIterator cur_begin = doc_iterator_begin(cur.buffer());
2741 DocIterator tmp_cur = cur;
2742 int len = findAdvFinalize(tmp_cur, match);
2743 Inset & inset = cur.inset();
2744 for (; cur != cur_begin; cur.backwardPos()) {
2745 LYXERR(Debug::FIND, "findMostBackwards(): cur=" << cur);
2746 DocIterator new_cur = cur;
2747 new_cur.backwardPos();
2748 if (new_cur == cur || &new_cur.inset() != &inset || !match(new_cur))
2750 int new_len = findAdvFinalize(new_cur, match);
2755 LYXERR(Debug::FIND, "findMostBackwards(): exiting with cur=" << cur);
2761 int findBackwardsAdv(DocIterator & cur, MatchStringAdv & match)
2765 // Backup of original position
2766 DocIterator cur_begin = doc_iterator_begin(cur.buffer());
2767 if (cur == cur_begin)
2770 DocIterator cur_orig(cur);
2771 bool pit_changed = false;
2774 bool found_match = match(cur, -1, false);
2778 cur.pos() = cur.lastpos();
2780 cur.pos() = cur_orig.pos();
2781 LYXERR(Debug::FIND, "findBackAdv2: cur: " << cur);
2782 DocIterator cur_prev_iter;
2784 found_match = match(cur);
2785 LYXERR(Debug::FIND, "findBackAdv3: found_match="
2786 << found_match << ", cur: " << cur);
2788 return findMostBackwards(cur, match);
2790 // Stop if begin of document reached
2791 if (cur == cur_begin)
2793 cur_prev_iter = cur;
2797 if (cur == cur_begin)
2804 } while (!theApp()->longOperationCancelled());
2812 docstring stringifyFromForSearch(FindAndReplaceOptions const & opt,
2813 DocIterator const & cur, int len)
2815 if (cur.pos() < 0 || cur.pos() > cur.lastpos())
2817 if (!opt.ignoreformat)
2818 return latexifyFromCursor(cur, len);
2820 return stringifyFromCursor(cur, len);
2824 FindAndReplaceOptions::FindAndReplaceOptions(
2825 docstring const & find_buf_name, bool casesensitive,
2826 bool matchword, bool forward, bool expandmacros, bool ignoreformat,
2827 docstring const & repl_buf_name, bool keep_case,
2828 SearchScope scope, SearchRestriction restr)
2829 : find_buf_name(find_buf_name), casesensitive(casesensitive), matchword(matchword),
2830 forward(forward), expandmacros(expandmacros), ignoreformat(ignoreformat),
2831 repl_buf_name(repl_buf_name), keep_case(keep_case), scope(scope), restr(restr)
2839 /** Check if 'len' letters following cursor are all non-lowercase */
2840 static bool allNonLowercase(Cursor const & cur, int len)
2842 pos_type beg_pos = cur.selectionBegin().pos();
2843 pos_type end_pos = cur.selectionBegin().pos() + len;
2844 if (len > cur.lastpos() + 1 - beg_pos) {
2845 LYXERR(Debug::FIND, "This should not happen, more debug needed");
2846 len = cur.lastpos() + 1 - beg_pos;
2847 end_pos = beg_pos + len;
2849 for (pos_type pos = beg_pos; pos != end_pos; ++pos)
2850 if (isLowerCase(cur.paragraph().getChar(pos)))
2856 /** Check if first letter is upper case and second one is lower case */
2857 static bool firstUppercase(Cursor const & cur)
2860 pos_type pos = cur.selectionBegin().pos();
2861 if (pos >= cur.lastpos() - 1) {
2862 LYXERR(Debug::FIND, "No upper-case at cur: " << cur);
2865 ch1 = cur.paragraph().getChar(pos);
2866 ch2 = cur.paragraph().getChar(pos + 1);
2867 bool result = isUpperCase(ch1) && isLowerCase(ch2);
2868 LYXERR(Debug::FIND, "firstUppercase(): "
2869 << "ch1=" << ch1 << "(" << char(ch1) << "), ch2="
2870 << ch2 << "(" << char(ch2) << ")"
2871 << ", result=" << result << ", cur=" << cur);
2876 /** Make first letter of supplied buffer upper-case, and the rest lower-case.
2878 ** \fixme What to do with possible further paragraphs in replace buffer ?
2880 static void changeFirstCase(Buffer & buffer, TextCase first_case, TextCase others_case)
2882 ParagraphList::iterator pit = buffer.paragraphs().begin();
2883 LASSERT(pit->size() >= 1, /**/);
2884 pos_type right = pos_type(1);
2885 pit->changeCase(buffer.params(), pos_type(0), right, first_case);
2886 right = pit->size();
2887 pit->changeCase(buffer.params(), pos_type(1), right, others_case);
2893 static void findAdvReplace(BufferView * bv, FindAndReplaceOptions const & opt, MatchStringAdv & matchAdv)
2895 Cursor & cur = bv->cursor();
2896 if (opt.repl_buf_name == docstring()
2897 || theBufferList().getBuffer(FileName(to_utf8(opt.repl_buf_name)), true) == 0
2898 || theBufferList().getBuffer(FileName(to_utf8(opt.find_buf_name)), true) == 0)
2901 DocIterator sel_beg = cur.selectionBegin();
2902 DocIterator sel_end = cur.selectionEnd();
2903 if (&sel_beg.inset() != &sel_end.inset()
2904 || sel_beg.pit() != sel_end.pit()
2905 || sel_beg.idx() != sel_end.idx())
2907 int sel_len = sel_end.pos() - sel_beg.pos();
2908 LYXERR(Debug::FIND, "sel_beg: " << sel_beg << ", sel_end: " << sel_end
2909 << ", sel_len: " << sel_len << endl);
2912 LASSERT(sel_len > 0, return);
2914 if (!matchAdv(sel_beg, sel_len))
2917 // Build a copy of the replace buffer, adapted to the KeepCase option
2918 Buffer & repl_buffer_orig = *theBufferList().getBuffer(FileName(to_utf8(opt.repl_buf_name)), true);
2920 repl_buffer_orig.write(oss);
2921 string lyx = oss.str();
2922 Buffer repl_buffer("", false);
2923 repl_buffer.setUnnamed(true);
2924 LASSERT(repl_buffer.readString(lyx), return);
2925 if (opt.keep_case && sel_len >= 2) {
2926 LYXERR(Debug::FIND, "keep_case true: cur.pos()=" << cur.pos() << ", sel_len=" << sel_len);
2927 if (cur.inTexted()) {
2928 if (firstUppercase(cur))
2929 changeFirstCase(repl_buffer, text_uppercase, text_lowercase);
2930 else if (allNonLowercase(cur, sel_len))
2931 changeFirstCase(repl_buffer, text_uppercase, text_uppercase);
2934 cap::cutSelection(cur, false);
2935 if (cur.inTexted()) {
2936 repl_buffer.changeLanguage(
2937 repl_buffer.language(),
2938 cur.getFont().language());
2939 LYXERR(Debug::FIND, "Replacing by pasteParagraphList()ing repl_buffer");
2940 LYXERR(Debug::FIND, "Before pasteParagraphList() cur=" << cur << endl);
2941 cap::pasteParagraphList(cur, repl_buffer.paragraphs(),
2942 repl_buffer.params().documentClassPtr(),
2943 bv->buffer().errorList("Paste"));
2944 LYXERR(Debug::FIND, "After pasteParagraphList() cur=" << cur << endl);
2945 sel_len = repl_buffer.paragraphs().begin()->size();
2946 } else if (cur.inMathed()) {
2947 odocstringstream ods;
2949 OutputParams runparams(&repl_buffer.params().encoding());
2950 runparams.nice = false;
2951 runparams.flavor = OutputParams::LATEX;
2952 runparams.linelen = 8000; //lyxrc.plaintext_linelen;
2953 runparams.dryrun = true;
2954 TeXOnePar(repl_buffer, repl_buffer.text(), 0, os, runparams);
2955 //repl_buffer.getSourceCode(ods, 0, repl_buffer.paragraphs().size(), false);
2956 docstring repl_latex = ods.str();
2957 LYXERR(Debug::FIND, "Latexified replace_buffer: '" << repl_latex << "'");
2959 (void)regex_replace(to_utf8(repl_latex), s, "\\$(.*)\\$", "$1");
2960 (void)regex_replace(s, s, "\\\\\\[(.*)\\\\\\]", "$1");
2961 repl_latex = from_utf8(s);
2962 LYXERR(Debug::FIND, "Replacing by insert()ing latex: '" << repl_latex << "' cur=" << cur << " with depth=" << cur.depth());
2963 MathData ar(cur.buffer());
2964 asArray(repl_latex, ar, Parse::NORMAL);
2966 sel_len = ar.size();
2967 LYXERR(Debug::FIND, "After insert() cur=" << cur << " with depth: " << cur.depth() << " and len: " << sel_len);
2969 if (cur.pos() >= sel_len)
2970 cur.pos() -= sel_len;
2973 LYXERR(Debug::FIND, "After pos adj cur=" << cur << " with depth: " << cur.depth() << " and len: " << sel_len);
2974 bv->putSelectionAt(DocIterator(cur), sel_len, !opt.forward);
2975 bv->processUpdateFlags(Update::Force);
2979 /// Perform a FindAdv operation.
2980 bool findAdv(BufferView * bv, FindAndReplaceOptions const & opt)
2985 // e.g., when invoking word-findadv from mini-buffer wither with
2986 // wrong options syntax or before ever opening advanced F&R pane
2987 if (theBufferList().getBuffer(FileName(to_utf8(opt.find_buf_name)), true) == 0)
2991 MatchStringAdv matchAdv(bv->buffer(), opt);
2992 int length = bv->cursor().selectionEnd().pos() - bv->cursor().selectionBegin().pos();
2994 bv->putSelectionAt(bv->cursor().selectionBegin(), length, !opt.forward);
2995 findAdvReplace(bv, opt, matchAdv);
2998 match_len = findForwardAdv(cur, matchAdv);
3000 match_len = findBackwardsAdv(cur, matchAdv);
3002 // This may only be raised by lyx::regex()
3003 bv->message(_("Invalid regular expression!"));
3007 if (match_len == 0) {
3008 bv->message(_("Match not found!"));
3012 bv->message(_("Match found!"));
3014 LYXERR(Debug::FIND, "Putting selection at cur=" << cur << " with len: " << match_len);
3015 bv->putSelectionAt(cur, match_len, !opt.forward);
3021 ostringstream & operator<<(ostringstream & os, FindAndReplaceOptions const & opt)
3023 os << to_utf8(opt.find_buf_name) << "\nEOSS\n"
3024 << opt.casesensitive << ' '
3025 << opt.matchword << ' '
3026 << opt.forward << ' '
3027 << opt.expandmacros << ' '
3028 << opt.ignoreformat << ' '
3029 << to_utf8(opt.repl_buf_name) << "\nEOSS\n"
3030 << opt.keep_case << ' '
3031 << int(opt.scope) << ' '
3034 LYXERR(Debug::FIND, "built: " << os.str());
3040 istringstream & operator>>(istringstream & is, FindAndReplaceOptions & opt)
3042 LYXERR(Debug::FIND, "parsing");
3046 while (line != "EOSS") {
3050 if (is.eof()) // Tolerate malformed request
3054 LYXERR(Debug::FIND, "file_buf_name: '" << s << "'");
3055 opt.find_buf_name = from_utf8(s);
3056 is >> opt.casesensitive >> opt.matchword >> opt.forward >> opt.expandmacros >> opt.ignoreformat;
3057 is.get(); // Waste space before replace string
3060 while (line != "EOSS") {
3064 if (is.eof()) // Tolerate malformed request
3068 LYXERR(Debug::FIND, "repl_buf_name: '" << s << "'");
3069 opt.repl_buf_name = from_utf8(s);
3070 is >> opt.keep_case;
3073 opt.scope = FindAndReplaceOptions::SearchScope(i);
3075 opt.restr = FindAndReplaceOptions::SearchRestriction(i);
3077 LYXERR(Debug::FIND, "parsed: " << opt.casesensitive << ' ' << opt.matchword << ' ' << opt.forward << ' '
3078 << opt.expandmacros << ' ' << opt.ignoreformat << ' ' << opt.keep_case << ' '
3079 << opt.scope << ' ' << opt.restr);