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 "\\\\(((footnotesize|tiny|scriptsize|small|large|Large|LARGE|huge|Huge|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("^(((footnotesize|tiny|scriptsize|small|large|Large|LARGE|huge|Huge|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]+{"
1013 /* Char type with content discarded
1014 * like \hspace{1cm} */
1016 /* Char, like \backslash */
1018 /* \part, \section*, ... */
1020 /* \foreignlanguage{ngerman}, ... */
1022 /* inside \code{} or \footnote{}
1023 * to discard language in content */
1026 /* \begin{eqnarray}...\end{eqnarray}, ... $...$ */
1028 /* fonts, colors, markups, ... */
1030 /* footnotesize, ... large, ...
1031 * Ignore all of them */
1034 /* inputencoding, shortcut, ...
1035 * Discard also content, because they do not help in search */
1039 /* tex, latex, ... like isChar */
1041 /* like \lettrine[lines=5]{}{} */
1052 parenthesiscount(1),
1056 KeyInfo(KeyType type, int parcount, bool disable)
1062 parenthesiscount(parcount),
1071 int parenthesiscount;
1073 bool used; /* by pattern */
1078 Border(int l=0, int u=0) : low(l), upper(u) {};
1083 #define MAXOPENED 30
1085 bool isPatternString;
1087 explicit Intervall(bool isPattern) :
1088 isPatternString(isPattern),
1090 actualdeptindex(0) { depts[0] = 0; closes[0] = 0;};
1093 int depts[MAXOPENED];
1094 int closes[MAXOPENED];
1095 int actualdeptindex;
1096 Border borders[2*MAXOPENED];
1097 // int previousNotIgnored(int);
1098 int nextNotIgnored(int);
1099 void handleOpenP(int i);
1100 void handleCloseP(int i, bool closingAllowed);
1101 void resetOpenedP(int openPos);
1102 void addIntervall(int upper);
1103 void addIntervall(int low, int upper); /* if explicit */
1104 void setForDefaultLang(int upTo);
1105 int findclosing(int start, int end, char up, char down);
1106 void handleParentheses(int lastpos, bool closingAllowed);
1107 void output(ostringstream &os, int lastpos);
1108 // string show(int lastpos);
1111 void Intervall::setForDefaultLang(int upTo)
1113 // Enable the use of first token again
1114 if (ignoreidx >= 0) {
1115 if (borders[0].low < upTo)
1116 borders[0].low = upTo;
1117 if (borders[0].upper < upTo)
1118 borders[0].upper = upTo;
1122 static void checkDepthIndex(int val)
1124 static int maxdepthidx = MAXOPENED-2;
1125 if (val > maxdepthidx) {
1127 LYXERR0("maxdepthidx now " << val);
1131 static void checkIgnoreIdx(int val)
1133 static int maxignoreidx = 2*MAXOPENED - 4;
1134 if (val > maxignoreidx) {
1136 LYXERR0("maxignoreidx now " << val);
1141 * Expand the region of ignored parts of the input latex string
1142 * The region is only relevant in output()
1144 void Intervall::addIntervall(int low, int upper)
1147 if (low == upper) return;
1148 for (idx = ignoreidx+1; idx > 0; --idx) {
1149 if (low > borders[idx-1].upper) {
1153 Border br(low, upper);
1154 if (idx > ignoreidx) {
1157 checkIgnoreIdx(ignoreidx);
1161 // Expand only if one of the new bound is inside the interwall
1162 // We know here that br.low > borders[idx-1].upper
1163 if (br.upper < borders[idx].low) {
1164 // We have to insert at this pos
1165 for (int i = ignoreidx+1; i > idx; --i) {
1166 borders[i] = borders[i-1];
1170 checkIgnoreIdx(ignoreidx);
1173 // Here we know, that we are overlapping
1174 if (br.low > borders[idx].low)
1175 br.low = borders[idx].low;
1176 // check what has to be concatenated
1178 for (int i = idx; i <= ignoreidx; i++) {
1179 if (br.upper >= borders[i].low) {
1181 if (br.upper < borders[i].upper)
1182 br.upper = borders[i].upper;
1188 // count should be >= 1 here
1191 for (int i = idx + count; i <= ignoreidx; i++) {
1192 borders[i-count+1] = borders[i];
1194 ignoreidx -= count - 1;
1200 void Intervall::handleOpenP(int i)
1203 depts[actualdeptindex] = i+1;
1204 closes[actualdeptindex] = -1;
1205 checkDepthIndex(actualdeptindex);
1208 void Intervall::handleCloseP(int i, bool closingAllowed)
1210 if (actualdeptindex <= 0) {
1211 if (! closingAllowed)
1212 LYXERR(Debug::FIND, "Bad closing parenthesis in latex"); /* should not happen, but the latex input may be wrong */
1213 // if we are at the very end
1214 addIntervall(i, i+1);
1217 closes[actualdeptindex] = i+1;
1222 void Intervall::resetOpenedP(int openPos)
1224 // Used as initializer for foreignlanguage entry
1225 actualdeptindex = 1;
1226 depts[1] = openPos+1;
1231 int Intervall::previousNotIgnored(int start)
1233 int idx = 0; /* int intervalls */
1234 for (idx = ignoreidx; idx >= 0; --idx) {
1235 if (start > borders[idx].upper)
1237 if (start >= borders[idx].low)
1238 start = borders[idx].low-1;
1244 int Intervall::nextNotIgnored(int start)
1246 int idx = 0; /* int intervalls */
1247 for (idx = 0; idx <= ignoreidx; idx++) {
1248 if (start < borders[idx].low)
1250 if (start < borders[idx].upper)
1251 start = borders[idx].upper;
1256 typedef map<string, KeyInfo> KeysMap;
1257 typedef vector< KeyInfo> Entries;
1258 static KeysMap keys = map<string, KeyInfo>();
1265 void buildKeys(bool);
1266 void buildEntries(bool);
1267 void makeKey(const string &, KeyInfo, bool isPatternString);
1268 void processRegion(int start, int region_end); /* remove {} parts */
1269 void removeHead(KeyInfo&, int count=0);
1272 LatexInfo(string par, bool isPatternString) : entidx(-1), interval(isPatternString) {
1274 buildKeys(isPatternString);
1275 entries = vector<KeyInfo>();
1276 buildEntries(isPatternString);
1280 if (entries.empty()) {
1287 if (int(entries.size()) > entidx) {
1294 bool setNextKey(int idx) {
1295 if ((idx == entidx) && (entidx >= 0)) {
1302 int process(ostringstream &os, KeyInfo &actual);
1303 int dispatch(ostringstream &os, int previousStart, KeyInfo &actual);
1304 // string show(int lastpos) { return interval.show(lastpos);};
1305 int nextNotIgnored(int start) { return interval.nextNotIgnored(start);};
1306 KeyInfo &getKeyInfo(int keyinfo) {
1307 static KeyInfo invalidInfo = KeyInfo();
1308 if ((keyinfo < 0) || ( keyinfo >= int(entries.size())))
1311 return entries[keyinfo];
1313 void setForDefaultLang(int upTo) {interval.setForDefaultLang(upTo);};
1314 void addIntervall(int low, int up) { interval.addIntervall(low, up); };
1318 int Intervall::findclosing(int start, int end, char up = '{', char down = '}')
1322 for (int i = start; i < end; i += 1 + skip) {
1326 if (c == '\\') skip = 1;
1330 else if (c == down) {
1331 if (depth == 0) return i;
1347 vector<MathEntry> entries;
1352 void insert(string wait, size_t start, size_t end) {
1353 MathEntry m = MathEntry();
1355 m.mathStart = start;
1357 m.mathSize = end - start;
1358 entries.push_back(m);
1360 bool empty() { return entries.empty(); };
1361 size_t getEndPos() {
1362 if (entries.empty() || (actualIdx >= entries.size())) {
1365 return entries[actualIdx].mathEnd;
1367 size_t getStartPos() {
1368 if (entries.empty() || (actualIdx >= entries.size())) {
1369 return 100000; /* definitely enough? */
1371 return entries[actualIdx].mathStart;
1373 size_t getFirstPos() {
1375 return getStartPos();
1378 if (entries.empty() || (actualIdx >= entries.size())) {
1381 return entries[actualIdx].mathSize;
1383 void incrEntry() { actualIdx++; };
1386 void LatexInfo::buildEntries(bool isPatternString)
1388 static regex const rmath("\\$|\\\\\\[|\\\\\\]|\\\\(begin|end)\\{((eqnarray|equation|flalign|gather|multline|align|alignat)\\*?)\\}");
1389 static regex const rkeys("\\$|\\\\\\[|\\\\\\]|\\\\((([a-zA-Z]+\\*?)(\\{([a-z]+\\*?)\\}|=[0-9]+[a-z]+)?))");
1390 static bool disableLanguageOverride = false;
1391 smatch sub, submath;
1392 bool evaluatingRegexp = false;
1394 bool evaluatingMath = false;
1395 bool evaluatingCode = false;
1399 bool math_end_waiting = false;
1400 size_t math_pos = 10000;
1403 for (sregex_iterator itmath(interval.par.begin(), interval.par.end(), rmath), end; itmath != end; ++itmath) {
1405 if (math_end_waiting) {
1406 size_t pos = submath.position(size_t(0));
1407 if ((math_end == "$") &&
1408 (submath.str(0) == "$") &&
1409 (interval.par[pos-1] != '\\')) {
1410 mi.insert("$", math_pos, pos + 1);
1411 math_end_waiting = false;
1413 else if ((math_end == "\\]") &&
1414 (submath.str(0) == "\\]")) {
1415 mi.insert("\\]", math_pos, pos + 2);
1416 math_end_waiting = false;
1418 else if ((submath.str(1).compare("end") == 0) &&
1419 (submath.str(2).compare(math_end) == 0)) {
1420 mi.insert(math_end, math_pos, pos + submath.str(0).length());
1421 math_end_waiting = false;
1427 if (submath.str(1).compare("begin") == 0) {
1428 math_end_waiting = true;
1429 math_end = submath.str(2);
1430 math_pos = submath.position(size_t(0));
1432 else if (submath.str(0).compare("\\[") == 0) {
1433 math_end_waiting = true;
1435 math_pos = submath.position(size_t(0));
1437 else if (submath.str(0) == "$") {
1438 size_t pos = submath.position(size_t(0));
1439 if ((pos == 0) || (interval.par[pos-1] != '\\')) {
1440 math_end_waiting = true;
1447 // Ignore language if there is math somewhere in pattern-string
1448 if (isPatternString) {
1451 keys["foreignlanguage"].disabled = true;
1452 disableLanguageOverride = true;
1455 disableLanguageOverride = false;
1458 if (disableLanguageOverride) {
1459 keys["foreignlanguage"].disabled = true;
1462 math_pos = mi.getFirstPos();
1463 for (sregex_iterator it(interval.par.begin(), interval.par.end(), rkeys), end; it != end; ++it) {
1465 string key = sub.str(3);
1467 if (sub.str(0)[0] == '\\')
1468 key = sub.str(0)[1];
1472 size_t k_pos = sub.position(size_t(0));
1473 if ((k_pos > 0) && (interval.par[k_pos - 1] == '\\')) {
1474 // Escaped '$', ignoring
1480 if (evaluatingRegexp) {
1481 if (sub.str(1).compare("endregexp") == 0) {
1482 evaluatingRegexp = false;
1483 // found._tokenstart already set
1484 found._dataEnd = sub.position(size_t(0)) + 13;
1485 found._dataStart = found._dataEnd;
1486 found._tokensize = found._dataEnd - found._tokenstart;
1487 found.parenthesiscount = 0;
1491 if (evaluatingMath) {
1492 if (size_t(sub.position(size_t(0))) < mi.getEndPos())
1494 evaluatingMath = false;
1496 math_pos = mi.getStartPos();
1498 if (keys.find(key) == keys.end()) {
1499 LYXERR(Debug::FIND, "Found unknown key " << sub.str(0));
1503 if (key.compare("regexp") == 0) {
1504 evaluatingRegexp = true;
1505 found._tokenstart = sub.position(size_t(0));
1506 found._tokensize = 0;
1510 // Handle the other params of key
1511 if (found.keytype == KeyInfo::isIgnored)
1513 else if (found.keytype == KeyInfo::isMath) {
1514 if (size_t(sub.position(size_t(0))) == math_pos) {
1516 found._tokenstart = sub.position(size_t(0));
1517 found._tokensize = mi.getSize();
1518 found._dataEnd = found._tokenstart + found._tokensize;
1519 found._dataStart = found._dataEnd;
1520 found.parenthesiscount = 0;
1521 evaluatingMath = true;
1524 // begin|end of unknown env, discard
1525 // First handle tables
1526 // longtable|tabular
1527 bool discardComment;
1528 if ((sub.str(5).compare("longtable") == 0) ||
1529 (sub.str(5).compare("tabular") == 0)) {
1530 discardComment = true; /* '%' */
1533 discardComment = false;
1535 // discard spaces before pos(0)
1536 int pos = sub.position(size_t(0));
1538 for (count = 0; pos - count > 0; count++) {
1539 char c = interval.par[pos-count-1];
1540 if (discardComment) {
1541 if ((c != ' ') && (c != '%'))
1547 found.keytype = KeyInfo::doRemove;
1548 found._tokenstart = pos - count;
1549 if (sub.str(1).compare(0, 5, "begin") == 0) {
1550 size_t pos1 = pos + sub.str(0).length();
1551 if (sub.str(5).compare("cjk") == 0) {
1552 pos1 = interval.findclosing(pos1+1, interval.par.length()) + 1;
1553 if ((interval.par[pos1] == '{') && (interval.par[pos1+1] == '}'))
1555 found.keytype = KeyInfo::isMain;
1556 found._dataStart = pos1;
1557 found._dataEnd = interval.par.length();
1558 found.disabled = keys["foreignlanguage"].disabled;
1559 found.used = keys["foreignlanguage"].used;
1560 found._tokensize = pos1 - found._tokenstart;
1561 found.head = interval.par.substr(found._tokenstart, found._tokensize);
1564 if (interval.par[pos1] == '[') {
1565 pos1 = interval.findclosing(pos1+1, interval.par.length(), '[', ']')+1;
1567 if (interval.par[pos1] == '{') {
1568 found._dataEnd = interval.findclosing(pos1+1, interval.par.length()) + 1;
1571 found._dataEnd = pos1;
1573 found._dataStart = found._dataEnd;
1574 found._tokensize = count + found._dataEnd - pos;
1575 found.parenthesiscount = 0;
1576 found.disabled = true;
1580 // Handle "\end{...}"
1581 found._dataStart = pos + sub.str(0).length();
1582 found._dataEnd = found._dataStart;
1583 found._tokensize = count + found._dataEnd - pos;
1584 found.parenthesiscount = 0;
1585 found.disabled = true;
1589 else if (found.keytype != KeyInfo::isRegex) {
1590 found._tokenstart = sub.position(size_t(0));
1591 if (found.parenthesiscount == 0) {
1592 // Probably to be discarded
1593 size_t following_pos = sub.position(size_t(0)) + sub.str(3).length() + 1;
1594 char following = interval.par[following_pos];
1595 if (following == ' ')
1596 found.head = "\\" + sub.str(3) + " ";
1597 else if (following == '=') {
1598 // like \uldepth=1000pt
1599 found.head = sub.str(0);
1602 found.head = "\\" + key;
1603 found._tokensize = found.head.length();
1604 found._dataEnd = found._tokenstart + found._tokensize;
1605 found._dataStart = found._dataEnd;
1608 if (found.parenthesiscount == 1) {
1609 found.head = "\\" + key + "{";
1611 else if (found.parenthesiscount == 2) {
1612 found.head = sub.str(0) + "{";
1614 found._tokensize = found.head.length();
1615 found._dataStart = found._tokenstart + found.head.length();
1616 size_t endpos = interval.findclosing(found._dataStart, interval.par.length());
1617 if (found.keytype == KeyInfo::noMain) {
1618 evaluatingCode = true;
1620 codeStart = found._dataStart;
1622 else if (evaluatingCode) {
1623 if (size_t(found._dataStart) > codeEnd)
1624 evaluatingCode = false;
1625 else if (found.keytype == KeyInfo::isMain) {
1626 // Disable this key, treate it as standard
1627 found.keytype = KeyInfo::isStandard;
1628 found.disabled = true;
1629 if ((codeEnd == interval.par.length()) &&
1630 (found._tokenstart == codeStart)) {
1631 // trickery, because the code inset starts
1632 // with \selectlanguage ...
1634 if (entries.size() > 1) {
1635 entries[entries.size()-1]._dataEnd = codeEnd;
1640 if ((endpos == interval.par.length()) &&
1641 (found.keytype == KeyInfo::doRemove)) {
1642 // Missing closing => error in latex-input?
1643 // therefore do not delete remaining data
1644 found._dataStart -= 1;
1645 found._dataEnd = found._dataStart;
1648 found._dataEnd = endpos;
1650 if (isPatternString) {
1651 keys[key].used = true;
1654 entries.push_back(found);
1658 void LatexInfo::makeKey(const string &keysstring, KeyInfo keyI, bool isPatternString)
1660 stringstream s(keysstring);
1662 const char delim = '|';
1663 while (getline(s, key, delim)) {
1664 KeyInfo keyII(keyI);
1665 if (isPatternString) {
1668 else if ( !keys[key].used)
1669 keyII.disabled = true;
1674 void LatexInfo::buildKeys(bool isPatternString)
1677 static bool keysBuilt = false;
1678 if (keysBuilt && !isPatternString) return;
1680 // Known standard keys with 1 parameter.
1681 // Split is done, if not at start of region
1682 makeKey("textsf|textss|texttt", KeyInfo(KeyInfo::isStandard, 1, ignoreFormats.getFamily()), isPatternString);
1683 makeKey("textbf", KeyInfo(KeyInfo::isStandard, 1, ignoreFormats.getSeries()), isPatternString);
1684 makeKey("textit|textsc|textsl", KeyInfo(KeyInfo::isStandard, 1, ignoreFormats.getShape()), isPatternString);
1685 makeKey("uuline|uline|uwave", KeyInfo(KeyInfo::isStandard, 1, ignoreFormats.getUnderline()), isPatternString);
1686 makeKey("emph|noun", KeyInfo(KeyInfo::isStandard, 1, ignoreFormats.getMarkUp()), isPatternString);
1687 makeKey("sout|xout", KeyInfo(KeyInfo::isStandard, 1, ignoreFormats.getStrikeOut()), isPatternString);
1689 makeKey("section|subsection|subsubsection|paragraph|subparagraph|minisec",
1690 KeyInfo(KeyInfo::isSectioning, 1, ignoreFormats.getSectioning()), isPatternString);
1691 makeKey("section*|subsection*|subsubsection*|paragraph*",
1692 KeyInfo(KeyInfo::isSectioning, 1, ignoreFormats.getSectioning()), isPatternString);
1693 makeKey("part|part*|chapter|chapter*", KeyInfo(KeyInfo::isSectioning, 1, ignoreFormats.getSectioning()), isPatternString);
1694 makeKey("title|subtitle|author|subject|publishers|dedication|uppertitleback|lowertitleback|extratitle|lyxaddress|lyxrightaddress", KeyInfo(KeyInfo::isSectioning, 1, ignoreFormats.getFrontMatter()), isPatternString);
1696 makeKey("regexp", KeyInfo(KeyInfo::isRegex, 1, false), isPatternString);
1698 // Split is done, if not at start of region
1699 makeKey("textcolor", KeyInfo(KeyInfo::isStandard, 2, ignoreFormats.getColor()), isPatternString);
1701 // Split is done always.
1702 makeKey("foreignlanguage", KeyInfo(KeyInfo::isMain, 2, ignoreFormats.getLanguage()), isPatternString);
1706 makeKey("backslash|textbackslash|slash", KeyInfo(KeyInfo::isChar, 0, false), isPatternString);
1707 makeKey("textasciicircum|textasciitilde", KeyInfo(KeyInfo::isChar, 0, false), isPatternString);
1708 makeKey("textasciiacute", KeyInfo(KeyInfo::isChar, 0, false), isPatternString);
1709 makeKey("dots|ldots", KeyInfo(KeyInfo::isChar, 0, false), isPatternString);
1711 makeKey("quad|qquad|hfill|dotfill", KeyInfo(KeyInfo::isChar, 0, false), isPatternString);
1712 makeKey("textvisiblespace|nobreakspace", KeyInfo(KeyInfo::isChar, 0, false), isPatternString);
1713 makeKey("negthickspace|negmedspace|negthinspace", KeyInfo(KeyInfo::isChar, 0, false), isPatternString);
1715 makeKey("enskip|smallskip|medskip|bigskip|vfill", KeyInfo(KeyInfo::isChar, 0, false), isPatternString);
1716 // Custom space/skip, remove the content (== length value)
1717 makeKey("vspace|hspace|mspace", KeyInfo(KeyInfo::noContent, 1, false), isPatternString);
1718 // Found in fr/UserGuide.lyx
1719 makeKey("og|fg", KeyInfo(KeyInfo::isChar, 0, false), isPatternString);
1721 makeKey("textquotedbl|quotesinglbase|lyxarrow", KeyInfo(KeyInfo::isChar, 0, false), isPatternString);
1722 makeKey("textquotedblleft|textquotedblright", KeyInfo(KeyInfo::isChar, 0, false), isPatternString);
1723 // Known macros to remove (including their parameter)
1725 makeKey("inputencoding|shortcut|label|ref|index", KeyInfo(KeyInfo::doRemove, 1, false), isPatternString);
1727 // handle like standard keys with 1 parameter.
1728 makeKey("url|href|vref|thanks", KeyInfo(KeyInfo::isStandard, 1, false), isPatternString);
1730 // Macros to remove, but let the parameter survive
1732 makeKey("menuitem|textmd|textrm", KeyInfo(KeyInfo::isStandard, 1, true), isPatternString);
1734 // Remove language spec from content of these insets
1735 makeKey("code|footnote", KeyInfo(KeyInfo::noMain, 1, false), isPatternString);
1737 // Same effect as previous, parameter will survive (because there is no one anyway)
1739 makeKey("noindent|textcompwordmark", KeyInfo(KeyInfo::isStandard, 0, true), isPatternString);
1740 // Remove table decorations
1741 makeKey("hline|tabularnewline|toprule|bottomrule|midrule", KeyInfo(KeyInfo::doRemove, 0, true), isPatternString);
1742 // Discard shape-header
1743 makeKey("circlepar|diamondpar|heartpar|nutpar", KeyInfo(KeyInfo::isStandard, 1, true), isPatternString);
1744 makeKey("trianglerightpar|hexagonpar|starpar", KeyInfo(KeyInfo::isStandard, 1, true), isPatternString);
1745 makeKey("triangleuppar|triangledownpar|droppar", KeyInfo(KeyInfo::isStandard, 1, true), isPatternString);
1746 makeKey("triangleleftpar|shapepar|dropuppar", KeyInfo(KeyInfo::isStandard, 1, true), isPatternString);
1747 // like ('tiny{}' or '\tiny ' ... )
1748 makeKey("footnotesize|tiny|scriptsize|small|large|Large|LARGE|huge|Huge", KeyInfo(KeyInfo::isSize, 0, false), isPatternString);
1750 // Survives, like known character
1751 makeKey("lyx|latex|latexe|tex", KeyInfo(KeyInfo::isIgnored, 0, false), isPatternString);
1752 makeKey("item", KeyInfo(KeyInfo::isList, 1, false), isPatternString);
1754 makeKey("begin|end", KeyInfo(KeyInfo::isMath, 1, false), isPatternString);
1755 makeKey("[|]", KeyInfo(KeyInfo::isMath, 1, false), isPatternString);
1756 makeKey("$", KeyInfo(KeyInfo::isMath, 1, false), isPatternString);
1758 makeKey("par|uldepth|ULdepth|protect|nobreakdash", KeyInfo(KeyInfo::isStandard, 0, true), isPatternString);
1759 // Remove RTL/LTR marker
1760 makeKey("l|r|textlr|textfr|textar|beginl|endl", KeyInfo(KeyInfo::isStandard, 0, true), isPatternString);
1761 makeKey("lettrine", KeyInfo(KeyInfo::cleanToStart, 0, true), isPatternString);
1762 makeKey("endarguments", KeyInfo(KeyInfo::endArguments, 0, true), isPatternString);
1763 if (isPatternString) {
1764 // Allow the first searched string to rebuild the keys too
1768 // no need to rebuild again
1774 * Keep the list of actual opened parentheses actual
1775 * (e.g. depth == 4 means there are 4 '{' not processed yet)
1777 void Intervall::handleParentheses(int lastpos, bool closingAllowed)
1780 for (int i = depts[actualdeptindex]; i < lastpos; i+= 1 + skip) {
1784 if (c == '\\') skip = 1;
1785 else if (c == '{') {
1788 else if (c == '}') {
1789 handleCloseP(i, closingAllowed);
1795 string Intervall::show(int lastpos)
1797 int idx = 0; /* int intervalls */
1801 for (idx = 0; idx <= ignoreidx; idx++) {
1802 while (i < lastpos) {
1804 if (i <= borders[idx].low) {
1805 if (borders[idx].low > lastpos)
1806 printsize = lastpos - i;
1808 printsize = borders[idx].low - i;
1809 s += par.substr(i, printsize);
1811 if (i >= borders[idx].low)
1812 i = borders[idx].upper;
1815 i = borders[idx].upper;
1821 s += par.substr(i, lastpos-i);
1827 void Intervall::output(ostringstream &os, int lastpos)
1829 // get number of chars to output
1830 int idx = 0; /* int intervalls */
1832 for (idx = 0; idx <= ignoreidx; idx++) {
1834 if (i <= borders[idx].low) {
1836 if (borders[idx].low > lastpos)
1837 printsize = lastpos - i;
1839 printsize = borders[idx].low - i;
1840 os << par.substr(i, printsize);
1842 handleParentheses(i, false);
1843 if (i >= borders[idx].low)
1844 i = borders[idx].upper;
1847 i = borders[idx].upper;
1854 os << par.substr(i, lastpos-i);
1856 handleParentheses(lastpos, false);
1857 for (int i = actualdeptindex; i > 0; --i) {
1860 if (! isPatternString)
1862 handleParentheses(lastpos, true); /* extra closings '}' allowed here */
1865 void LatexInfo::processRegion(int start, int region_end)
1867 while (start < region_end) { /* Let {[} and {]} survive */
1868 if ((interval.par[start] == '{') &&
1869 (interval.par[start+1] != ']') &&
1870 (interval.par[start+1] != '[')) {
1871 // Closing is allowed past the region
1872 int closing = interval.findclosing(start+1, interval.par.length());
1873 interval.addIntervall(start, start+1);
1874 interval.addIntervall(closing, closing+1);
1876 start = interval.nextNotIgnored(start+1);
1880 void LatexInfo::removeHead(KeyInfo &actual, int count)
1882 if (actual.parenthesiscount == 0) {
1883 // "{\tiny{} ...}" ==> "{{} ...}"
1884 interval.addIntervall(actual._tokenstart-count, actual._tokenstart + actual._tokensize);
1887 // Remove header hull, that is "\url{abcd}" ==> "abcd"
1888 interval.addIntervall(actual._tokenstart, actual._dataStart);
1889 interval.addIntervall(actual._dataEnd, actual._dataEnd+1);
1893 int LatexInfo::dispatch(ostringstream &os, int previousStart, KeyInfo &actual)
1896 switch (actual.keytype)
1898 case KeyInfo::cleanToStart: {
1899 actual._dataEnd = actual._dataStart;
1900 if (interval.par[actual._dataStart] == '[') {
1901 // Discard optional params
1902 actual._dataStart = interval.findclosing(actual._dataStart+1, interval.par.length(), '[', ']') + 1;
1904 actual._dataEnd = actual._dataStart;
1905 nextKeyIdx = getNextKey();
1906 // Search for end of arguments
1907 int tmpIdx = nextKeyIdx;
1908 while (tmpIdx > 0) {
1909 KeyInfo &nextk = entries[tmpIdx];
1910 if (nextk.keytype == KeyInfo::endArguments) {
1911 actual._dataEnd = nextk._dataEnd;
1914 nextk.disabled = true;
1916 if (tmpIdx >= int(entries.size()))
1919 while (interval.par[actual._dataEnd] == ' ')
1921 interval.addIntervall(0, actual._dataEnd+1);
1922 interval.actualdeptindex = 0;
1923 interval.depts[0] = actual._dataEnd+1;
1924 interval.closes[0] = -1;
1927 case KeyInfo::noContent: { /* char like "\hspace{2cm}" */
1928 interval.addIntervall(actual._dataStart, actual._dataEnd);
1931 case KeyInfo::isChar: {
1932 nextKeyIdx = getNextKey();
1935 case KeyInfo::isSize: {
1936 if (actual.disabled || (interval.par[actual._dataStart] != '{') || (interval.par[actual._dataStart-1] == ' ')) {
1937 processRegion(actual._dataEnd, actual._dataEnd+1); /* remove possibly following {} */
1938 interval.addIntervall(actual._tokenstart, actual._dataEnd+1);
1939 nextKeyIdx = getNextKey();
1941 // Here _dataStart points to '{', so correct it
1942 actual._dataStart += 1;
1943 actual._tokensize += 1;
1944 actual.parenthesiscount = 1;
1945 if (interval.par[actual._dataStart] == '}') {
1946 // Determine the end if used like '{\tiny{}...}'
1947 actual._dataEnd = interval.findclosing(actual._dataStart+1, interval.par.length()) + 1;
1948 interval.addIntervall(actual._dataStart, actual._dataStart+1);
1951 // Determine the end if used like '\tiny{...}'
1952 actual._dataEnd = interval.findclosing(actual._dataStart, interval.par.length()) + 1;
1954 // Split on this key if not at start
1955 int start = interval.nextNotIgnored(previousStart);
1956 if (start < actual._tokenstart) {
1957 interval.output(os, actual._tokenstart);
1958 interval.addIntervall(start, actual._tokenstart);
1960 // discard entry if at end of actual
1961 nextKeyIdx = process(os, actual);
1965 case KeyInfo::endArguments:
1967 processRegion(actual._dataStart, actual._dataStart+1);
1968 nextKeyIdx = getNextKey();
1970 case KeyInfo::noMain:
1972 case KeyInfo::isStandard: {
1973 if (actual.disabled) {
1975 processRegion(actual._dataStart, actual._dataStart+1);
1976 nextKeyIdx = getNextKey();
1978 // Split on this key if not at start
1979 int start = interval.nextNotIgnored(previousStart);
1980 if (start < actual._tokenstart) {
1981 interval.output(os, actual._tokenstart);
1982 interval.addIntervall(start, actual._tokenstart);
1984 // discard entry if at end of actual
1985 nextKeyIdx = process(os, actual);
1989 case KeyInfo::doRemove: {
1990 // Remove the key with all parameters and following spaces
1992 for (pos = actual._dataEnd+1; pos < interval.par.length(); pos++) {
1993 if ((interval.par[pos] != ' ') && (interval.par[pos] != '%'))
1996 interval.addIntervall(actual._tokenstart, pos);
1997 nextKeyIdx = getNextKey();
2000 case KeyInfo::isList: {
2001 // Discard space before _tokenstart
2003 for (count = 0; count < actual._tokenstart; count++) {
2004 if (interval.par[actual._tokenstart-count-1] != ' ')
2007 if (actual.disabled) {
2008 interval.addIntervall(actual._tokenstart-count, actual._dataEnd+1);
2011 interval.addIntervall(actual._tokenstart-count, actual._tokenstart);
2013 // Discard extra parentheses '[]'
2014 if (interval.par[actual._dataEnd+1] == '[') {
2015 int posdown = interval.findclosing(actual._dataEnd+2, interval.par.length(), '[', ']');
2016 if ((interval.par[actual._dataEnd+2] == '{') &&
2017 (interval.par[posdown-1] == '}')) {
2018 interval.addIntervall(actual._dataEnd+1,actual._dataEnd+3);
2019 interval.addIntervall(posdown-1, posdown+1);
2022 interval.addIntervall(actual._dataEnd+1, actual._dataEnd+2);
2023 interval.addIntervall(posdown, posdown+1);
2025 int blk = interval.nextNotIgnored(actual._dataEnd+1);
2026 if (blk > posdown) {
2027 // Discard at most 1 space after empty item
2029 for (count = 0; count < 1; count++) {
2030 if (interval.par[blk+count] != ' ')
2034 interval.addIntervall(blk, blk+count);
2037 nextKeyIdx = getNextKey();
2040 case KeyInfo::isSectioning: {
2041 // Discard spaces before _tokenstart
2043 for (count = 0; count < actual._tokenstart; count++) {
2044 if (interval.par[actual._tokenstart-count-1] != ' ')
2047 if (actual.disabled) {
2048 removeHead(actual, count);
2049 nextKeyIdx = getNextKey();
2051 interval.addIntervall(actual._tokenstart-count, actual._tokenstart);
2052 nextKeyIdx = process(os, actual);
2056 case KeyInfo::isMath: {
2057 // Same as regex, use the content unchanged
2058 nextKeyIdx = getNextKey();
2061 case KeyInfo::isRegex: {
2062 // DO NOT SPLIT ON REGEX
2064 nextKeyIdx = getNextKey();
2067 case KeyInfo::isIgnored: {
2068 // Treat like a character for now
2069 nextKeyIdx = getNextKey();
2072 case KeyInfo::isMain: {
2073 if (interval.par.substr(actual._dataStart, 2) == "% ")
2074 interval.addIntervall(actual._dataStart, actual._dataStart+2);
2075 if (actual.disabled) {
2077 if ((interval.par.substr(actual._dataStart, 3) == " \\[") ||
2078 (interval.par.substr(actual._dataStart, 8) == " \\begin{")) {
2079 // Discard also the space before math-equation
2080 interval.addIntervall(actual._dataStart, actual._dataStart+1);
2082 interval.resetOpenedP(actual._dataStart-1);
2085 if (actual._tokenstart == 0) {
2086 // for the first (and maybe dummy) language
2087 interval.setForDefaultLang(actual._tokenstart + actual._tokensize);
2089 interval.resetOpenedP(actual._dataStart-1);
2093 case KeyInfo::invalid:
2094 // This cannot happen, already handled
2097 // LYXERR0("Unhandled keytype");
2098 nextKeyIdx = getNextKey();
2105 int LatexInfo::process(ostringstream &os, KeyInfo &actual )
2107 int end = interval.nextNotIgnored(actual._dataEnd);
2108 int oldStart = actual._dataStart;
2109 int nextKeyIdx = getNextKey();
2111 if ((nextKeyIdx < 0) ||
2112 (entries[nextKeyIdx]._tokenstart >= actual._dataEnd) ||
2113 (entries[nextKeyIdx].keytype == KeyInfo::invalid)) {
2114 if (oldStart <= end) {
2115 processRegion(oldStart, end);
2120 KeyInfo &nextKey = getKeyInfo(nextKeyIdx);
2122 if (nextKey.keytype == KeyInfo::isMain) {
2123 (void) dispatch(os, actual._dataStart, nextKey);
2124 end = nextKey._tokenstart;
2127 processRegion(oldStart, nextKey._tokenstart);
2128 nextKeyIdx = dispatch(os, actual._dataStart, nextKey);
2130 oldStart = nextKey._dataEnd+1;
2132 // now nextKey is either invalid or is outside of actual._dataEnd
2133 // output the remaining and discard myself
2134 if (oldStart <= end) {
2135 processRegion(oldStart, end);
2137 if (interval.par[end] == '}') {
2139 // This is the normal case.
2140 // But if using the firstlanguage, the closing may be missing
2142 // get minimum of 'end' and 'actual._dataEnd' in case that the nextKey.keytype was 'KeyInfo::isMain'
2144 if (actual._dataEnd < end)
2145 output_end = interval.nextNotIgnored(actual._dataEnd);
2147 output_end = interval.nextNotIgnored(end);
2148 if ((actual.keytype == KeyInfo::isMain) && actual.disabled) {
2149 interval.addIntervall(actual._tokenstart, actual._tokenstart+actual._tokensize);
2151 // Remove possible empty data
2152 int dstart = interval.nextNotIgnored(actual._dataStart);
2153 while ((dstart < output_end) && (interval.par[dstart] == '{')) {
2154 interval.addIntervall(dstart, dstart+1);
2155 int dend = interval.findclosing(dstart+1, output_end);
2156 interval.addIntervall(dend, dend+1);
2157 dstart = interval.nextNotIgnored(dstart+1);
2159 if (dstart < output_end)
2160 interval.output(os, output_end);
2161 interval.addIntervall(actual._tokenstart, end);
2165 string splitOnKnownMacros(string par, bool isPatternString) {
2167 LatexInfo li(par, isPatternString);
2168 KeyInfo DummyKey = KeyInfo(KeyInfo::KeyType::isMain, 2, true);
2170 DummyKey._tokensize = 0;
2171 DummyKey._tokenstart = 0;
2172 DummyKey._dataStart = 0;
2173 DummyKey._dataEnd = par.length();
2174 DummyKey.disabled = true;
2175 int firstkeyIdx = li.getFirstKey();
2177 if (firstkeyIdx >= 0) {
2178 KeyInfo firstKey = li.getKeyInfo(firstkeyIdx);
2180 if ((firstKey.keytype != KeyInfo::isMain) || firstKey.disabled) {
2181 // Use dummy firstKey
2182 firstKey = DummyKey;
2183 (void) li.setNextKey(firstkeyIdx);
2186 if (par.substr(firstKey._dataStart, 2) == "% ")
2187 li.addIntervall(firstKey._dataStart, firstKey._dataStart+2);
2189 nextkeyIdx = li.process(os, firstKey);
2190 while (nextkeyIdx >= 0) {
2191 // Check for a possible gap between the last
2192 // entry and this one
2193 int datastart = li.nextNotIgnored(firstKey._dataStart);
2194 KeyInfo &nextKey = li.getKeyInfo(nextkeyIdx);
2195 if ((nextKey._tokenstart > datastart)) {
2197 firstKey._dataStart = datastart;
2198 firstKey._dataEnd = par.length();
2199 (void) li.setNextKey(nextkeyIdx);
2200 if (firstKey._tokensize > 0) {
2201 // Fake the last opened parenthesis
2202 li.setForDefaultLang(firstKey._tokensize);
2204 nextkeyIdx = li.process(os, firstKey);
2207 if (nextKey.keytype != KeyInfo::isMain) {
2208 firstKey._dataStart = datastart;
2209 firstKey._dataEnd = nextKey._dataEnd+1;
2210 (void) li.setNextKey(nextkeyIdx);
2211 if (firstKey._tokensize > 0)
2212 li.setForDefaultLang(firstKey._tokensize);
2213 nextkeyIdx = li.process(os, firstKey);
2216 nextkeyIdx = li.process(os, nextKey);
2220 // Handle the remaining
2221 firstKey._dataStart = li.nextNotIgnored(firstKey._dataStart);
2222 firstKey._dataEnd = par.length();
2224 if ((firstKey._dataStart < firstKey._dataEnd) &&
2225 (par[firstKey._dataStart] != '}')) {
2226 if (firstKey._tokensize > 0)
2227 li.setForDefaultLang(firstKey._tokensize);
2228 (void) li.process(os, firstKey);
2232 // return string definitelly impossible to match
2233 s = "\\foreignlanguage{ignore}{ }";
2237 s = par; /* no known macros found */
2242 * Try to unify the language specs in the latexified text.
2243 * Resulting modified string is set to "", if
2244 * the searched tex does not contain all the features in the search pattern
2246 static string correctlanguagesetting(string par, bool isPatternString, bool withformat)
2248 static Features regex_f;
2249 static int missed = 0;
2250 static bool regex_with_format = false;
2252 int parlen = par.length();
2254 while ((parlen > 0) && (par[parlen-1] == '\n')) {
2259 // Split the latex input into pieces which
2260 // can be digested by our search engine
2261 LYXERR(Debug::FIND, "input: \"" << par << "\"");
2262 result = splitOnKnownMacros(par, isPatternString);
2263 LYXERR(Debug::FIND, "After split: \"" << result << "\"");
2266 result = par.substr(0, parlen);
2267 if (isPatternString) {
2270 regex_f = identifyFeatures(result);
2271 string features = "";
2272 for (auto it = regex_f.cbegin(); it != regex_f.cend(); ++it) {
2273 string a = it->first;
2274 regex_with_format = true;
2275 features += " " + a;
2276 // LYXERR0("Identified regex format:" << a);
2278 LYXERR(Debug::FIND, "Identified Features" << features);
2281 } else if (regex_with_format) {
2282 Features info = identifyFeatures(result);
2283 for (auto it = regex_f.cbegin(); it != regex_f.cend(); ++it) {
2284 string a = it->first;
2285 bool b = it->second;
2286 if (b && ! info[a]) {
2288 LYXERR(Debug::FIND, "Missed(" << missed << " " << a <<", srclen = " << parlen );
2294 // LYXERR0("No regex formats");
2300 // Remove trailing closure of math, macros and environments, so to catch parts of them.
2301 static int identifyClosing(string & t)
2303 int open_braces = 0;
2305 LYXERR(Debug::FIND, "identifyClosing(): t now is '" << t << "'");
2306 if (regex_replace(t, t, "(.*[^\\\\])\\$" REGEX_EOS, "$1"))
2308 if (regex_replace(t, t, "(.*[^\\\\]) \\\\\\]" REGEX_EOS, "$1"))
2310 if (regex_replace(t, t, "(.*[^\\\\]) \\\\end\\{[a-zA-Z_]*\\*?\\}" REGEX_EOS, "$1"))
2312 if (regex_replace(t, t, "(.*[^\\\\])\\}" REGEX_EOS, "$1")) {
2322 MatchStringAdv::MatchStringAdv(lyx::Buffer & buf, FindAndReplaceOptions const & opt)
2323 : p_buf(&buf), p_first_buf(&buf), opt(opt)
2325 Buffer & find_buf = *theBufferList().getBuffer(FileName(to_utf8(opt.find_buf_name)), true);
2326 docstring const & ds = stringifySearchBuffer(find_buf, opt);
2327 use_regexp = lyx::to_utf8(ds).find("\\regexp{") != std::string::npos;
2328 // When using regexp, braces are hacked already by escape_for_regex()
2329 par_as_string = normalize(ds, !use_regexp);
2331 close_wildcards = 0;
2333 size_t lead_size = 0;
2334 // correct the language settings
2335 par_as_string = correctlanguagesetting(par_as_string, true, !opt.ignoreformat);
2336 if (opt.ignoreformat) {
2338 // if par_as_string_nolead were emty,
2339 // the following call to findAux will always *find* the string
2340 // in the checked data, and thus always using the slow
2341 // examining of the current text part.
2342 par_as_string_nolead = par_as_string;
2345 lead_size = identifyLeading(par_as_string);
2346 LYXERR(Debug::FIND, "Lead_size: " << lead_size);
2347 lead_as_string = par_as_string.substr(0, lead_size);
2348 par_as_string_nolead = par_as_string.substr(lead_size, par_as_string.size() - lead_size);
2352 open_braces = identifyClosing(par_as_string);
2353 identifyClosing(par_as_string_nolead);
2354 LYXERR(Debug::FIND, "Open braces: " << open_braces);
2355 LYXERR(Debug::FIND, "Built MatchStringAdv object: par_as_string = '" << par_as_string << "'");
2357 string lead_as_regexp;
2358 if (lead_size > 0) {
2359 // @todo No need to search for \regexp{} insets in leading material
2360 lead_as_regexp = escape_for_regex(par_as_string.substr(0, lead_size), !opt.ignoreformat);
2361 par_as_string = par_as_string_nolead;
2362 LYXERR(Debug::FIND, "lead_as_regexp is '" << lead_as_regexp << "'");
2363 LYXERR(Debug::FIND, "par_as_string now is '" << par_as_string << "'");
2365 par_as_string = escape_for_regex(par_as_string, !opt.ignoreformat);
2366 // Insert (.*?) before trailing closure of math, macros and environments, so to catch parts of them.
2367 LYXERR(Debug::FIND, "par_as_string now is '" << par_as_string << "'");
2369 // Insert .* before trailing '\$' ('$' has been escaped by escape_for_regex)
2370 regex_replace(par_as_string, par_as_string, "(.*[^\\\\])(\\\\\\$)\\'", "$1(.*?)$2")
2371 // Insert .* before trailing '\\\]' ('\]' has been escaped by escape_for_regex)
2372 || regex_replace(par_as_string, par_as_string, "(.*[^\\\\])( \\\\\\\\\\\\\\])\\'", "$1(.*?)$2")
2373 // Insert .* before trailing '\\end\{...}' ('\end{...}' has been escaped by escape_for_regex)
2374 || regex_replace(par_as_string, par_as_string,
2375 "(.*[^\\\\])( \\\\\\\\end\\\\\\{[a-zA-Z_]*)(\\\\\\*)?(\\\\\\})\\'", "$1(.*?)$2$3$4")
2376 // Insert .* before trailing '\}' ('}' has been escaped by escape_for_regex)
2377 || regex_replace(par_as_string, par_as_string, "(.*[^\\\\])(\\\\\\})\\'", "$1(.*?)$2")
2381 if (!opt.ignoreformat) {
2382 // Remove extra '\}' at end
2383 while ( regex_replace(par_as_string, par_as_string, "(.*)\\\\}$", "$1")) {
2388 regex_replace(par_as_string, par_as_string, "\\\\\\.", "_xxbdotxx_");
2389 // handle '.' -> '[^]', replace later as '[^\}\{\\]'
2390 regex_replace(par_as_string, par_as_string, "\\.", "[^]");
2391 // replace '[^...]' with '[^...\}\{\\]'
2392 regex_replace(par_as_string, par_as_string, "\\[\\^([^\\\\\\]]*)\\]", "_xxbrlxx_$1\\}\\{\\\\_xxbrrxx_");
2393 regex_replace(par_as_string, par_as_string, "_xxbrlxx_", "[^");
2394 regex_replace(par_as_string, par_as_string, "_xxbrrxx_", "]");
2396 regex_replace(par_as_string, par_as_string, "_xxbdotxx_", "\\.");
2399 LYXERR(Debug::FIND, "par_as_string now is '" << par_as_string << "'");
2400 LYXERR(Debug::FIND, "Open braces: " << open_braces);
2401 LYXERR(Debug::FIND, "Close .*? : " << close_wildcards);
2402 LYXERR(Debug::FIND, "Replaced text (to be used as regex): " << par_as_string);
2404 // If entered regexp must match at begin of searched string buffer
2405 // Kornel: Added parentheses to use $1 for size of the leading string
2409 // TODO: Adapt '\[12345678]' in par_as_string to acount for the first '()
2410 // Unfortunately is '\1', '\2', etc not working for strings with extra format
2411 // so the convert has no effect in that case
2412 for (int i = 8; i > 0; --i) {
2413 string orig = "\\\\" + std::to_string(i);
2414 string dest = "\\" + std::to_string(i+1);
2415 while (regex_replace(par_as_string, par_as_string, orig, dest));
2417 regexp_str = "(" + lead_as_regexp + ")" + par_as_string;
2418 regexp2_str = "(" + lead_as_regexp + ").*" + par_as_string;
2420 LYXERR(Debug::FIND, "Setting regexp to : '" << regexp_str << "'");
2421 regexp = lyx::regex(regexp_str);
2423 LYXERR(Debug::FIND, "Setting regexp2 to: '" << regexp2_str << "'");
2424 regexp2 = lyx::regex(regexp2_str);
2429 // Count number of characters in string
2433 // \\[a-zA-Z]+ ==> 1
2434 static int computeSize(string s, int len)
2440 for (int i = 0; i < len; i += skip, count++) {
2443 if (isalpha(s[i+1])) {
2444 for (int j = 2; i+j < len; j++) {
2445 if (! isalpha(s[i+j])) {
2448 else if ((s[i+j] == '{') && s[i+j+1] == '}')
2450 else if ((s[i+j] == '{') && (i + j + 1 >= len))
2458 else if (s[i] == '{') {
2464 else if (s[i] == '-') {
2465 if (s[i+1] == '-') {
2481 int MatchStringAdv::findAux(DocIterator const & cur, int len, bool at_begin) const
2484 (opt.restr == FindAndReplaceOptions::R_ONLY_MATHS && !cur.inMathed()) )
2487 docstring docstr = stringifyFromForSearch(opt, cur, len);
2488 string str = normalize(docstr, true);
2489 if (!opt.ignoreformat) {
2490 str = correctlanguagesetting(str, false, !opt.ignoreformat);
2492 if (str.empty()) return(-1);
2493 LYXERR(Debug::FIND, "Matching against '" << lyx::to_utf8(docstr) << "'");
2494 LYXERR(Debug::FIND, "After normalization: '" << str << "'");
2497 LYXERR(Debug::FIND, "Searching in regexp mode: at_begin=" << at_begin);
2498 regex const *p_regexp;
2499 regex_constants::match_flag_type flags;
2501 flags = regex_constants::match_continuous;
2504 flags = regex_constants::match_default;
2505 p_regexp = ®exp2;
2507 sregex_iterator re_it(str.begin(), str.end(), *p_regexp, flags);
2508 if (re_it == sregex_iterator())
2510 match_results<string::const_iterator> const & m = *re_it;
2512 if (0) { // Kornel Benko: DO NOT CHECKK
2513 // Check braces on the segment that matched the entire regexp expression,
2514 // plus the last subexpression, if a (.*?) was inserted in the constructor.
2515 if (!braces_match(m[0].first, m[0].second, open_braces))
2519 // Check braces on segments that matched all (.*?) subexpressions,
2520 // except the last "padding" one inserted by lyx.
2521 for (size_t i = 1; i < m.size() - 1; ++i)
2522 if (!braces_match(m[i].first, m[i].second, open_braces))
2525 // Exclude from the returned match length any length
2526 // due to close wildcards added at end of regexp
2527 // and also the length of the leading (e.g. '\emph{')
2529 // Whole found string, including the leading: m[0].second - m[0].first
2530 // Size of the leading string: m[1].second - m[1].first
2531 int leadingsize = 0;
2533 leadingsize = m[1].second - m[1].first;
2535 for (size_t i = 0; i < m.size(); i++) {
2536 LYXERR(Debug::FIND, "Match " << i << " is " << m[i].second - m[i].first << " long");
2538 if (close_wildcards == 0)
2539 result = m[0].second - m[0].first;
2542 result = m[m.size() - close_wildcards].first - m[0].first;
2544 size_t pos = m.position(size_t(0));
2545 // Ignore last closing characters
2546 while (result > 0) {
2547 if (str[pos+result-1] == '}')
2552 if (result > leadingsize)
2553 result -= leadingsize;
2556 return computeSize(str.substr(pos+leadingsize,result), result);
2559 // else !use_regexp: but all code paths above return
2560 LYXERR(Debug::FIND, "Searching in normal mode: par_as_string='"
2561 << par_as_string << "', str='" << str << "'");
2562 LYXERR(Debug::FIND, "Searching in normal mode: lead_as_string='"
2563 << lead_as_string << "', par_as_string_nolead='"
2564 << par_as_string_nolead << "'");
2567 LYXERR(Debug::FIND, "size=" << par_as_string.size()
2568 << ", substr='" << str.substr(0, par_as_string.size()) << "'");
2569 if (str.substr(0, par_as_string.size()) == par_as_string)
2570 return par_as_string.size();
2572 size_t pos = str.find(par_as_string_nolead);
2573 if (pos != string::npos)
2574 return par_as_string.size();
2580 int MatchStringAdv::operator()(DocIterator const & cur, int len, bool at_begin) const
2582 int res = findAux(cur, len, at_begin);
2584 "res=" << res << ", at_begin=" << at_begin
2585 << ", matchword=" << opt.matchword
2586 << ", inTexted=" << cur.inTexted());
2587 if (res == 0 || !at_begin || !opt.matchword || !cur.inTexted())
2589 if ((len > 0) && (res < len))
2591 Paragraph const & par = cur.paragraph();
2592 bool ws_left = (cur.pos() > 0)
2593 ? par.isWordSeparator(cur.pos() - 1)
2595 bool ws_right = (cur.pos() + len < par.size())
2596 ? par.isWordSeparator(cur.pos() + len)
2599 "cur.pos()=" << cur.pos() << ", res=" << res
2600 << ", separ: " << ws_left << ", " << ws_right
2603 if (ws_left && ws_right) {
2604 // Check for word separators inside the found 'word'
2605 for (int i = 0; i < len; i++) {
2606 if (par.isWordSeparator(cur.pos() + i))
2615 string MatchStringAdv::normalize(docstring const & s, bool hack_braces) const
2618 if (! opt.casesensitive)
2619 t = lyx::to_utf8(lowercase(s));
2621 t = lyx::to_utf8(s);
2622 // Remove \n at begin
2623 while (!t.empty() && t[0] == '\n')
2626 while (!t.empty() && t[t.size() - 1] == '\n')
2627 t = t.substr(0, t.size() - 1);
2629 // Replace all other \n with spaces
2630 while ((pos = t.find("\n")) != string::npos)
2631 t.replace(pos, 1, " ");
2632 // Remove stale empty \emph{}, \textbf{} and similar blocks from latexify
2633 // Kornel: Added textsl, textsf, textit, texttt and noun
2634 // + allow to seach for colored text too
2635 LYXERR(Debug::FIND, "Removing stale empty \\emph{}, \\textbf{}, \\*section{} macros from: " << t);
2636 while (regex_replace(t, t, "\\\\(emph|noun|text(bf|sl|sf|it|tt)|(u|uu)line|(s|x)out|uwave)(\\{(\\{\\})?\\})+", ""))
2637 LYXERR(Debug::FIND, " further removing stale empty \\emph{}, \\textbf{} macros from: " << t);
2638 while (regex_replace(t, t, "\\\\((sub)?(((sub)?section)|paragraph)|part)\\*?(\\{(\\{\\})?\\})+", ""))
2639 LYXERR(Debug::FIND, " further removing stale empty \\emph{}, \\textbf{} macros from: " << t);
2641 while (regex_replace(t, t, "\\\\(foreignlanguage|textcolor|item)\\{[a-z]+\\}(\\{(\\{\\})?\\})+", ""));
2642 // FIXME - check what preceeds the brace
2644 if (opt.ignoreformat)
2645 while (regex_replace(t, t, "\\{", "_x_<")
2646 || regex_replace(t, t, "\\}", "_x_>"))
2647 LYXERR(Debug::FIND, "After {} replacement: '" << t << "'");
2649 while (regex_replace(t, t, "\\\\\\{", "_x_<")
2650 || regex_replace(t, t, "\\\\\\}", "_x_>"))
2651 LYXERR(Debug::FIND, "After {} replacement: '" << t << "'");
2658 docstring stringifyFromCursor(DocIterator const & cur, int len)
2660 LYXERR(Debug::FIND, "Stringifying with len=" << len << " from cursor at pos: " << cur);
2661 if (cur.inTexted()) {
2662 Paragraph const & par = cur.paragraph();
2663 // TODO what about searching beyond/across paragraph breaks ?
2664 // TODO Try adding a AS_STR_INSERTS as last arg
2665 pos_type end = ( len == -1 || cur.pos() + len > int(par.size()) ) ?
2666 int(par.size()) : cur.pos() + len;
2667 OutputParams runparams(&cur.buffer()->params().encoding());
2668 runparams.nice = true;
2669 runparams.flavor = OutputParams::LATEX;
2670 runparams.linelen = 100000; //lyxrc.plaintext_linelen;
2671 // No side effect of file copying and image conversion
2672 runparams.dryrun = true;
2673 LYXERR(Debug::FIND, "Stringifying with cur: "
2674 << cur << ", from pos: " << cur.pos() << ", end: " << end);
2675 return par.asString(cur.pos(), end,
2676 AS_STR_INSETS | AS_STR_SKIPDELETE | AS_STR_PLAINTEXT,
2678 } else if (cur.inMathed()) {
2679 CursorSlice cs = cur.top();
2680 MathData md = cs.cell();
2681 MathData::const_iterator it_end =
2682 (( len == -1 || cs.pos() + len > int(md.size()))
2684 : md.begin() + cs.pos() + len );
2686 for (MathData::const_iterator it = md.begin() + cs.pos();
2689 docstring s = asString(md2);
2690 LYXERR(Debug::FIND, "Stringified math: '" << s << "'");
2693 LYXERR(Debug::FIND, "Don't know how to stringify from here: " << cur);
2698 /** Computes the LaTeX export of buf starting from cur and ending len positions
2699 * after cur, if len is positive, or at the paragraph or innermost inset end
2702 docstring latexifyFromCursor(DocIterator const & cur, int len)
2704 LYXERR(Debug::FIND, "Latexifying with len=" << len << " from cursor at pos: " << cur);
2705 LYXERR(Debug::FIND, " with cur.lastpost=" << cur.lastpos() << ", cur.lastrow="
2706 << cur.lastrow() << ", cur.lastcol=" << cur.lastcol());
2707 Buffer const & buf = *cur.buffer();
2709 odocstringstream ods;
2711 OutputParams runparams(&buf.params().encoding());
2712 runparams.nice = false;
2713 runparams.flavor = OutputParams::LATEX;
2714 runparams.linelen = 8000; //lyxrc.plaintext_linelen;
2715 // No side effect of file copying and image conversion
2716 runparams.dryrun = true;
2717 runparams.for_search = true;
2719 if (cur.inTexted()) {
2720 // @TODO what about searching beyond/across paragraph breaks ?
2721 pos_type endpos = cur.paragraph().size();
2722 if (len != -1 && endpos > cur.pos() + len)
2723 endpos = cur.pos() + len;
2724 TeXOnePar(buf, *cur.innerText(), cur.pit(), os, runparams,
2725 string(), cur.pos(), endpos);
2726 string s = lyx::to_utf8(ods.str());
2727 LYXERR(Debug::FIND, "Latexified +modified text: '" << s << "'");
2728 return(lyx::from_utf8(s));
2729 } else if (cur.inMathed()) {
2730 // Retrieve the math environment type, and add '$' or '$[' or others (\begin{equation}) accordingly
2731 for (int s = cur.depth() - 1; s >= 0; --s) {
2732 CursorSlice const & cs = cur[s];
2733 if (cs.asInsetMath() && cs.asInsetMath()->asHullInset()) {
2735 cs.asInsetMath()->asHullInset()->header_write(ws);
2740 CursorSlice const & cs = cur.top();
2741 MathData md = cs.cell();
2742 MathData::const_iterator it_end =
2743 ((len == -1 || cs.pos() + len > int(md.size()))
2745 : md.begin() + cs.pos() + len);
2747 for (MathData::const_iterator it = md.begin() + cs.pos();
2751 ods << asString(md2);
2752 // Retrieve the math environment type, and add '$' or '$]'
2753 // or others (\end{equation}) accordingly
2754 for (int s = cur.depth() - 1; s >= 0; --s) {
2755 CursorSlice const & cs2 = cur[s];
2756 InsetMath * inset = cs2.asInsetMath();
2757 if (inset && inset->asHullInset()) {
2759 inset->asHullInset()->footer_write(ws);
2763 LYXERR(Debug::FIND, "Latexified math: '" << lyx::to_utf8(ods.str()) << "'");
2765 LYXERR(Debug::FIND, "Don't know how to stringify from here: " << cur);
2771 /** Finalize an advanced find operation, advancing the cursor to the innermost
2772 ** position that matches, plus computing the length of the matching text to
2775 int findAdvFinalize(DocIterator & cur, MatchStringAdv const & match)
2777 // Search the foremost position that matches (avoids find of entire math
2778 // inset when match at start of it)
2780 DocIterator old_cur(cur.buffer());
2782 LYXERR(Debug::FIND, "Forwarding one step (searching for innermost match)");
2786 } while (cur && cur.depth() > d && match(cur) > 0);
2788 int max_match = match(cur); /* match valid only if not searching whole words */
2789 if (max_match <= 0) return 0;
2790 LYXERR(Debug::FIND, "Ok");
2792 // Compute the match length
2794 if (cur.pos() + len > cur.lastpos())
2796 if (match.opt.matchword) {
2797 LYXERR(Debug::FIND, "verifying unmatch with len = " << len);
2798 while (cur.pos() + len <= cur.lastpos() && match(cur, len) <= 0) {
2800 LYXERR(Debug::FIND, "verifying unmatch with len = " << len);
2802 // Length of matched text (different from len param)
2803 int old_match = match(cur, len);
2807 // Greedy behaviour while matching regexps
2808 while ((new_match = match(cur, len + 1)) > old_match) {
2810 old_match = new_match;
2811 LYXERR(Debug::FIND, "verifying match with len = " << len);
2818 int maxl = cur.lastpos() - cur.pos();
2819 // Greedy behaviour while matching regexps
2820 while (maxl > minl) {
2821 int actual_match = match(cur, len);
2822 if (actual_match >= max_match) {
2823 // actual_match > max_match _can_ happen,
2824 // if the search area splits
2825 // some following word so that the regex
2826 // (e.g. 'r.*r\b' matches 'r' from the middle of the
2828 // This means, the len value is too big
2830 len = (int)((maxl + minl)/2);
2833 // (actual_match < max_match)
2835 len = (int)((maxl + minl)/2);
2844 int findForwardAdv(DocIterator & cur, MatchStringAdv & match)
2848 while (!theApp()->longOperationCancelled() && cur) {
2849 LYXERR(Debug::FIND, "findForwardAdv() cur: " << cur);
2850 int match_len = match(cur, -1, false);
2851 LYXERR(Debug::FIND, "match_len: " << match_len);
2852 if (match_len > 0) {
2853 int match_len_zero_count = 0;
2854 for (; !theApp()->longOperationCancelled() && cur; cur.forwardPos()) {
2855 LYXERR(Debug::FIND, "Advancing cur: " << cur);
2856 int match_len3 = match(cur, 1);
2859 int match_len2 = match(cur);
2860 LYXERR(Debug::FIND, "match_len2: " << match_len2);
2861 if (match_len2 > 0) {
2862 // Sometimes in finalize we understand it wasn't a match
2863 // and we need to continue the outest loop
2864 int len = findAdvFinalize(cur, match);
2869 if (match_len2 >= 0) {
2870 if (match_len2 == 0)
2871 match_len_zero_count++;
2873 match_len_zero_count = 0;
2876 if (++match_len_zero_count > 3) {
2877 LYXERR(Debug::FIND, "match_len2_zero_count: " << match_len_zero_count << ", match_len was " << match_len);
2878 match_len_zero_count = 0;
2886 if (match_len >= 0 && cur.pit() < cur.lastpit()) {
2887 LYXERR(Debug::FIND, "Advancing par: cur=" << cur);
2890 // This should exit nested insets, if any, or otherwise undefine the currsor.
2891 cur.pos() = cur.lastpos();
2892 LYXERR(Debug::FIND, "Advancing pos: cur=" << cur);
2900 /// Find the most backward consecutive match within same paragraph while searching backwards.
2901 int findMostBackwards(DocIterator & cur, MatchStringAdv const & match)
2903 DocIterator cur_begin = doc_iterator_begin(cur.buffer());
2904 DocIterator tmp_cur = cur;
2905 int len = findAdvFinalize(tmp_cur, match);
2906 Inset & inset = cur.inset();
2907 for (; cur != cur_begin; cur.backwardPos()) {
2908 LYXERR(Debug::FIND, "findMostBackwards(): cur=" << cur);
2909 DocIterator new_cur = cur;
2910 new_cur.backwardPos();
2911 if (new_cur == cur || &new_cur.inset() != &inset || !match(new_cur))
2913 int new_len = findAdvFinalize(new_cur, match);
2918 LYXERR(Debug::FIND, "findMostBackwards(): exiting with cur=" << cur);
2924 int findBackwardsAdv(DocIterator & cur, MatchStringAdv & match)
2928 // Backup of original position
2929 DocIterator cur_begin = doc_iterator_begin(cur.buffer());
2930 if (cur == cur_begin)
2933 DocIterator cur_orig(cur);
2934 bool pit_changed = false;
2937 bool found_match = match(cur, -1, false);
2941 cur.pos() = cur.lastpos();
2943 cur.pos() = cur_orig.pos();
2944 LYXERR(Debug::FIND, "findBackAdv2: cur: " << cur);
2945 DocIterator cur_prev_iter;
2947 found_match = match(cur);
2948 LYXERR(Debug::FIND, "findBackAdv3: found_match="
2949 << found_match << ", cur: " << cur);
2951 return findMostBackwards(cur, match);
2953 // Stop if begin of document reached
2954 if (cur == cur_begin)
2956 cur_prev_iter = cur;
2960 if (cur == cur_begin)
2967 } while (!theApp()->longOperationCancelled());
2975 docstring stringifyFromForSearch(FindAndReplaceOptions const & opt,
2976 DocIterator const & cur, int len)
2978 if (cur.pos() < 0 || cur.pos() > cur.lastpos())
2980 if (!opt.ignoreformat)
2981 return latexifyFromCursor(cur, len);
2983 return stringifyFromCursor(cur, len);
2987 FindAndReplaceOptions::FindAndReplaceOptions(
2988 docstring const & find_buf_name, bool casesensitive,
2989 bool matchword, bool forward, bool expandmacros, bool ignoreformat,
2990 docstring const & repl_buf_name, bool keep_case,
2991 SearchScope scope, SearchRestriction restr)
2992 : find_buf_name(find_buf_name), casesensitive(casesensitive), matchword(matchword),
2993 forward(forward), expandmacros(expandmacros), ignoreformat(ignoreformat),
2994 repl_buf_name(repl_buf_name), keep_case(keep_case), scope(scope), restr(restr)
3002 /** Check if 'len' letters following cursor are all non-lowercase */
3003 static bool allNonLowercase(Cursor const & cur, int len)
3005 pos_type beg_pos = cur.selectionBegin().pos();
3006 pos_type end_pos = cur.selectionBegin().pos() + len;
3007 if (len > cur.lastpos() + 1 - beg_pos) {
3008 LYXERR(Debug::FIND, "This should not happen, more debug needed");
3009 len = cur.lastpos() + 1 - beg_pos;
3010 end_pos = beg_pos + len;
3012 for (pos_type pos = beg_pos; pos != end_pos; ++pos)
3013 if (isLowerCase(cur.paragraph().getChar(pos)))
3019 /** Check if first letter is upper case and second one is lower case */
3020 static bool firstUppercase(Cursor const & cur)
3023 pos_type pos = cur.selectionBegin().pos();
3024 if (pos >= cur.lastpos() - 1) {
3025 LYXERR(Debug::FIND, "No upper-case at cur: " << cur);
3028 ch1 = cur.paragraph().getChar(pos);
3029 ch2 = cur.paragraph().getChar(pos + 1);
3030 bool result = isUpperCase(ch1) && isLowerCase(ch2);
3031 LYXERR(Debug::FIND, "firstUppercase(): "
3032 << "ch1=" << ch1 << "(" << char(ch1) << "), ch2="
3033 << ch2 << "(" << char(ch2) << ")"
3034 << ", result=" << result << ", cur=" << cur);
3039 /** Make first letter of supplied buffer upper-case, and the rest lower-case.
3041 ** \fixme What to do with possible further paragraphs in replace buffer ?
3043 static void changeFirstCase(Buffer & buffer, TextCase first_case, TextCase others_case)
3045 ParagraphList::iterator pit = buffer.paragraphs().begin();
3046 LASSERT(pit->size() >= 1, /**/);
3047 pos_type right = pos_type(1);
3048 pit->changeCase(buffer.params(), pos_type(0), right, first_case);
3049 right = pit->size();
3050 pit->changeCase(buffer.params(), pos_type(1), right, others_case);
3056 static void findAdvReplace(BufferView * bv, FindAndReplaceOptions const & opt, MatchStringAdv & matchAdv)
3058 Cursor & cur = bv->cursor();
3059 if (opt.repl_buf_name == docstring()
3060 || theBufferList().getBuffer(FileName(to_utf8(opt.repl_buf_name)), true) == 0
3061 || theBufferList().getBuffer(FileName(to_utf8(opt.find_buf_name)), true) == 0)
3064 DocIterator sel_beg = cur.selectionBegin();
3065 DocIterator sel_end = cur.selectionEnd();
3066 if (&sel_beg.inset() != &sel_end.inset()
3067 || sel_beg.pit() != sel_end.pit()
3068 || sel_beg.idx() != sel_end.idx())
3070 int sel_len = sel_end.pos() - sel_beg.pos();
3071 LYXERR(Debug::FIND, "sel_beg: " << sel_beg << ", sel_end: " << sel_end
3072 << ", sel_len: " << sel_len << endl);
3075 LASSERT(sel_len > 0, return);
3077 if (!matchAdv(sel_beg, sel_len))
3080 // Build a copy of the replace buffer, adapted to the KeepCase option
3081 Buffer & repl_buffer_orig = *theBufferList().getBuffer(FileName(to_utf8(opt.repl_buf_name)), true);
3083 repl_buffer_orig.write(oss);
3084 string lyx = oss.str();
3085 Buffer repl_buffer("", false);
3086 repl_buffer.setUnnamed(true);
3087 LASSERT(repl_buffer.readString(lyx), return);
3088 if (opt.keep_case && sel_len >= 2) {
3089 LYXERR(Debug::FIND, "keep_case true: cur.pos()=" << cur.pos() << ", sel_len=" << sel_len);
3090 if (cur.inTexted()) {
3091 if (firstUppercase(cur))
3092 changeFirstCase(repl_buffer, text_uppercase, text_lowercase);
3093 else if (allNonLowercase(cur, sel_len))
3094 changeFirstCase(repl_buffer, text_uppercase, text_uppercase);
3097 cap::cutSelection(cur, false);
3098 if (cur.inTexted()) {
3099 repl_buffer.changeLanguage(
3100 repl_buffer.language(),
3101 cur.getFont().language());
3102 LYXERR(Debug::FIND, "Replacing by pasteParagraphList()ing repl_buffer");
3103 LYXERR(Debug::FIND, "Before pasteParagraphList() cur=" << cur << endl);
3104 cap::pasteParagraphList(cur, repl_buffer.paragraphs(),
3105 repl_buffer.params().documentClassPtr(),
3106 bv->buffer().errorList("Paste"));
3107 LYXERR(Debug::FIND, "After pasteParagraphList() cur=" << cur << endl);
3108 sel_len = repl_buffer.paragraphs().begin()->size();
3109 } else if (cur.inMathed()) {
3110 odocstringstream ods;
3112 OutputParams runparams(&repl_buffer.params().encoding());
3113 runparams.nice = false;
3114 runparams.flavor = OutputParams::LATEX;
3115 runparams.linelen = 8000; //lyxrc.plaintext_linelen;
3116 runparams.dryrun = true;
3117 TeXOnePar(repl_buffer, repl_buffer.text(), 0, os, runparams);
3118 //repl_buffer.getSourceCode(ods, 0, repl_buffer.paragraphs().size(), false);
3119 docstring repl_latex = ods.str();
3120 LYXERR(Debug::FIND, "Latexified replace_buffer: '" << repl_latex << "'");
3122 (void)regex_replace(to_utf8(repl_latex), s, "\\$(.*)\\$", "$1");
3123 (void)regex_replace(s, s, "\\\\\\[(.*)\\\\\\]", "$1");
3124 repl_latex = from_utf8(s);
3125 LYXERR(Debug::FIND, "Replacing by insert()ing latex: '" << repl_latex << "' cur=" << cur << " with depth=" << cur.depth());
3126 MathData ar(cur.buffer());
3127 asArray(repl_latex, ar, Parse::NORMAL);
3129 sel_len = ar.size();
3130 LYXERR(Debug::FIND, "After insert() cur=" << cur << " with depth: " << cur.depth() << " and len: " << sel_len);
3132 if (cur.pos() >= sel_len)
3133 cur.pos() -= sel_len;
3136 LYXERR(Debug::FIND, "After pos adj cur=" << cur << " with depth: " << cur.depth() << " and len: " << sel_len);
3137 bv->putSelectionAt(DocIterator(cur), sel_len, !opt.forward);
3138 bv->processUpdateFlags(Update::Force);
3142 /// Perform a FindAdv operation.
3143 bool findAdv(BufferView * bv, FindAndReplaceOptions const & opt)
3148 // e.g., when invoking word-findadv from mini-buffer wither with
3149 // wrong options syntax or before ever opening advanced F&R pane
3150 if (theBufferList().getBuffer(FileName(to_utf8(opt.find_buf_name)), true) == 0)
3154 MatchStringAdv matchAdv(bv->buffer(), opt);
3155 int length = bv->cursor().selectionEnd().pos() - bv->cursor().selectionBegin().pos();
3157 bv->putSelectionAt(bv->cursor().selectionBegin(), length, !opt.forward);
3158 findAdvReplace(bv, opt, matchAdv);
3161 match_len = findForwardAdv(cur, matchAdv);
3163 match_len = findBackwardsAdv(cur, matchAdv);
3165 // This may only be raised by lyx::regex()
3166 bv->message(_("Invalid regular expression!"));
3170 if (match_len == 0) {
3171 bv->message(_("Match not found!"));
3175 bv->message(_("Match found!"));
3177 LYXERR(Debug::FIND, "Putting selection at cur=" << cur << " with len: " << match_len);
3178 bv->putSelectionAt(cur, match_len, !opt.forward);
3184 ostringstream & operator<<(ostringstream & os, FindAndReplaceOptions const & opt)
3186 os << to_utf8(opt.find_buf_name) << "\nEOSS\n"
3187 << opt.casesensitive << ' '
3188 << opt.matchword << ' '
3189 << opt.forward << ' '
3190 << opt.expandmacros << ' '
3191 << opt.ignoreformat << ' '
3192 << to_utf8(opt.repl_buf_name) << "\nEOSS\n"
3193 << opt.keep_case << ' '
3194 << int(opt.scope) << ' '
3197 LYXERR(Debug::FIND, "built: " << os.str());
3203 istringstream & operator>>(istringstream & is, FindAndReplaceOptions & opt)
3205 LYXERR(Debug::FIND, "parsing");
3209 while (line != "EOSS") {
3213 if (is.eof()) // Tolerate malformed request
3217 LYXERR(Debug::FIND, "file_buf_name: '" << s << "'");
3218 opt.find_buf_name = from_utf8(s);
3219 is >> opt.casesensitive >> opt.matchword >> opt.forward >> opt.expandmacros >> opt.ignoreformat;
3220 is.get(); // Waste space before replace string
3223 while (line != "EOSS") {
3227 if (is.eof()) // Tolerate malformed request
3231 LYXERR(Debug::FIND, "repl_buf_name: '" << s << "'");
3232 opt.repl_buf_name = from_utf8(s);
3233 is >> opt.keep_case;
3236 opt.scope = FindAndReplaceOptions::SearchScope(i);
3238 opt.restr = FindAndReplaceOptions::SearchRestriction(i);
3240 LYXERR(Debug::FIND, "parsed: " << opt.casesensitive << ' ' << opt.matchword << ' ' << opt.forward << ' '
3241 << opt.expandmacros << ' ' << opt.ignoreformat << ' ' << opt.keep_case << ' '
3242 << opt.scope << ' ' << opt.restr);