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 "BufferList.h"
21 #include "BufferParams.h"
22 #include "BufferView.h"
25 #include "CutAndPaste.h"
26 #include "FuncRequest.h"
28 #include "output_latex.h"
29 #include "OutputParams.h"
30 #include "Paragraph.h"
34 #include "frontends/Application.h"
35 #include "frontends/alert.h"
37 #include "mathed/InsetMath.h"
38 #include "mathed/InsetMathHull.h"
39 #include "mathed/MathData.h"
40 #include "mathed/MathStream.h"
41 #include "mathed/MathSupport.h"
43 #include "support/debug.h"
44 #include "support/docstream.h"
45 #include "support/FileName.h"
46 #include "support/gettext.h"
47 #include "support/lassert.h"
48 #include "support/lstrings.h"
50 #include "support/regex.h"
51 #include "support/textutils.h"
55 using namespace lyx::support;
60 // Helper class for deciding what should be ignored
64 IgnoreFormats() = default;
66 bool getFamily() const { return ignoreFamily_; }
68 bool getSeries() const { return ignoreSeries_; }
70 bool getShape() const { return ignoreShape_; }
72 bool getUnderline() const { return ignoreUnderline_; }
74 bool getMarkUp() const { return ignoreMarkUp_; }
76 bool getStrikeOut() const { return ignoreStrikeOut_; }
78 bool getSectioning() const { return ignoreSectioning_; }
80 bool getFrontMatter() const { return ignoreFrontMatter_; }
82 bool getColor() const { return ignoreColor_; }
84 bool getLanguage() const { return ignoreLanguage_; }
86 void setIgnoreFormat(string const & type, bool value);
90 bool ignoreFamily_ = false;
92 bool ignoreSeries_ = false;
94 bool ignoreShape_ = false;
96 bool ignoreUnderline_ = false;
98 bool ignoreMarkUp_ = false;
100 bool ignoreStrikeOut_ = false;
102 bool ignoreSectioning_ = false;
104 bool ignoreFrontMatter_ = false;
106 bool ignoreColor_ = false;
108 bool ignoreLanguage_ = false;
112 void IgnoreFormats::setIgnoreFormat(string const & type, bool value)
114 if (type == "color") {
115 ignoreColor_ = value;
117 else if (type == "language") {
118 ignoreLanguage_ = value;
120 else if (type == "sectioning") {
121 ignoreSectioning_ = value;
122 ignoreFrontMatter_ = value;
124 else if (type == "font") {
125 ignoreSeries_ = value;
126 ignoreShape_ = value;
127 ignoreFamily_ = value;
129 else if (type == "series") {
130 ignoreSeries_ = value;
132 else if (type == "shape") {
133 ignoreShape_ = value;
135 else if (type == "family") {
136 ignoreFamily_ = value;
138 else if (type == "markup") {
139 ignoreMarkUp_ = value;
141 else if (type == "underline") {
142 ignoreUnderline_ = value;
144 else if (type == "strike") {
145 ignoreStrikeOut_ = value;
149 // The global variable that can be changed from outside
150 IgnoreFormats ignoreFormats;
153 void setIgnoreFormat(string const & type, bool value)
155 ignoreFormats.setIgnoreFormat(type, value);
161 bool parse_bool(docstring & howto)
166 howto = split(howto, var, ' ');
174 MatchString(docstring const & s, bool cs, bool mw)
175 : str(s), case_sens(cs), whole_words(mw)
178 // returns true if the specified string is at the specified position
179 // del specifies whether deleted strings in ct mode will be considered
180 int operator()(Paragraph const & par, pos_type pos, bool del = true) const
182 return par.find(str, case_sens, whole_words, pos, del);
190 // match whole words only
195 int findForward(DocIterator & cur, MatchString const & match,
196 bool find_del = true)
198 for (; cur; cur.forwardChar())
199 if (cur.inTexted()) {
200 int len = match(cur.paragraph(), cur.pos(), find_del);
208 int findBackwards(DocIterator & cur, MatchString const & match,
209 bool find_del = true)
213 if (cur.inTexted()) {
214 int len = match(cur.paragraph(), cur.pos(), find_del);
223 bool searchAllowed(docstring const & str)
226 frontend::Alert::error(_("Search error"), _("Search string is empty"));
233 bool findOne(BufferView * bv, docstring const & searchstr,
234 bool case_sens, bool whole, bool forward,
235 bool find_del = true, bool check_wrap = false)
237 if (!searchAllowed(searchstr))
240 DocIterator cur = forward
241 ? bv->cursor().selectionEnd()
242 : bv->cursor().selectionBegin();
244 MatchString const match(searchstr, case_sens, whole);
246 int match_len = forward
247 ? findForward(cur, match, find_del)
248 : findBackwards(cur, match, find_del);
251 bv->putSelectionAt(cur, match_len, !forward);
252 else if (check_wrap) {
253 DocIterator cur_orig(bv->cursor());
256 q = _("End of file reached while searching forward.\n"
257 "Continue searching from the beginning?");
259 q = _("Beginning of file reached while searching backward.\n"
260 "Continue searching from the end?");
261 int wrap_answer = frontend::Alert::prompt(_("Wrap search?"),
262 q, 0, 1, _("&Yes"), _("&No"));
263 if (wrap_answer == 0) {
265 bv->cursor().clear();
266 bv->cursor().push_back(CursorSlice(bv->buffer().inset()));
268 bv->cursor().setCursor(doc_iterator_end(&bv->buffer()));
269 bv->cursor().backwardPos();
271 bv->clearSelection();
272 if (findOne(bv, searchstr, case_sens, whole, forward, find_del, false))
275 bv->cursor().setCursor(cur_orig);
279 return match_len > 0;
283 int replaceAll(BufferView * bv,
284 docstring const & searchstr, docstring const & replacestr,
285 bool case_sens, bool whole)
287 Buffer & buf = bv->buffer();
289 if (!searchAllowed(searchstr) || buf.isReadonly())
292 DocIterator cur_orig(bv->cursor());
294 MatchString const match(searchstr, case_sens, whole);
297 int const rsize = replacestr.size();
298 int const ssize = searchstr.size();
301 cur.setCursor(doc_iterator_begin(&buf));
302 int match_len = findForward(cur, match, false);
303 while (match_len > 0) {
304 // Backup current cursor position and font.
305 pos_type const pos = cur.pos();
306 Font const font = cur.paragraph().getFontSettings(buf.params(), pos);
308 int striked = ssize -
309 cur.paragraph().eraseChars(pos, pos + match_len,
310 buf.params().track_changes);
311 cur.paragraph().insert(pos, replacestr, font,
312 Change(buf.params().track_changes
314 : Change::UNCHANGED));
315 for (int i = 0; i < rsize + striked; ++i)
318 match_len = findForward(cur, match, false);
321 bv->putSelectionAt(doc_iterator_begin(&buf), 0, false);
323 cur_orig.fixIfBroken();
324 bv->setCursor(cur_orig);
330 // the idea here is that we are going to replace the string that
331 // is selected IF it is the search string.
332 // if there is a selection, but it is not the search string, then
333 // we basically ignore it. (FIXME We ought to replace only within
335 // if there is no selection, then:
336 // (i) if some search string has been provided, then we find it.
337 // (think of how the dialog works when you hit "replace" the
339 // (ii) if no search string has been provided, then we treat the
340 // word the cursor is in as the search string. (why? i have no
341 // idea.) but this only works in text?
343 // returns the number of replacements made (one, if any) and
344 // whether anything at all was done.
345 pair<bool, int> replaceOne(BufferView * bv, docstring searchstr,
346 docstring const & replacestr, bool case_sens,
347 bool whole, bool forward, bool findnext)
349 Cursor & cur = bv->cursor();
350 if (!cur.selection()) {
351 // no selection, non-empty search string: find it
352 if (!searchstr.empty()) {
353 bool const found = findOne(bv, searchstr, case_sens, whole, forward, true, findnext);
354 return make_pair(found, 0);
356 // empty search string
359 return make_pair(false, 0);
360 // select current word and treat it as the search string.
361 // This causes a minor bug as undo will restore this selection,
362 // which the user did not create (#8986).
363 cur.innerText()->selectWord(cur, WHOLE_WORD);
364 searchstr = cur.selectionAsString(false);
367 // if we still don't have a search string, report the error
369 if (!searchAllowed(searchstr))
370 return make_pair(false, 0);
372 bool have_selection = cur.selection();
373 docstring const selected = cur.selectionAsString(false);
376 ? searchstr == selected
377 : compare_no_case(searchstr, selected) == 0;
379 // no selection or current selection is not search word:
380 // just find the search word
381 if (!have_selection || !match) {
382 bool const found = findOne(bv, searchstr, case_sens, whole, forward, true, findnext);
383 return make_pair(found, 0);
386 // we're now actually ready to replace. if the buffer is
387 // read-only, we can't, though.
388 if (bv->buffer().isReadonly())
389 return make_pair(false, 0);
391 cap::replaceSelectionWithString(cur, replacestr);
393 cur.pos() += replacestr.length();
394 LASSERT(cur.pos() <= cur.lastpos(),
395 cur.pos() = cur.lastpos());
398 findOne(bv, searchstr, case_sens, whole, forward, false, findnext);
400 return make_pair(true, 1);
406 docstring const find2string(docstring const & search,
407 bool casesensitive, bool matchword, bool forward)
411 << int(casesensitive) << ' '
412 << int(matchword) << ' '
418 docstring const replace2string(docstring const & replace,
419 docstring const & search,
420 bool casesensitive, bool matchword,
421 bool all, bool forward, bool findnext)
424 ss << replace << '\n'
426 << int(casesensitive) << ' '
427 << int(matchword) << ' '
429 << int(forward) << ' '
435 bool lyxfind(BufferView * bv, FuncRequest const & ev)
437 if (!bv || ev.action() != LFUN_WORD_FIND)
440 //lyxerr << "find called, cmd: " << ev << endl;
442 // data is of the form
444 // <casesensitive> <matchword> <forward>"
446 docstring howto = split(ev.argument(), search, '\n');
448 bool casesensitive = parse_bool(howto);
449 bool matchword = parse_bool(howto);
450 bool forward = parse_bool(howto);
452 return findOne(bv, search, casesensitive, matchword, forward, true, true);
456 bool lyxreplace(BufferView * bv,
457 FuncRequest const & ev, bool has_deleted)
459 if (!bv || ev.action() != LFUN_WORD_REPLACE)
462 // data is of the form
465 // <casesensitive> <matchword> <all> <forward> <findnext>"
468 docstring howto = split(ev.argument(), rplc, '\n');
469 howto = split(howto, search, '\n');
471 bool casesensitive = parse_bool(howto);
472 bool matchword = parse_bool(howto);
473 bool all = parse_bool(howto);
474 bool forward = parse_bool(howto);
475 bool findnext = howto.empty() ? true : parse_bool(howto);
480 int replace_count = 0;
482 replace_count = replaceAll(bv, search, rplc, casesensitive, matchword);
483 update = replace_count > 0;
486 replaceOne(bv, search, rplc, casesensitive, matchword, forward, findnext);
488 replace_count = rv.second;
491 Buffer const & buf = bv->buffer();
493 // emit message signal.
494 buf.message(_("String not found."));
496 if (replace_count == 0) {
497 buf.message(_("String found."));
498 } else if (replace_count == 1) {
499 buf.message(_("String has been replaced."));
501 docstring const str =
502 bformat(_("%1$d strings have been replaced."), replace_count);
506 } else if (findnext) {
507 // if we have deleted characters, we do not replace at all, but
508 // rather search for the next occurence
509 if (findOne(bv, search, casesensitive, matchword, forward, true, findnext))
512 bv->message(_("String not found."));
518 bool findNextChange(BufferView * bv, Cursor & cur, bool const check_wrap)
520 for (; cur; cur.forwardPos())
521 if (cur.inTexted() && cur.paragraph().isChanged(cur.pos()))
525 DocIterator cur_orig(bv->cursor());
526 docstring q = _("End of file reached while searching forward.\n"
527 "Continue searching from the beginning?");
528 int wrap_answer = frontend::Alert::prompt(_("Wrap search?"),
529 q, 0, 1, _("&Yes"), _("&No"));
530 if (wrap_answer == 0) {
531 bv->cursor().clear();
532 bv->cursor().push_back(CursorSlice(bv->buffer().inset()));
533 bv->clearSelection();
534 cur.setCursor(bv->cursor().selectionBegin());
535 if (findNextChange(bv, cur, false))
538 bv->cursor().setCursor(cur_orig);
545 bool findPreviousChange(BufferView * bv, Cursor & cur, bool const check_wrap)
547 for (cur.backwardPos(); cur; cur.backwardPos()) {
548 if (cur.inTexted() && cur.paragraph().isChanged(cur.pos()))
553 DocIterator cur_orig(bv->cursor());
554 docstring q = _("Beginning of file reached while searching backward.\n"
555 "Continue searching from the end?");
556 int wrap_answer = frontend::Alert::prompt(_("Wrap search?"),
557 q, 0, 1, _("&Yes"), _("&No"));
558 if (wrap_answer == 0) {
559 bv->cursor().setCursor(doc_iterator_end(&bv->buffer()));
560 bv->cursor().backwardPos();
561 bv->clearSelection();
562 cur.setCursor(bv->cursor().selectionBegin());
563 if (findPreviousChange(bv, cur, false))
566 bv->cursor().setCursor(cur_orig);
573 bool selectChange(Cursor & cur, bool forward)
575 if (!cur.inTexted() || !cur.paragraph().isChanged(cur.pos()))
577 Change ch = cur.paragraph().lookupChange(cur.pos());
579 CursorSlice tip1 = cur.top();
580 for (; tip1.pit() < tip1.lastpit() || tip1.pos() < tip1.lastpos(); tip1.forwardPos()) {
581 Change ch2 = tip1.paragraph().lookupChange(tip1.pos());
582 if (!ch2.isSimilarTo(ch))
585 CursorSlice tip2 = cur.top();
586 for (; tip2.pit() > 0 || tip2.pos() > 0;) {
588 Change ch2 = tip2.paragraph().lookupChange(tip2.pos());
589 if (!ch2.isSimilarTo(ch)) {
590 // take a step forward to correctly set the selection
598 cur.bv().mouseSetCursor(cur, false);
600 cur.bv().mouseSetCursor(cur, true);
608 bool findChange(BufferView * bv, bool forward)
611 cur.setCursor(forward ? bv->cursor().selectionEnd()
612 : bv->cursor().selectionBegin());
613 forward ? findNextChange(bv, cur, true) : findPreviousChange(bv, cur, true);
614 return selectChange(cur, forward);
619 bool findNextChange(BufferView * bv)
621 return findChange(bv, true);
625 bool findPreviousChange(BufferView * bv)
627 return findChange(bv, false);
634 typedef vector<pair<string, string> > Escapes;
636 /// A map of symbols and their escaped equivalent needed within a regex.
637 /// @note Beware of order
638 Escapes const & get_regexp_escapes()
640 typedef std::pair<std::string, std::string> P;
642 static Escapes escape_map;
643 if (escape_map.empty()) {
644 escape_map.push_back(P("$", "_x_$"));
645 escape_map.push_back(P("{", "_x_{"));
646 escape_map.push_back(P("}", "_x_}"));
647 escape_map.push_back(P("[", "_x_["));
648 escape_map.push_back(P("]", "_x_]"));
649 escape_map.push_back(P("(", "_x_("));
650 escape_map.push_back(P(")", "_x_)"));
651 escape_map.push_back(P("+", "_x_+"));
652 escape_map.push_back(P("*", "_x_*"));
653 escape_map.push_back(P(".", "_x_."));
654 escape_map.push_back(P("\\", "(?:\\\\|\\\\backslash)"));
655 escape_map.push_back(P("~", "(?:\\\\textasciitilde|\\\\sim)"));
656 escape_map.push_back(P("^", "(?:\\^|\\\\textasciicircum\\{\\}|\\\\textasciicircum|\\\\mathcircumflex)"));
657 escape_map.push_back(P("_x_", "\\"));
662 /// A map of lyx escaped strings and their unescaped equivalent.
663 Escapes const & get_lyx_unescapes()
665 typedef std::pair<std::string, std::string> P;
667 static Escapes escape_map;
668 if (escape_map.empty()) {
669 escape_map.push_back(P("\\%", "%"));
670 escape_map.push_back(P("\\mathcircumflex ", "^"));
671 escape_map.push_back(P("\\mathcircumflex", "^"));
672 escape_map.push_back(P("\\backslash ", "\\"));
673 escape_map.push_back(P("\\backslash", "\\"));
674 escape_map.push_back(P("\\\\{", "_x_<"));
675 escape_map.push_back(P("\\\\}", "_x_>"));
676 escape_map.push_back(P("\\sim ", "~"));
677 escape_map.push_back(P("\\sim", "~"));
682 /// A map of escapes turning a regexp matching text to one matching latex.
683 Escapes const & get_regexp_latex_escapes()
685 typedef std::pair<std::string, std::string> P;
687 static Escapes escape_map;
688 if (escape_map.empty()) {
689 escape_map.push_back(P("\\\\", "(?:\\\\\\\\|\\\\backslash|\\\\textbackslash\\{\\}|\\\\textbackslash)"));
690 escape_map.push_back(P("(<?!\\\\\\\\textbackslash)\\{", "\\\\\\{"));
691 escape_map.push_back(P("(<?!\\\\\\\\textbackslash\\\\\\{)\\}", "\\\\\\}"));
692 escape_map.push_back(P("\\[", "\\{\\[\\}"));
693 escape_map.push_back(P("\\]", "\\{\\]\\}"));
694 escape_map.push_back(P("\\^", "(?:\\^|\\\\textasciicircum\\{\\}|\\\\textasciicircum|\\\\mathcircumflex)"));
695 escape_map.push_back(P("%", "\\\\\\%"));
696 escape_map.push_back(P("#", "\\\\#"));
701 /** @todo Probably the maps need to be migrated to regexps, in order to distinguish if
702 ** the found occurrence were escaped.
704 string apply_escapes(string s, Escapes const & escape_map)
706 LYXERR(Debug::FIND, "Escaping: '" << s << "'");
707 Escapes::const_iterator it;
708 for (it = escape_map.begin(); it != escape_map.end(); ++it) {
709 // LYXERR(Debug::FIND, "Escaping " << it->first << " as " << it->second);
710 unsigned int pos = 0;
711 while (pos < s.length() && (pos = s.find(it->first, pos)) < s.length()) {
712 s.replace(pos, it->first.length(), it->second);
713 LYXERR(Debug::FIND, "After escape: " << s);
714 pos += it->second.length();
715 // LYXERR(Debug::FIND, "pos: " << pos);
718 LYXERR(Debug::FIND, "Escaped : '" << s << "'");
723 /// Within \regexp{} apply get_lyx_unescapes() only (i.e., preserve regexp semantics of the string),
724 /// while outside apply get_lyx_unescapes()+get_regexp_escapes().
725 /// If match_latex is true, then apply regexp_latex_escapes() to \regexp{} contents as well.
726 string escape_for_regex(string s, bool match_latex)
729 while (pos < s.size()) {
730 size_t new_pos = s.find("\\regexp{", pos);
731 if (new_pos == string::npos)
735 LYXERR(Debug::FIND, "new_pos: " << new_pos);
736 t = apply_escapes(s.substr(pos, new_pos - pos), get_lyx_unescapes());
737 LYXERR(Debug::FIND, "t [lyx]: " << t);
738 t = apply_escapes(t, get_regexp_escapes());
739 LYXERR(Debug::FIND, "t [rxp]: " << t);
740 s.replace(pos, new_pos - pos, t);
741 new_pos = pos + t.size();
742 LYXERR(Debug::FIND, "Regexp after escaping: " << s);
743 LYXERR(Debug::FIND, "new_pos: " << new_pos);
744 if (new_pos == s.size())
747 // Might fail if \\endregexp{} is preceeded by unexpected stuff (weird escapes)
748 size_t end_pos = s.find("\\endregexp{}}", new_pos + 8);
749 LYXERR(Debug::FIND, "end_pos: " << end_pos);
750 t = s.substr(new_pos + 8, end_pos - (new_pos + 8));
751 LYXERR(Debug::FIND, "t in regexp : " << t);
752 t = apply_escapes(t, get_lyx_unescapes());
753 LYXERR(Debug::FIND, "t in regexp [lyx]: " << t);
755 t = apply_escapes(t, get_regexp_latex_escapes());
756 LYXERR(Debug::FIND, "t in regexp [ltx]: " << t);
758 if (end_pos == s.size()) {
759 s.replace(new_pos, end_pos - new_pos, t);
760 LYXERR(Debug::FIND, "Regexp after \\regexp{} removal: " << s);
763 s.replace(new_pos, end_pos + 13 - new_pos, t);
764 LYXERR(Debug::FIND, "Regexp after \\regexp{...\\endregexp{}} removal: " << s);
765 pos = new_pos + t.size();
766 LYXERR(Debug::FIND, "pos: " << pos);
772 /// Wrapper for lyx::regex_replace with simpler interface
773 bool regex_replace(string const & s, string & t, string const & searchstr,
774 string const & replacestr)
776 lyx::regex e(searchstr, regex_constants::ECMAScript);
778 ostream_iterator<char, char> it(oss);
779 lyx::regex_replace(it, s.begin(), s.end(), e, replacestr);
780 // tolerate t and s be references to the same variable
781 bool rv = (s != oss.str());
787 /** Checks if supplied string segment is well-formed from the standpoint of matching open-closed braces.
789 ** Verify that closed braces exactly match open braces. This avoids that, for example,
790 ** \frac{.*}{x} matches \frac{x+\frac{y}{x}}{z} with .* being 'x+\frac{y'.
793 ** Number of open braces that must remain open at the end for the verification to succeed.
795 bool braces_match(string::const_iterator const & beg,
796 string::const_iterator const & end,
800 string::const_iterator it = beg;
801 LYXERR(Debug::FIND, "Checking " << unmatched << " unmatched braces in '" << string(beg, end) << "'");
802 for (; it != end; ++it) {
803 // Skip escaped braces in the count
808 } else if (*it == '{') {
810 } else if (*it == '}') {
811 if (open_pars == 0) {
812 LYXERR(Debug::FIND, "Found unmatched closed brace");
818 if (open_pars != unmatched) {
819 LYXERR(Debug::FIND, "Found " << open_pars
820 << " instead of " << unmatched
821 << " unmatched open braces at the end of count");
824 LYXERR(Debug::FIND, "Braces match as expected");
834 MatchResult(): match_len(0),match2end(0), pos(0) {};
837 /** The class performing a match between a position in the document and the FindAdvOptions.
839 class MatchStringAdv {
841 MatchStringAdv(lyx::Buffer & buf, FindAndReplaceOptions const & opt);
843 /** Tests if text starting at the supplied position matches with the one provided to the MatchStringAdv
844 ** constructor as opt.search, under the opt.* options settings.
847 ** If set, then match is searched only against beginning of text starting at cur.
848 ** If unset, then match is searched anywhere in text starting at cur.
851 ** The length of the matching text, or zero if no match was found.
853 MatchResult operator()(DocIterator const & cur, int len = -1, bool at_begin = true) const;
858 /// first buffer on which search was started
859 lyx::Buffer * const p_first_buf;
861 FindAndReplaceOptions const & opt;
864 /// Auxiliary find method (does not account for opt.matchword)
865 MatchResult findAux(DocIterator const & cur, int len = -1, bool at_begin = true) const;
867 /** Normalize a stringified or latexified LyX paragraph.
871 ** <li>if search is not casesensitive, then lowercase the string;
872 ** <li>remove any newline at begin or end of the string;
873 ** <li>replace any newline in the middle of the string with a simple space;
874 ** <li>remove stale empty styles and environments, like \emph{} and \textbf{}.
877 ** @todo Normalization should also expand macros, if the corresponding
878 ** search option was checked.
880 string normalize(docstring const & s, bool hack_braces) const;
881 // normalized string to search
882 string par_as_string;
883 // regular expression to use for searching
885 // same as regexp, but prefixed with a ".*?"
887 // leading format material as string
888 string lead_as_string;
889 // par_as_string after removal of lead_as_string
890 string par_as_string_nolead;
891 // unmatched open braces in the search string/regexp
893 // number of (.*?) subexpressions added at end of search regexp for closing
894 // environments, math mode, styles, etc...
896 // Are we searching with regular expressions ?
901 static docstring buffer_to_latex(Buffer & buffer)
903 //OutputParams runparams(&buffer.params().encoding());
904 OutputParams runparams(encodings.fromLyXName("utf8"));
905 odocstringstream ods;
907 runparams.nice = true;
908 runparams.flavor = OutputParams::XETEX;
909 runparams.linelen = 10000; //lyxrc.plaintext_linelen;
910 // No side effect of file copying and image conversion
911 runparams.dryrun = true;
912 runparams.for_search = true;
913 pit_type const endpit = buffer.paragraphs().size();
914 for (pit_type pit = 0; pit != endpit; ++pit) {
915 TeXOnePar(buffer, buffer.text(), pit, os, runparams);
916 LYXERR(Debug::FIND, "searchString up to here: " << ods.str());
922 static docstring stringifySearchBuffer(Buffer & buffer, FindAndReplaceOptions const & opt)
925 if (!opt.ignoreformat) {
926 str = buffer_to_latex(buffer);
928 // OutputParams runparams(&buffer.params().encoding());
929 OutputParams runparams(encodings.fromLyXName("utf8"));
930 runparams.nice = true;
931 runparams.flavor = OutputParams::XETEX;
932 runparams.linelen = 10000; //lyxrc.plaintext_linelen;
933 runparams.dryrun = true;
934 runparams.for_search = true;
935 for (pos_type pit = pos_type(0); pit < (pos_type)buffer.paragraphs().size(); ++pit) {
936 Paragraph const & par = buffer.paragraphs().at(pit);
937 LYXERR(Debug::FIND, "Adding to search string: '"
938 << par.asString(pos_type(0), par.size(),
939 AS_STR_INSETS | AS_STR_SKIPDELETE | AS_STR_PLAINTEXT,
942 str += par.asString(pos_type(0), par.size(),
943 AS_STR_INSETS | AS_STR_SKIPDELETE | AS_STR_PLAINTEXT,
951 /// Return separation pos between the leading material and the rest
952 static size_t identifyLeading(string const & s)
955 // @TODO Support \item[text]
956 // Kornel: Added textsl, textsf, textit, texttt and noun
957 // + allow to search for colored text too
958 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|latexenvironment)\\{[a-z]+\\*?\\})|(u|uu)line|(s|x)out|uwave)|((sub)?(((sub)?section)|paragraph)|part|chapter)\\*?)\\{", "")
959 || regex_replace(t, t, REGEX_BOS "\\$", "")
960 || regex_replace(t, t, REGEX_BOS "\\\\\\[", "")
961 || regex_replace(t, t, REGEX_BOS " ?\\\\item\\{[a-z]+\\}", "")
962 || regex_replace(t, t, REGEX_BOS "\\\\begin\\{[a-zA-Z_]*\\*?\\}", ""))
964 LYXERR(Debug::FIND, " after removing leading $, \\[ , \\emph{, \\textbf{, etc.: '" << t << "'");
969 * Given a latexified string, retrieve some handled features
970 * The features of the regex will later be compared with the features
971 * of the searched text. If the regex features are not a
972 * subset of the analized, then, in not format ignoring search
973 * we can early stop the search in the relevant inset.
975 typedef map<string, bool> Features;
977 static Features identifyFeatures(string const & s)
979 static regex const feature("\\\\(([a-zA-Z]+(\\{([a-z]+\\*?)\\}|\\*)?))\\{");
980 static regex const valid("^("
982 "(footnotesize|tiny|scriptsize|small|large|Large|LARGE|huge|Huge|"
983 "emph|noun|text(bf|md|sl|sf|it|tt)|"
984 "(textcolor|foreignlanguage|item|listitem|latexenvironment)\\{[a-z]+\\*?\\})|"
985 "(u|uu)line|(s|x)out|uwave|"
986 "(sub|extra)?title|author|subject|publishers|dedication|(upper|lower)titleback|lyx(right)?address)|"
987 "((sub)?(((sub)?section)|paragraph)|part|chapter|lyxslide)\\*?)$");
992 for (sregex_iterator it(s.begin(), s.end(), feature), end; it != end; ++it) {
995 if (sub.str(1).compare("regexp") == 0) {
999 string token = sub.str(1);
1001 if (regex_match(token, sub2, valid)) {
1009 if (sub.str(1).compare("endregexp") == 0) {
1019 * defines values features of a key "\\[a-z]+{"
1024 /* Char type with content discarded
1025 * like \hspace{1cm} */
1027 /* Char, like \backslash */
1029 /* \part, \section*, ... */
1031 /* title, author etc */
1033 /* \foreignlanguage{ngerman}, ... */
1036 * to discard language in content */
1039 /* \begin{eqnarray}...\end{eqnarray}, ... $...$ */
1041 /* fonts, colors, markups, ... */
1043 /* footnotesize, ... large, ...
1044 * Ignore all of them */
1047 /* inputencoding, ...
1048 * Discard also content, because they do not help in search */
1051 * like remove, but also all arguments */
1053 /* item, listitem */
1055 /* tex, latex, ... like isChar */
1057 /* like \lettrine[lines=5]{}{} */
1059 /* End of arguments marker for lettrine,
1060 * so that they can be ignored */
1063 KeyInfo() = default;
1064 KeyInfo(KeyType type, int parcount, bool disable)
1066 parenthesiscount(parcount),
1067 disabled(disable) {}
1068 KeyType keytype = invalid;
1070 int _tokensize = -1;
1071 int _tokenstart = -1;
1072 int _dataStart = -1;
1074 int parenthesiscount = 1;
1075 bool disabled = false;
1076 bool used = false; /* by pattern */
1081 Border(int l=0, int u=0) : low(l), upper(u) {};
1086 #define MAXOPENED 30
1088 bool isPatternString_;
1090 explicit Intervall(bool isPattern, string const & p) :
1091 isPatternString_(isPattern), par(p), ignoreidx(-1), actualdeptindex(0),
1092 hasTitle(false), langcount(0)
1100 static vector<Border> borders;
1101 int depts[MAXOPENED];
1102 int closes[MAXOPENED];
1103 int actualdeptindex;
1104 int previousNotIgnored(int) const;
1105 int nextNotIgnored(int) const;
1106 void handleOpenP(int i);
1107 void handleCloseP(int i, bool closingAllowed);
1108 void resetOpenedP(int openPos);
1109 void addIntervall(int upper);
1110 void addIntervall(int low, int upper); /* if explicit */
1111 void removeAccents();
1112 void setForDefaultLang(KeyInfo const & defLang) const;
1113 int findclosing(int start, int end, char up, char down, int repeat);
1114 void handleParentheses(int lastpos, bool closingAllowed);
1116 int langcount; // Number of disabled language specs up to current position in actual interval
1117 int isOpeningPar(int pos) const;
1119 void output(ostringstream &os, int lastpos);
1120 // string show(int lastpos);
1123 vector<Border> Intervall::borders = vector<Border>(30);
1125 int Intervall::isOpeningPar(int pos) const
1127 if ((pos < 0) || (size_t(pos) >= par.size()))
1129 if (par[pos] != '{')
1131 if (size_t(pos) + 2 >= par.size())
1133 if (par[pos+2] != '}')
1135 if (par[pos+1] == '[' || par[pos+1] == ']')
1140 void Intervall::setForDefaultLang(KeyInfo const & defLang) const
1142 // Enable the use of first token again
1143 if (ignoreidx >= 0) {
1144 int value = defLang._tokenstart + defLang._tokensize;
1146 if (borders[0].low < value)
1147 borders[0].low = value;
1148 if (borders[0].upper < value)
1149 borders[0].upper = value;
1154 static void checkDepthIndex(int val)
1156 static int maxdepthidx = MAXOPENED-2;
1157 static int lastmaxdepth = 0;
1158 if (val > lastmaxdepth) {
1159 LYXERR(Debug::INFO, "Depth reached " << val);
1162 if (val > maxdepthidx) {
1164 LYXERR(Debug::INFO, "maxdepthidx now " << val);
1169 // Not needed, because borders are now dynamically expanded
1170 static void checkIgnoreIdx(int val)
1172 static int lastmaxignore = -1;
1173 if ((lastmaxignore < val) && (size_t(val+1) >= borders.size())) {
1174 LYXERR(Debug::INFO, "IgnoreIdx reached " << val);
1175 lastmaxignore = val;
1181 * Expand the region of ignored parts of the input latex string
1182 * The region is only relevant in output()
1184 void Intervall::addIntervall(int low, int upper)
1187 if (low == upper) return;
1188 for (idx = ignoreidx+1; idx > 0; --idx) {
1189 if (low > borders[idx-1].upper) {
1193 Border br(low, upper);
1194 if (idx > ignoreidx) {
1195 if (borders.size() <= size_t(idx)) {
1196 borders.push_back(br);
1202 // checkIgnoreIdx(ignoreidx);
1206 // Expand only if one of the new bound is inside the interwall
1207 // We know here that br.low > borders[idx-1].upper
1208 if (br.upper < borders[idx].low) {
1209 // We have to insert at this pos
1210 if (size_t(ignoreidx+1) >= borders.size()) {
1211 borders.push_back(borders[ignoreidx]);
1214 borders[ignoreidx+1] = borders[ignoreidx];
1216 for (int i = ignoreidx; i > idx; --i) {
1217 borders[i] = borders[i-1];
1221 // checkIgnoreIdx(ignoreidx);
1224 // Here we know, that we are overlapping
1225 if (br.low > borders[idx].low)
1226 br.low = borders[idx].low;
1227 // check what has to be concatenated
1229 for (int i = idx; i <= ignoreidx; i++) {
1230 if (br.upper >= borders[i].low) {
1232 if (br.upper < borders[i].upper)
1233 br.upper = borders[i].upper;
1239 // count should be >= 1 here
1242 for (int i = idx + count; i <= ignoreidx; i++) {
1243 borders[i-count+1] = borders[i];
1245 ignoreidx -= count - 1;
1251 typedef map<string, string> AccentsMap;
1252 static AccentsMap accents = map<string, string>();
1254 static void buildaccent(string n, string param, string values)
1258 const char delim = '|';
1259 while (getline(s, name, delim)) {
1261 for (char c : param) {
1262 string key = name + "{" + c + "}";
1263 // get the corresponding utf8-value
1264 if ((values[start] & 0xc0) != 0xc0) {
1265 // should not happen, utf8 encoding starts at least with 11xxxxxx
1266 // but value for '\dot{i}' is 'i', which is ascii
1267 if ((values[start] & 0x80) == 0) {
1269 accents[key] = values.substr(start, 1);
1270 // LYXERR(Debug::INFO, "" << key << "=" << accents[key]);
1275 for (int j = 1; ;j++) {
1276 if (start + j >= values.size()) {
1277 accents[key] = values.substr(start, j);
1278 start = values.size() - 1;
1281 else if ((values[start+j] & 0xc0) != 0x80) {
1282 // This is the first byte of following utf8 char
1283 accents[key] = values.substr(start, j);
1285 // LYXERR(Debug::INFO, "" << key << "=" << accents[key]);
1293 static void buildAccentsMap()
1295 accents["imath"] = "ı";
1297 accents["jmath"] = "ȷ";
1298 accents["cdot"] = "·";
1299 accents["lyxmathsym{ß}"] = "ß";
1300 accents["text{ß}"] = "ß";
1301 accents["ddot{\\imath}"] = "ï";
1302 buildaccent("ddot", "aAeEhHiIioOtuUwWxXyY",
1303 "äÄëËḧḦïÏïöÖẗüÜẅẄẍẌÿŸ"); // umlaut
1304 buildaccent("dot|.", "aAbBcCdDeEfFGghHIimMnNoOpPrRsStTwWxXyYzZ",
1305 "ȧȦḃḂċĊḋḊėĖḟḞĠġḣḢİİṁṀṅṄȯȮṗṖṙṘṡṠṫṪẇẆẋẊẏẎżŻ"); // dot{i} can only happen if ignoring case, but there is no lowercase of 'İ'
1306 accents["acute{\\imath}"] = "í";
1307 buildaccent("acute", "aAcCeEgGkKlLmMoOnNpPrRsSuUwWyYzZiI",
1308 "áÁćĆéÉǵǴḱḰĺĹḿḾóÓńŃṕṔŕŔśŚúÚẃẂýÝźŹíÍ");
1309 buildaccent("dacute|H|h", "oOuU", "őŐűŰ"); // double acute
1310 buildaccent("mathring|r", "aAuUwy",
1312 accents["check{\\imath}"] = "ǐ";
1313 accents["check{\\jmath}"] = "ǰ";
1314 buildaccent("check|v", "cCdDaAeEiIoOuUgGkKhHlLnNrRsSTtzZ",
1315 "čČďĎǎǍěĚǐǏǒǑǔǓǧǦǩǨȟȞľĽňŇřŘšŠŤťžŽ"); // caron
1316 accents["hat{\\imath}"] = "î";
1317 accents["hat{\\jmath}"] = "ĵ";
1318 buildaccent("hat|^", "aAcCeEgGhHiIjJoOsSuUwWyYzZ",
1319 "âÂĉĈêÊĝĜĥĤîÎĵĴôÔŝŜûÛŵŴŷŶẑẐ"); // circ
1320 accents["bar{\\imath}"] = "ī";
1321 buildaccent("bar|=", "aAeEiIoOuUyY",
1322 "āĀēĒīĪōŌūŪȳȲ"); // macron
1323 accents["tilde{\\imath}"] = "ĩ";
1324 buildaccent("tilde", "aAeEiInNoOuUvVyY",
1325 "ãÃẽẼĩĨñÑõÕũŨṽṼỹỸ"); // tilde
1326 accents["breve{\\imath}"] = "ĭ";
1327 buildaccent("breve|u", "aAeEgGiIoOuU",
1328 "ăĂĕĔğĞĭĬŏŎŭŬ"); // breve
1329 accents["grave{\\imath}"] = "ì";
1330 buildaccent("grave|`", "aAeEiIoOuUnNwWyY",
1331 "àÀèÈìÌòÒùÙǹǸẁẀỳỲ"); // grave
1332 buildaccent("subdot|d", "BbDdHhKkLlMmNnRrSsTtVvWwZzAaEeIiOoUuYy",
1333 "ḄḅḌḍḤḥḲḳḶḷṂṃṆṇṚṛṢṣṬṭṾṿẈẉẒẓẠạẸẹỊịỌọỤụỴỵ"); // dot below
1334 buildaccent("ogonek|k", "AaEeIiUuOo",
1335 "ĄąĘęĮįŲųǪǫ"); // ogonek
1336 buildaccent("cedilla|c", "CcGgKkLlNnRrSsTtEeDdHh",
1337 "ÇçĢĢĶķĻļŅņŖŗŞşŢţȨȩḐḑḨḩ"); // cedilla
1338 buildaccent("subring|textsubring", "Aa",
1340 buildaccent("subhat|textsubcircum", "DdEeLlNnTtUu",
1341 "ḒḓḘḙḼḽṊṋṰṱṶṷ"); // subcircum
1342 buildaccent("subtilde|textsubtilde", "EeIiUu",
1343 "ḚḛḬḭṴṵ"); // subtilde
1344 accents["dgrave{\\imath}"] = "ȉ";
1345 accents["textdoublegrave{\\i}"] = "ȉ";
1346 buildaccent("dgrave|textdoublegrave", "AaEeIiOoRrUu",
1347 "ȀȁȄȅȈȉȌȍȐȑȔȕ"); // double grave
1348 accents["rcap{\\imath}"] = "ȉ";
1349 accents["textroundcap{\\i}"] = "ȉ";
1350 buildaccent("rcap|textroundcap", "AaEeIiOoRrUu",
1351 "ȂȃȆȇȊȋȎȏȒȓȖȗ"); // inverted breve
1352 buildaccent("slashed", "oO",
1357 * Created accents in math or regexp environment
1358 * are macros, but we need the utf8 equivalent
1360 void Intervall::removeAccents()
1362 if (accents.empty())
1364 static regex const accre("\\\\(([\\S]|grave|breve|lyxmathsym|text|ddot|dot|acute|dacute|mathring|check|hat|bar|tilde|subdot|ogonek|cedilla|subring|textsubring|subhat|textsubcircum|subtilde|textsubtilde|dgrave|textdoublegrave|rcap|textroundcap|slashed)\\{[^\\{\\}]+\\}|(i|imath|jmath|cdot)(?![a-zA-Z]))");
1366 for (sregex_iterator itacc(par.begin(), par.end(), accre), end; itacc != end; ++itacc) {
1368 string key = sub.str(1);
1369 if (accents.find(key) != accents.end()) {
1370 string val = accents[key];
1371 size_t pos = sub.position(size_t(0));
1372 for (size_t i = 0; i < val.size(); i++) {
1373 par[pos+i] = val[i];
1375 // Remove possibly following space too
1376 if (par[pos+sub.str(0).size()] == ' ')
1377 addIntervall(pos+val.size(), pos + sub.str(0).size()+1);
1379 addIntervall(pos+val.size(), pos + sub.str(0).size());
1380 for (size_t i = pos+val.size(); i < pos + sub.str(0).size(); i++) {
1381 // remove traces of any remaining chars
1386 LYXERR(Debug::INFO, "Not added accent for \"" << key << "\"");
1391 void Intervall::handleOpenP(int i)
1394 depts[actualdeptindex] = i+1;
1395 closes[actualdeptindex] = -1;
1396 checkDepthIndex(actualdeptindex);
1399 void Intervall::handleCloseP(int i, bool closingAllowed)
1401 if (actualdeptindex <= 0) {
1402 if (! closingAllowed)
1403 LYXERR(Debug::FIND, "Bad closing parenthesis in latex"); /* should not happen, but the latex input may be wrong */
1404 // if we are at the very end
1405 addIntervall(i, i+1);
1408 closes[actualdeptindex] = i+1;
1413 void Intervall::resetOpenedP(int openPos)
1415 // Used as initializer for foreignlanguage entry
1416 actualdeptindex = 1;
1417 depts[1] = openPos+1;
1421 int Intervall::previousNotIgnored(int start) const
1423 int idx = 0; /* int intervalls */
1424 for (idx = ignoreidx; idx >= 0; --idx) {
1425 if (start > borders[idx].upper)
1427 if (start >= borders[idx].low)
1428 start = borders[idx].low-1;
1433 int Intervall::nextNotIgnored(int start) const
1435 int idx = 0; /* int intervalls */
1436 for (idx = 0; idx <= ignoreidx; idx++) {
1437 if (start < borders[idx].low)
1439 if (start < borders[idx].upper)
1440 start = borders[idx].upper;
1445 typedef map<string, KeyInfo> KeysMap;
1446 typedef vector< KeyInfo> Entries;
1447 static KeysMap keys = map<string, KeyInfo>();
1453 Intervall interval_;
1454 void buildKeys(bool);
1455 void buildEntries(bool);
1456 void makeKey(const string &, KeyInfo, bool isPatternString);
1457 void processRegion(int start, int region_end); /* remove {} parts */
1458 void removeHead(KeyInfo const &, int count=0);
1461 LatexInfo(string const & par, bool isPatternString)
1462 : entidx_(-1), interval_(isPatternString, par)
1464 buildKeys(isPatternString);
1465 entries_ = vector<KeyInfo>();
1466 buildEntries(isPatternString);
1470 if (entries_.empty()) {
1473 if (entries_[0].keytype == KeyInfo::isTitle) {
1474 if (! entries_[0].disabled) {
1475 interval_.hasTitle = true;
1476 interval_.titleValue = entries_[0].head;
1479 interval_.hasTitle = false;
1480 interval_.titleValue = "";
1482 removeHead(entries_[0]);
1483 if (entries_.size() > 1)
1492 if (int(entries_.size()) > entidx_) {
1499 bool setNextKey(int idx) {
1500 if ((idx == entidx_) && (entidx_ >= 0)) {
1507 int find(int start, KeyInfo::KeyType keytype) const {
1511 while (tmpIdx < int(entries_.size())) {
1512 if (entries_[tmpIdx].keytype == keytype)
1518 int process(ostringstream & os, KeyInfo const & actual);
1519 int dispatch(ostringstream & os, int previousStart, KeyInfo & actual);
1520 // string show(int lastpos) { return interval.show(lastpos);};
1521 int nextNotIgnored(int start) { return interval_.nextNotIgnored(start);};
1522 KeyInfo &getKeyInfo(int keyinfo) {
1523 static KeyInfo invalidInfo = KeyInfo();
1524 if ((keyinfo < 0) || ( keyinfo >= int(entries_.size())))
1527 return entries_[keyinfo];
1529 void setForDefaultLang(KeyInfo const & defLang) {interval_.setForDefaultLang(defLang);};
1530 void addIntervall(int low, int up) { interval_.addIntervall(low, up); };
1534 int Intervall::findclosing(int start, int end, char up = '{', char down = '}', int repeat = 1)
1538 for (int i = start; i < end; i += 1 + skip) {
1542 if (c == '\\') skip = 1;
1546 else if (c == down) {
1549 if ((repeat <= 0) || (par[i+1] != up))
1567 vector<MathEntry> entries_;
1572 void insert(string const & wait, size_t start, size_t end) {
1573 MathEntry m = MathEntry();
1575 m.mathStart = start;
1577 m.mathSize = end - start;
1578 entries_.push_back(m);
1580 bool empty() const { return entries_.empty(); };
1581 size_t getEndPos() const {
1582 if (entries_.empty() || (actualIdx_ >= entries_.size())) {
1585 return entries_[actualIdx_].mathEnd;
1587 size_t getStartPos() const {
1588 if (entries_.empty() || (actualIdx_ >= entries_.size())) {
1589 return 100000; /* definitely enough? */
1591 return entries_[actualIdx_].mathStart;
1593 size_t getFirstPos() {
1595 return getStartPos();
1597 size_t getSize() const {
1598 if (entries_.empty() || (actualIdx_ >= entries_.size())) {
1601 return entries_[actualIdx_].mathSize;
1603 void incrEntry() { actualIdx_++; };
1606 void LatexInfo::buildEntries(bool isPatternString)
1608 static regex const rmath("\\$|\\\\\\[|\\\\\\]|\\\\(begin|end)\\{((eqnarray|equation|flalign|gather|multline|align|alignat)\\*?)\\}");
1609 static regex const rkeys("\\$|\\\\\\[|\\\\\\]|\\\\((([a-zA-Z]+\\*?)(\\{([a-z]+\\*?)\\}|=[0-9]+[a-z]+)?))");
1610 static bool disableLanguageOverride = false;
1611 smatch sub, submath;
1612 bool evaluatingRegexp = false;
1614 bool evaluatingMath = false;
1615 bool evaluatingCode = false;
1617 bool evaluatingOptional = false;
1618 size_t optionalEnd = 0;
1621 bool math_end_waiting = false;
1622 size_t math_pos = 10000;
1625 interval_.removeAccents();
1627 for (sregex_iterator itmath(interval_.par.begin(), interval_.par.end(), rmath), end; itmath != end; ++itmath) {
1629 if (math_end_waiting) {
1630 size_t pos = submath.position(size_t(0));
1631 if ((math_end == "$") &&
1632 (submath.str(0) == "$") &&
1633 (interval_.par[pos-1] != '\\')) {
1634 mi.insert("$", math_pos, pos + 1);
1635 math_end_waiting = false;
1637 else if ((math_end == "\\]") &&
1638 (submath.str(0) == "\\]")) {
1639 mi.insert("\\]", math_pos, pos + 2);
1640 math_end_waiting = false;
1642 else if ((submath.str(1).compare("end") == 0) &&
1643 (submath.str(2).compare(math_end) == 0)) {
1644 mi.insert(math_end, math_pos, pos + submath.str(0).length());
1645 math_end_waiting = false;
1651 if (submath.str(1).compare("begin") == 0) {
1652 math_end_waiting = true;
1653 math_end = submath.str(2);
1654 math_pos = submath.position(size_t(0));
1656 else if (submath.str(0).compare("\\[") == 0) {
1657 math_end_waiting = true;
1659 math_pos = submath.position(size_t(0));
1661 else if (submath.str(0) == "$") {
1662 size_t pos = submath.position(size_t(0));
1663 if ((pos == 0) || (interval_.par[pos-1] != '\\')) {
1664 math_end_waiting = true;
1671 // Ignore language if there is math somewhere in pattern-string
1672 if (isPatternString) {
1675 keys["foreignlanguage"].disabled = true;
1676 disableLanguageOverride = true;
1679 disableLanguageOverride = false;
1682 if (disableLanguageOverride) {
1683 keys["foreignlanguage"].disabled = true;
1686 math_pos = mi.getFirstPos();
1687 for (sregex_iterator it(interval_.par.begin(), interval_.par.end(), rkeys), end; it != end; ++it) {
1689 string key = sub.str(3);
1691 if (sub.str(0)[0] == '\\')
1692 key = sub.str(0)[1];
1696 size_t k_pos = sub.position(size_t(0));
1697 if ((k_pos > 0) && (interval_.par[k_pos - 1] == '\\')) {
1698 // Escaped '$', ignoring
1704 if (evaluatingRegexp) {
1705 if (sub.str(1).compare("endregexp") == 0) {
1706 evaluatingRegexp = false;
1707 // found._tokenstart already set
1708 found._dataEnd = sub.position(size_t(0)) + 13;
1709 found._dataStart = found._dataEnd;
1710 found._tokensize = found._dataEnd - found._tokenstart;
1711 found.parenthesiscount = 0;
1712 found.head = interval_.par.substr(found._tokenstart, found._tokensize);
1719 if (evaluatingMath) {
1720 if (size_t(sub.position(size_t(0))) < mi.getEndPos())
1722 evaluatingMath = false;
1724 math_pos = mi.getStartPos();
1726 if (keys.find(key) == keys.end()) {
1727 found = KeyInfo(KeyInfo::isStandard, 0, true);
1728 if (isPatternString) {
1729 found.keytype = KeyInfo::isChar;
1730 found.disabled = false;
1737 if (key.compare("regexp") == 0) {
1738 evaluatingRegexp = true;
1739 found._tokenstart = sub.position(size_t(0));
1740 found._tokensize = 0;
1744 // Handle the other params of key
1745 if (found.keytype == KeyInfo::isIgnored)
1747 else if (found.keytype == KeyInfo::isMath) {
1748 if (size_t(sub.position(size_t(0))) == math_pos) {
1750 found._tokenstart = sub.position(size_t(0));
1751 found._tokensize = mi.getSize();
1752 found._dataEnd = found._tokenstart + found._tokensize;
1753 found._dataStart = found._dataEnd;
1754 found.parenthesiscount = 0;
1755 found.head = interval_.par.substr(found._tokenstart, found._tokensize);
1756 evaluatingMath = true;
1759 // begin|end of unknown env, discard
1760 // First handle tables
1761 // longtable|tabular
1762 bool discardComment;
1764 found.keytype = KeyInfo::doRemove;
1765 if ((sub.str(5).compare("longtable") == 0) ||
1766 (sub.str(5).compare("tabular") == 0)) {
1767 discardComment = true; /* '%' */
1770 discardComment = false;
1771 static regex const removeArgs("^(multicols|multipar|sectionbox|subsectionbox|tcolorbox)$");
1773 string token = sub.str(5);
1774 if (regex_match(token, sub2, removeArgs)) {
1775 found.keytype = KeyInfo::removeWithArg;
1778 // discard spaces before pos(0)
1779 int pos = sub.position(size_t(0));
1781 for (count = 0; pos - count > 0; count++) {
1782 char c = interval_.par[pos-count-1];
1783 if (discardComment) {
1784 if ((c != ' ') && (c != '%'))
1790 found._tokenstart = pos - count;
1791 if (sub.str(1).compare(0, 5, "begin") == 0) {
1792 size_t pos1 = pos + sub.str(0).length();
1793 if (sub.str(5).compare("cjk") == 0) {
1794 pos1 = interval_.findclosing(pos1+1, interval_.par.length()) + 1;
1795 if ((interval_.par[pos1] == '{') && (interval_.par[pos1+1] == '}'))
1797 found.keytype = KeyInfo::isMain;
1798 found._dataStart = pos1;
1799 found._dataEnd = interval_.par.length();
1800 found.disabled = keys["foreignlanguage"].disabled;
1801 found.used = keys["foreignlanguage"].used;
1802 found._tokensize = pos1 - found._tokenstart;
1803 found.head = interval_.par.substr(found._tokenstart, found._tokensize);
1806 // Swallow possible optional params
1807 while (interval_.par[pos1] == '[') {
1808 pos1 = interval_.findclosing(pos1+1, interval_.par.length(), '[', ']')+1;
1810 // Swallow also the eventual parameter
1811 if (interval_.par[pos1] == '{') {
1812 found._dataEnd = interval_.findclosing(pos1+1, interval_.par.length()) + 1;
1815 found._dataEnd = pos1;
1817 found._dataStart = found._dataEnd;
1818 found._tokensize = count + found._dataEnd - pos;
1819 found.parenthesiscount = 0;
1820 found.head = interval_.par.substr(found._tokenstart, found._tokensize);
1821 found.disabled = true;
1825 // Handle "\end{...}"
1826 found._dataStart = pos + sub.str(0).length();
1827 found._dataEnd = found._dataStart;
1828 found._tokensize = count + found._dataEnd - pos;
1829 found.parenthesiscount = 0;
1830 found.head = interval_.par.substr(found._tokenstart, found._tokensize);
1831 found.disabled = true;
1835 else if (found.keytype != KeyInfo::isRegex) {
1836 found._tokenstart = sub.position(size_t(0));
1837 if (found.parenthesiscount == 0) {
1838 // Probably to be discarded
1839 size_t following_pos = sub.position(size_t(0)) + sub.str(3).length() + 1;
1840 char following = interval_.par[following_pos];
1841 if (following == ' ')
1842 found.head = "\\" + sub.str(3) + " ";
1843 else if (following == '=') {
1844 // like \uldepth=1000pt
1845 found.head = sub.str(0);
1848 found.head = "\\" + key;
1849 found._tokensize = found.head.length();
1850 found._dataEnd = found._tokenstart + found._tokensize;
1851 found._dataStart = found._dataEnd;
1854 int params = found._tokenstart + key.length() + 1;
1855 if (evaluatingOptional) {
1856 if (size_t(found._tokenstart) > optionalEnd) {
1857 evaluatingOptional = false;
1860 found.disabled = true;
1863 int optend = params;
1864 while (interval_.par[optend] == '[') {
1865 // discard optional parameters
1866 optend = interval_.findclosing(optend+1, interval_.par.length(), '[', ']') + 1;
1868 if (optend > params) {
1869 key += interval_.par.substr(params, optend-params);
1870 evaluatingOptional = true;
1871 optionalEnd = optend;
1873 string token = sub.str(5);
1874 int closings = found.parenthesiscount;
1875 if (found.parenthesiscount == 1) {
1876 found.head = "\\" + key + "{";
1878 else if (found.parenthesiscount > 1) {
1880 found.head = sub.str(0) + "{";
1881 closings = found.parenthesiscount - 1;
1884 found.head = "\\" + key + "{";
1887 found._tokensize = found.head.length();
1888 found._dataStart = found._tokenstart + found.head.length();
1889 if (found.keytype == KeyInfo::doRemove) {
1890 int endpar = 2 + interval_.findclosing(found._dataStart, interval_.par.length(), '{', '}', closings);
1891 found._dataStart = endpar;
1892 found._tokensize = found._dataStart - found._tokenstart;
1895 if (interval_.par.substr(found._dataStart-1, 15).compare("\\endarguments{}") == 0) {
1896 found._dataStart += 15;
1900 endpos = found._dataStart - 1;
1902 endpos = interval_.findclosing(found._dataStart, interval_.par.length(), '{', '}', closings);
1903 if (found.keytype == KeyInfo::isList) {
1904 // Check if it really is list env
1905 static regex const listre("^([a-z]+)$");
1907 if (!regex_match(token, sub2, listre)) {
1908 // Change the key of this entry. It is not in a list/item environment
1909 found.keytype = KeyInfo::endArguments;
1912 if (found.keytype == KeyInfo::noMain) {
1913 evaluatingCode = true;
1915 codeStart = found._dataStart;
1917 else if (evaluatingCode) {
1918 if (size_t(found._dataStart) > codeEnd)
1919 evaluatingCode = false;
1920 else if (found.keytype == KeyInfo::isMain) {
1921 // Disable this key, treate it as standard
1922 found.keytype = KeyInfo::isStandard;
1923 found.disabled = true;
1924 if ((codeEnd == interval_.par.length()) &&
1925 (found._tokenstart == codeStart)) {
1926 // trickery, because the code inset starts
1927 // with \selectlanguage ...
1929 if (entries_.size() > 1) {
1930 entries_[entries_.size()-1]._dataEnd = codeEnd;
1935 if ((endpos == interval_.par.length()) &&
1936 (found.keytype == KeyInfo::doRemove)) {
1937 // Missing closing => error in latex-input?
1938 // therefore do not delete remaining data
1939 found._dataStart -= 1;
1940 found._dataEnd = found._dataStart;
1943 found._dataEnd = endpos;
1945 if (isPatternString) {
1946 keys[key].used = true;
1949 entries_.push_back(found);
1953 void LatexInfo::makeKey(const string &keysstring, KeyInfo keyI, bool isPatternString)
1955 stringstream s(keysstring);
1957 const char delim = '|';
1958 while (getline(s, key, delim)) {
1959 KeyInfo keyII(keyI);
1960 if (isPatternString) {
1963 else if ( !keys[key].used)
1964 keyII.disabled = true;
1969 void LatexInfo::buildKeys(bool isPatternString)
1972 static bool keysBuilt = false;
1973 if (keysBuilt && !isPatternString) return;
1975 // Known standard keys with 1 parameter.
1976 // Split is done, if not at start of region
1977 makeKey("textsf|textss|texttt", KeyInfo(KeyInfo::isStandard, 1, ignoreFormats.getFamily()), isPatternString);
1978 makeKey("textbf", KeyInfo(KeyInfo::isStandard, 1, ignoreFormats.getSeries()), isPatternString);
1979 makeKey("textit|textsc|textsl", KeyInfo(KeyInfo::isStandard, 1, ignoreFormats.getShape()), isPatternString);
1980 makeKey("uuline|uline|uwave", KeyInfo(KeyInfo::isStandard, 1, ignoreFormats.getUnderline()), isPatternString);
1981 makeKey("emph|noun", KeyInfo(KeyInfo::isStandard, 1, ignoreFormats.getMarkUp()), isPatternString);
1982 makeKey("sout|xout", KeyInfo(KeyInfo::isStandard, 1, ignoreFormats.getStrikeOut()), isPatternString);
1984 makeKey("section|subsection|subsubsection|paragraph|subparagraph|minisec",
1985 KeyInfo(KeyInfo::isSectioning, 1, ignoreFormats.getSectioning()), isPatternString);
1986 makeKey("section*|subsection*|subsubsection*|paragraph*",
1987 KeyInfo(KeyInfo::isSectioning, 1, ignoreFormats.getSectioning()), isPatternString);
1988 makeKey("part|part*|chapter|chapter*", KeyInfo(KeyInfo::isSectioning, 1, ignoreFormats.getSectioning()), isPatternString);
1989 makeKey("title|subtitle|author|subject|publishers|dedication|uppertitleback|lowertitleback|extratitle|lyxaddress|lyxrightaddress", KeyInfo(KeyInfo::isTitle, 1, ignoreFormats.getFrontMatter()), isPatternString);
1991 makeKey("regexp", KeyInfo(KeyInfo::isRegex, 1, false), isPatternString);
1993 // Split is done, if not at start of region
1994 makeKey("textcolor", KeyInfo(KeyInfo::isStandard, 2, ignoreFormats.getColor()), isPatternString);
1995 makeKey("latexenvironment", KeyInfo(KeyInfo::isStandard, 2, false), isPatternString);
1997 // Split is done always.
1998 makeKey("foreignlanguage", KeyInfo(KeyInfo::isMain, 2, ignoreFormats.getLanguage()), isPatternString);
2002 makeKey("backslash|textbackslash|slash", KeyInfo(KeyInfo::isChar, 0, false), isPatternString);
2003 makeKey("textasciicircum|textasciitilde", KeyInfo(KeyInfo::isChar, 0, false), isPatternString);
2004 makeKey("textasciiacute|texemdash", KeyInfo(KeyInfo::isChar, 0, false), isPatternString);
2005 makeKey("dots|ldots", KeyInfo(KeyInfo::isChar, 0, false), isPatternString);
2007 makeKey("quad|qquad|hfill|dotfill", KeyInfo(KeyInfo::isChar, 0, false), isPatternString);
2008 makeKey("textvisiblespace|nobreakspace", KeyInfo(KeyInfo::isChar, 0, false), isPatternString);
2009 makeKey("negthickspace|negmedspace|negthinspace", KeyInfo(KeyInfo::isChar, 0, false), isPatternString);
2011 // makeKey("enskip|smallskip|medskip|bigskip|vfill", KeyInfo(KeyInfo::isChar, 0, false), isPatternString);
2012 // Custom space/skip, remove the content (== length value)
2013 makeKey("vspace|vspace*|hspace|hspace*|mspace", KeyInfo(KeyInfo::noContent, 1, false), isPatternString);
2014 // Found in fr/UserGuide.lyx
2015 makeKey("og|fg", KeyInfo(KeyInfo::isChar, 0, false), isPatternString);
2017 makeKey("textquotedbl|quotesinglbase|lyxarrow", KeyInfo(KeyInfo::isChar, 0, false), isPatternString);
2018 makeKey("textquotedblleft|textquotedblright", KeyInfo(KeyInfo::isChar, 0, false), isPatternString);
2019 // Known macros to remove (including their parameter)
2021 makeKey("input|inputencoding|label|ref|index|bibitem", KeyInfo(KeyInfo::doRemove, 1, false), isPatternString);
2022 makeKey("addtocounter|setlength", KeyInfo(KeyInfo::noContent, 2, true), isPatternString);
2023 // handle like standard keys with 1 parameter.
2024 makeKey("url|href|vref|thanks", KeyInfo(KeyInfo::isStandard, 1, false), isPatternString);
2026 // Ignore deleted text
2027 makeKey("lyxdeleted", KeyInfo(KeyInfo::doRemove, 3, false), isPatternString);
2028 // but preserve added text
2029 makeKey("lyxadded", KeyInfo(KeyInfo::doRemove, 2, false), isPatternString);
2031 // Macros to remove, but let the parameter survive
2033 makeKey("menuitem|textmd|textrm", KeyInfo(KeyInfo::isStandard, 1, true), isPatternString);
2035 // Remove language spec from content of these insets
2036 makeKey("code", KeyInfo(KeyInfo::noMain, 1, false), isPatternString);
2038 // Same effect as previous, parameter will survive (because there is no one anyway)
2040 makeKey("noindent|textcompwordmark|maketitle", KeyInfo(KeyInfo::isStandard, 0, true), isPatternString);
2041 // Remove table decorations
2042 makeKey("hline|tabularnewline|toprule|bottomrule|midrule", KeyInfo(KeyInfo::doRemove, 0, true), isPatternString);
2043 // Discard shape-header.
2044 // For footnote or shortcut too, because of lang settings
2045 // and wrong handling if used 'KeyInfo::noMain'
2046 makeKey("circlepar|diamondpar|heartpar|nutpar", KeyInfo(KeyInfo::isStandard, 1, true), isPatternString);
2047 makeKey("trianglerightpar|hexagonpar|starpar", KeyInfo(KeyInfo::isStandard, 1, true), isPatternString);
2048 makeKey("triangleuppar|triangledownpar|droppar", KeyInfo(KeyInfo::isStandard, 1, true), isPatternString);
2049 makeKey("triangleleftpar|shapepar|dropuppar", KeyInfo(KeyInfo::isStandard, 1, true), isPatternString);
2050 makeKey("hphantom|vphantom|footnote|shortcut|include|includegraphics", KeyInfo(KeyInfo::isStandard, 1, true), isPatternString);
2051 makeKey("parbox", KeyInfo(KeyInfo::doRemove, 1, true), isPatternString);
2052 // like ('tiny{}' or '\tiny ' ... )
2053 makeKey("footnotesize|tiny|scriptsize|small|large|Large|LARGE|huge|Huge", KeyInfo(KeyInfo::isSize, 0, false), isPatternString);
2055 // Survives, like known character
2056 makeKey("lyx|LyX|latex|LaTeX|latexe|LaTeXe|tex|TeX", KeyInfo(KeyInfo::isChar, 0, false), isPatternString);
2057 makeKey("item|listitem", KeyInfo(KeyInfo::isList, 1, false), isPatternString);
2059 makeKey("begin|end", KeyInfo(KeyInfo::isMath, 1, false), isPatternString);
2060 makeKey("[|]", KeyInfo(KeyInfo::isMath, 1, false), isPatternString);
2061 makeKey("$", KeyInfo(KeyInfo::isMath, 1, false), isPatternString);
2063 makeKey("par|uldepth|ULdepth|protect|nobreakdash|medskip|relax", KeyInfo(KeyInfo::isStandard, 0, true), isPatternString);
2064 // Remove RTL/LTR marker
2065 makeKey("l|r|textlr|textfr|textar|beginl|endl", KeyInfo(KeyInfo::isStandard, 0, true), isPatternString);
2066 makeKey("lettrine", KeyInfo(KeyInfo::cleanToStart, 0, true), isPatternString);
2067 makeKey("lyxslide", KeyInfo(KeyInfo::isSectioning, 1, true), isPatternString);
2068 makeKey("endarguments", KeyInfo(KeyInfo::endArguments, 0, true), isPatternString);
2069 makeKey("twocolumn", KeyInfo(KeyInfo::removeWithArg, 2, true), isPatternString);
2070 makeKey("tnotetext|ead|fntext|cortext|address", KeyInfo(KeyInfo::removeWithArg, 0, true), isPatternString);
2071 makeKey("lyxend", KeyInfo(KeyInfo::isStandard, 0, true), isPatternString);
2072 if (isPatternString) {
2073 // Allow the first searched string to rebuild the keys too
2077 // no need to rebuild again
2083 * Keep the list of actual opened parentheses actual
2084 * (e.g. depth == 4 means there are 4 '{' not processed yet)
2086 void Intervall::handleParentheses(int lastpos, bool closingAllowed)
2089 for (int i = depts[actualdeptindex]; i < lastpos; i+= 1 + skip) {
2093 if (c == '\\') skip = 1;
2094 else if (c == '{') {
2097 else if (c == '}') {
2098 handleCloseP(i, closingAllowed);
2104 string Intervall::show(int lastpos)
2106 int idx = 0; /* int intervalls */
2109 for (idx = 0; idx <= ignoreidx; idx++) {
2110 while (i < lastpos) {
2112 if (i <= borders[idx].low) {
2113 if (borders[idx].low > lastpos)
2114 printsize = lastpos - i;
2116 printsize = borders[idx].low - i;
2117 s += par.substr(i, printsize);
2119 if (i >= borders[idx].low)
2120 i = borders[idx].upper;
2123 i = borders[idx].upper;
2129 s += par.substr(i, lastpos-i);
2135 void Intervall::output(ostringstream &os, int lastpos)
2137 // get number of chars to output
2138 int idx = 0; /* int intervalls */
2141 string startTitle = titleValue;
2142 for (idx = 0; idx <= ignoreidx; idx++) {
2144 if (i <= borders[idx].low) {
2146 if (borders[idx].low > lastpos)
2147 printsize = lastpos - i;
2149 printsize = borders[idx].low - i;
2150 if (printsize > 0) {
2151 os << startTitle << par.substr(i, printsize);
2153 printed += printsize;
2156 handleParentheses(i, false);
2157 if (i >= borders[idx].low)
2158 i = borders[idx].upper;
2161 i = borders[idx].upper;
2168 os << startTitle << par.substr(i, lastpos-i);
2169 printed += lastpos-i;
2171 handleParentheses(lastpos, false);
2173 if (keys["foreignlanguage"].disabled)
2174 startindex = actualdeptindex-langcount;
2176 startindex = actualdeptindex;
2177 for (int i = startindex; i > 0; --i) {
2180 if (hasTitle && (printed > 0))
2182 if (! isPatternString_)
2184 handleParentheses(lastpos, true); /* extra closings '}' allowed here */
2187 void LatexInfo::processRegion(int start, int region_end)
2189 while (start < region_end) { /* Let {[} and {]} survive */
2190 int cnt = interval_.isOpeningPar(start);
2192 // Closing is allowed past the region
2193 int closing = interval_.findclosing(start+1, interval_.par.length());
2194 interval_.addIntervall(start, start+1);
2195 interval_.addIntervall(closing, closing+1);
2199 start = interval_.nextNotIgnored(start+1);
2203 void LatexInfo::removeHead(KeyInfo const & actual, int count)
2205 if (actual.parenthesiscount == 0) {
2206 // "{\tiny{} ...}" ==> "{{} ...}"
2207 interval_.addIntervall(actual._tokenstart-count, actual._tokenstart + actual._tokensize);
2210 // Remove header hull, that is "\url{abcd}" ==> "abcd"
2211 interval_.addIntervall(actual._tokenstart - count, actual._dataStart);
2212 interval_.addIntervall(actual._dataEnd, actual._dataEnd+1);
2216 int LatexInfo::dispatch(ostringstream &os, int previousStart, KeyInfo &actual)
2219 switch (actual.keytype)
2221 case KeyInfo::isTitle: {
2223 nextKeyIdx = getNextKey();
2226 case KeyInfo::cleanToStart: {
2227 actual._dataEnd = actual._dataStart;
2228 nextKeyIdx = getNextKey();
2229 // Search for end of arguments
2230 int tmpIdx = find(nextKeyIdx, KeyInfo::endArguments);
2232 for (int i = nextKeyIdx; i <= tmpIdx; i++) {
2233 entries_[i].disabled = true;
2235 actual._dataEnd = entries_[tmpIdx]._dataEnd;
2237 while (interval_.par[actual._dataEnd] == ' ')
2239 interval_.addIntervall(0, actual._dataEnd+1);
2240 interval_.actualdeptindex = 0;
2241 interval_.depts[0] = actual._dataEnd+1;
2242 interval_.closes[0] = -1;
2245 case KeyInfo::noContent: { /* char like "\hspace{2cm}" */
2246 if (actual.disabled)
2247 interval_.addIntervall(actual._tokenstart, actual._dataEnd);
2249 interval_.addIntervall(actual._dataStart, actual._dataEnd);
2252 case KeyInfo::isChar: {
2253 nextKeyIdx = getNextKey();
2256 case KeyInfo::isSize: {
2257 if (actual.disabled || (interval_.par[actual._dataStart] != '{') || (interval_.par[actual._dataStart-1] == ' ')) {
2258 processRegion(actual._dataEnd, actual._dataEnd+1); /* remove possibly following {} */
2259 interval_.addIntervall(actual._tokenstart, actual._dataEnd+1);
2260 nextKeyIdx = getNextKey();
2262 // Here _dataStart points to '{', so correct it
2263 actual._dataStart += 1;
2264 actual._tokensize += 1;
2265 actual.parenthesiscount = 1;
2266 if (interval_.par[actual._dataStart] == '}') {
2267 // Determine the end if used like '{\tiny{}...}'
2268 actual._dataEnd = interval_.findclosing(actual._dataStart+1, interval_.par.length()) + 1;
2269 interval_.addIntervall(actual._dataStart, actual._dataStart+1);
2272 // Determine the end if used like '\tiny{...}'
2273 actual._dataEnd = interval_.findclosing(actual._dataStart, interval_.par.length()) + 1;
2275 // Split on this key if not at start
2276 int start = interval_.nextNotIgnored(previousStart);
2277 if (start < actual._tokenstart) {
2278 interval_.output(os, actual._tokenstart);
2279 interval_.addIntervall(start, actual._tokenstart);
2281 // discard entry if at end of actual
2282 nextKeyIdx = process(os, actual);
2286 case KeyInfo::endArguments:
2287 // Remove trailing '{}' too
2288 actual._dataStart += 1;
2289 actual._dataEnd += 1;
2290 interval_.addIntervall(actual._tokenstart, actual._dataEnd+1);
2291 nextKeyIdx = getNextKey();
2293 case KeyInfo::noMain:
2295 case KeyInfo::isStandard: {
2296 if (actual.disabled) {
2298 processRegion(actual._dataStart, actual._dataStart+1);
2299 nextKeyIdx = getNextKey();
2301 // Split on this key if not at datastart of calling entry
2302 int start = interval_.nextNotIgnored(previousStart);
2303 if (start < actual._tokenstart) {
2304 interval_.output(os, actual._tokenstart);
2305 interval_.addIntervall(start, actual._tokenstart);
2307 // discard entry if at end of actual
2308 nextKeyIdx = process(os, actual);
2312 case KeyInfo::removeWithArg: {
2313 nextKeyIdx = getNextKey();
2314 // Search for end of arguments
2315 int tmpIdx = find(nextKeyIdx, KeyInfo::endArguments);
2317 for (int i = nextKeyIdx; i <= tmpIdx; i++) {
2318 entries_[i].disabled = true;
2320 actual._dataEnd = entries_[tmpIdx]._dataEnd;
2322 interval_.addIntervall(actual._tokenstart, actual._dataEnd+1);
2325 case KeyInfo::doRemove: {
2326 // Remove the key with all parameters and following spaces
2328 for (pos = actual._dataEnd+1; pos < interval_.par.length(); pos++) {
2329 if ((interval_.par[pos] != ' ') && (interval_.par[pos] != '%'))
2332 // Remove also enclosing parentheses [] and {}
2335 while (actual._tokenstart > numpars) {
2336 if (pos+numpars >= interval_.par.size())
2338 else if (interval_.par[pos+numpars] == ']' && interval_.par[actual._tokenstart-numpars-1] == '[')
2340 else if (interval_.par[pos+numpars] == '}' && interval_.par[actual._tokenstart-numpars-1] == '{')
2346 if (interval_.par[pos+numpars] == ' ')
2350 interval_.addIntervall(actual._tokenstart-numpars, pos+numpars+spaces);
2351 nextKeyIdx = getNextKey();
2354 case KeyInfo::isList: {
2355 // Discard space before _tokenstart
2357 for (count = 0; count < actual._tokenstart; count++) {
2358 if (interval_.par[actual._tokenstart-count-1] != ' ')
2361 nextKeyIdx = getNextKey();
2362 int tmpIdx = find(nextKeyIdx, KeyInfo::endArguments);
2364 // Special case: \item is not a list, but a command (like in Style Author_Biography in maa-monthly.layout)
2366 // How else can we catch this one?
2367 for (int i = nextKeyIdx; i <= tmpIdx; i++) {
2368 entries_[i].disabled = true;
2370 actual._dataEnd = entries_[tmpIdx]._dataEnd;
2372 else if (nextKeyIdx > 0) {
2373 // Ignore any lang entries inside data region
2374 for (int i = nextKeyIdx; i < int(entries_.size()) && entries_[i]._tokenstart < actual._dataEnd; i++) {
2375 if (entries_[i].keytype == KeyInfo::isMain)
2376 entries_[i].disabled = true;
2379 if (actual.disabled) {
2380 interval_.addIntervall(actual._tokenstart-count, actual._dataEnd+1);
2383 interval_.addIntervall(actual._tokenstart-count, actual._tokenstart);
2385 if (interval_.par[actual._dataEnd+1] == '[') {
2386 int posdown = interval_.findclosing(actual._dataEnd+2, interval_.par.length(), '[', ']');
2387 if ((interval_.par[actual._dataEnd+2] == '{') &&
2388 (interval_.par[posdown-1] == '}')) {
2389 interval_.addIntervall(actual._dataEnd+1,actual._dataEnd+3);
2390 interval_.addIntervall(posdown-1, posdown+1);
2393 interval_.addIntervall(actual._dataEnd+1, actual._dataEnd+2);
2394 interval_.addIntervall(posdown, posdown+1);
2396 int blk = interval_.nextNotIgnored(actual._dataEnd+1);
2397 if (blk > posdown) {
2398 // Discard at most 1 space after empty item
2400 for (count = 0; count < 1; count++) {
2401 if (interval_.par[blk+count] != ' ')
2405 interval_.addIntervall(blk, blk+count);
2410 case KeyInfo::isSectioning: {
2411 // Discard spaces before _tokenstart
2413 int val = actual._tokenstart;
2414 for (count = 0; count < actual._tokenstart;) {
2415 val = interval_.previousNotIgnored(val-1);
2416 if (val < 0 || interval_.par[val] != ' ')
2419 count = actual._tokenstart - val;
2422 if (actual.disabled) {
2423 removeHead(actual, count);
2424 nextKeyIdx = getNextKey();
2426 interval_.addIntervall(actual._tokenstart-count, actual._tokenstart);
2427 nextKeyIdx = process(os, actual);
2431 case KeyInfo::isMath: {
2432 // Same as regex, use the content unchanged
2433 nextKeyIdx = getNextKey();
2436 case KeyInfo::isRegex: {
2437 // DO NOT SPLIT ON REGEX
2439 nextKeyIdx = getNextKey();
2442 case KeyInfo::isIgnored: {
2443 // Treat like a character for now
2444 nextKeyIdx = getNextKey();
2447 case KeyInfo::isMain: {
2448 if (interval_.par.substr(actual._dataStart, 2) == "% ")
2449 interval_.addIntervall(actual._dataStart, actual._dataStart+2);
2450 if (actual._tokenstart > 0) {
2451 int prev = interval_.previousNotIgnored(actual._tokenstart - 1);
2452 if ((prev >= 0) && interval_.par[prev] == '%')
2453 interval_.addIntervall(prev, prev+1);
2455 if (actual.disabled) {
2457 interval_.langcount++;
2458 if ((interval_.par.substr(actual._dataStart, 3) == " \\[") ||
2459 (interval_.par.substr(actual._dataStart, 8) == " \\begin{")) {
2460 // Discard also the space before math-equation
2461 interval_.addIntervall(actual._dataStart, actual._dataStart+1);
2463 nextKeyIdx = getNextKey();
2464 // interval.resetOpenedP(actual._dataStart-1);
2467 if (actual._tokenstart < 26) {
2468 // for the first (and maybe dummy) language
2469 interval_.setForDefaultLang(actual);
2471 interval_.resetOpenedP(actual._dataStart-1);
2475 case KeyInfo::invalid:
2476 // This cannot happen, already handled
2479 // LYXERR(Debug::INFO, "Unhandled keytype");
2480 nextKeyIdx = getNextKey();
2487 int LatexInfo::process(ostringstream & os, KeyInfo const & actual )
2489 int end = interval_.nextNotIgnored(actual._dataEnd);
2490 int oldStart = actual._dataStart;
2491 int nextKeyIdx = getNextKey();
2493 if ((nextKeyIdx < 0) ||
2494 (entries_[nextKeyIdx]._tokenstart >= actual._dataEnd) ||
2495 (entries_[nextKeyIdx].keytype == KeyInfo::invalid)) {
2496 if (oldStart <= end) {
2497 processRegion(oldStart, end);
2502 KeyInfo &nextKey = getKeyInfo(nextKeyIdx);
2504 if ((nextKey.keytype == KeyInfo::isMain) && !nextKey.disabled) {
2505 (void) dispatch(os, actual._dataStart, nextKey);
2506 end = nextKey._tokenstart;
2509 processRegion(oldStart, nextKey._tokenstart);
2510 nextKeyIdx = dispatch(os, actual._dataStart, nextKey);
2512 oldStart = nextKey._dataEnd+1;
2514 // now nextKey is either invalid or is outside of actual._dataEnd
2515 // output the remaining and discard myself
2516 if (oldStart <= end) {
2517 processRegion(oldStart, end);
2519 if (interval_.par.size() > (size_t) end && interval_.par[end] == '}') {
2521 // This is the normal case.
2522 // But if using the firstlanguage, the closing may be missing
2524 // get minimum of 'end' and 'actual._dataEnd' in case that the nextKey.keytype was 'KeyInfo::isMain'
2526 if (actual._dataEnd < end)
2527 output_end = interval_.nextNotIgnored(actual._dataEnd);
2529 output_end = interval_.nextNotIgnored(end);
2530 if ((actual.keytype == KeyInfo::isMain) && actual.disabled) {
2531 interval_.addIntervall(actual._tokenstart, actual._tokenstart+actual._tokensize);
2533 // Remove possible empty data
2534 int dstart = interval_.nextNotIgnored(actual._dataStart);
2535 while (interval_.isOpeningPar(dstart) == 1) {
2536 interval_.addIntervall(dstart, dstart+1);
2537 int dend = interval_.findclosing(dstart+1, output_end);
2538 interval_.addIntervall(dend, dend+1);
2539 dstart = interval_.nextNotIgnored(dstart+1);
2541 if (dstart < output_end)
2542 interval_.output(os, output_end);
2543 interval_.addIntervall(actual._tokenstart, end);
2547 string splitOnKnownMacros(string par, bool isPatternString)
2550 LatexInfo li(par, isPatternString);
2551 // LYXERR(Debug::INFO, "Berfore split: " << par);
2552 KeyInfo DummyKey = KeyInfo(KeyInfo::KeyType::isMain, 2, true);
2554 DummyKey._tokensize = 0;
2555 DummyKey._dataStart = 0;
2556 DummyKey._dataEnd = par.length();
2557 DummyKey.disabled = true;
2558 int firstkeyIdx = li.getFirstKey();
2560 if (firstkeyIdx >= 0) {
2561 KeyInfo firstKey = li.getKeyInfo(firstkeyIdx);
2562 DummyKey._tokenstart = firstKey._tokenstart;
2564 if ((firstKey.keytype != KeyInfo::isMain) || firstKey.disabled) {
2565 // Use dummy firstKey
2566 firstKey = DummyKey;
2567 (void) li.setNextKey(firstkeyIdx);
2570 if (par.substr(firstKey._dataStart, 2) == "% ")
2571 li.addIntervall(firstKey._dataStart, firstKey._dataStart+2);
2573 nextkeyIdx = li.process(os, firstKey);
2574 while (nextkeyIdx >= 0) {
2575 // Check for a possible gap between the last
2576 // entry and this one
2577 int datastart = li.nextNotIgnored(firstKey._dataStart);
2578 KeyInfo &nextKey = li.getKeyInfo(nextkeyIdx);
2579 if ((nextKey._tokenstart > datastart)) {
2581 firstKey._dataStart = datastart;
2582 firstKey._dataEnd = par.length();
2583 (void) li.setNextKey(nextkeyIdx);
2584 // Fake the last opened parenthesis
2585 li.setForDefaultLang(firstKey);
2586 nextkeyIdx = li.process(os, firstKey);
2589 if (nextKey.keytype != KeyInfo::isMain) {
2590 firstKey._dataStart = datastart;
2591 firstKey._dataEnd = nextKey._dataEnd+1;
2592 (void) li.setNextKey(nextkeyIdx);
2593 li.setForDefaultLang(firstKey);
2594 nextkeyIdx = li.process(os, firstKey);
2597 nextkeyIdx = li.process(os, nextKey);
2601 // Handle the remaining
2602 firstKey._dataStart = li.nextNotIgnored(firstKey._dataStart);
2603 firstKey._dataEnd = par.length();
2605 if ((firstKey._dataStart < firstKey._dataEnd) &&
2606 (par[firstKey._dataStart] != '}')) {
2607 li.setForDefaultLang(firstKey);
2608 (void) li.process(os, firstKey);
2612 // return string definitelly impossible to match
2613 s = "\\foreignlanguage{ignore}{ }";
2617 s = par; /* no known macros found */
2618 // LYXERR(Debug::INFO, "After split: " << s);
2623 * Try to unify the language specs in the latexified text.
2624 * Resulting modified string is set to "", if
2625 * the searched tex does not contain all the features in the search pattern
2627 static string correctlanguagesetting(string par, bool isPatternString, bool withformat)
2629 static Features regex_f;
2630 static int missed = 0;
2631 static bool regex_with_format = false;
2633 int parlen = par.length();
2635 while ((parlen > 0) && (par[parlen-1] == '\n')) {
2638 if (isPatternString && (parlen > 0) && (par[parlen-1] == '~')) {
2639 // Happens to be there in case of description or labeling environment
2644 // Split the latex input into pieces which
2645 // can be digested by our search engine
2646 LYXERR(Debug::FIND, "input: \"" << par << "\"");
2647 result = splitOnKnownMacros(par.substr(0,parlen), isPatternString);
2648 LYXERR(Debug::FIND, "After split: \"" << result << "\"");
2651 result = par.substr(0, parlen);
2652 if (isPatternString) {
2655 regex_f = identifyFeatures(result);
2656 string features = "";
2657 for (auto it = regex_f.cbegin(); it != regex_f.cend(); ++it) {
2658 string a = it->first;
2659 regex_with_format = true;
2660 features += " " + a;
2661 // LYXERR(Debug::INFO, "Identified regex format:" << a);
2663 LYXERR(Debug::FIND, "Identified Features" << features);
2666 } else if (regex_with_format) {
2667 Features info = identifyFeatures(result);
2668 for (auto it = regex_f.cbegin(); it != regex_f.cend(); ++it) {
2669 string a = it->first;
2670 bool b = it->second;
2671 if (b && ! info[a]) {
2673 LYXERR(Debug::FIND, "Missed(" << missed << " " << a <<", srclen = " << parlen );
2679 // LYXERR(Debug::INFO, "No regex formats");
2685 // Remove trailing closure of math, macros and environments, so to catch parts of them.
2686 static int identifyClosing(string & t)
2688 int open_braces = 0;
2690 LYXERR(Debug::FIND, "identifyClosing(): t now is '" << t << "'");
2691 if (regex_replace(t, t, "(.*[^\\\\])\\$" REGEX_EOS, "$1"))
2693 if (regex_replace(t, t, "(.*[^\\\\])\\\\\\]" REGEX_EOS, "$1"))
2695 if (regex_replace(t, t, "(.*[^\\\\])\\\\end\\{[a-zA-Z_]*\\*?\\}" REGEX_EOS, "$1"))
2697 if (regex_replace(t, t, "(.*[^\\\\])\\}" REGEX_EOS, "$1")) {
2706 static int num_replaced = 0;
2707 static bool previous_single_replace = true;
2709 MatchStringAdv::MatchStringAdv(lyx::Buffer & buf, FindAndReplaceOptions const & opt)
2710 : p_buf(&buf), p_first_buf(&buf), opt(opt)
2712 Buffer & find_buf = *theBufferList().getBuffer(FileName(to_utf8(opt.find_buf_name)), true);
2713 docstring const & ds = stringifySearchBuffer(find_buf, opt);
2714 use_regexp = lyx::to_utf8(ds).find("\\regexp{") != std::string::npos;
2715 if (opt.replace_all && previous_single_replace) {
2716 previous_single_replace = false;
2719 else if (!opt.replace_all) {
2720 num_replaced = 0; // count number of replaced strings
2721 previous_single_replace = true;
2723 // When using regexp, braces are hacked already by escape_for_regex()
2724 par_as_string = normalize(ds, !use_regexp);
2726 close_wildcards = 0;
2728 size_t lead_size = 0;
2729 // correct the language settings
2730 par_as_string = correctlanguagesetting(par_as_string, true, !opt.ignoreformat);
2731 if (opt.ignoreformat) {
2733 // if par_as_string_nolead were emty,
2734 // the following call to findAux will always *find* the string
2735 // in the checked data, and thus always using the slow
2736 // examining of the current text part.
2737 par_as_string_nolead = par_as_string;
2740 lead_size = identifyLeading(par_as_string);
2741 LYXERR(Debug::FIND, "Lead_size: " << lead_size);
2742 lead_as_string = par_as_string.substr(0, lead_size);
2743 par_as_string_nolead = par_as_string.substr(lead_size, par_as_string.size() - lead_size);
2747 open_braces = identifyClosing(par_as_string);
2748 identifyClosing(par_as_string_nolead);
2749 LYXERR(Debug::FIND, "Open braces: " << open_braces);
2750 LYXERR(Debug::FIND, "Built MatchStringAdv object: par_as_string = '" << par_as_string << "'");
2752 string lead_as_regexp;
2753 if (lead_size > 0) {
2754 // @todo No need to search for \regexp{} insets in leading material
2755 lead_as_regexp = escape_for_regex(par_as_string.substr(0, lead_size), !opt.ignoreformat);
2756 par_as_string = par_as_string_nolead;
2757 LYXERR(Debug::FIND, "lead_as_regexp is '" << lead_as_regexp << "'");
2758 LYXERR(Debug::FIND, "par_as_string now is '" << par_as_string << "'");
2760 par_as_string = escape_for_regex(par_as_string, !opt.ignoreformat);
2761 // Insert (.*?) before trailing closure of math, macros and environments, so to catch parts of them.
2762 LYXERR(Debug::FIND, "par_as_string now is '" << par_as_string << "'");
2764 // Insert .* before trailing '\$' ('$' has been escaped by escape_for_regex)
2765 regex_replace(par_as_string, par_as_string, "(.*[^\\\\])(\\\\\\$)\\'", "$1(.*?)$2")
2766 // Insert .* before trailing '\\\]' ('\]' has been escaped by escape_for_regex)
2767 || regex_replace(par_as_string, par_as_string, "(.*[^\\\\])( \\\\\\\\\\\\\\])\\'", "$1(.*?)$2")
2768 // Insert .* before trailing '\\end\{...}' ('\end{...}' has been escaped by escape_for_regex)
2769 || regex_replace(par_as_string, par_as_string,
2770 "(.*[^\\\\])( \\\\\\\\end\\\\\\{[a-zA-Z_]*)(\\\\\\*)?(\\\\\\})\\'", "$1(.*?)$2$3$4")
2771 // Insert .* before trailing '\}' ('}' has been escaped by escape_for_regex)
2772 || regex_replace(par_as_string, par_as_string, "(.*[^\\\\])(\\\\\\})\\'", "$1(.*?)$2")
2776 if (!opt.ignoreformat) {
2777 // Remove extra '\}' at end if not part of \{\.\}
2778 size_t lng = par_as_string.size();
2780 if (par_as_string.substr(lng-2, 2).compare("\\}") == 0) {
2782 if (par_as_string.substr(lng-6,3).compare("\\{\\") == 0)
2791 if (lng < par_as_string.size())
2792 par_as_string = par_as_string.substr(0,lng);
2795 regex_replace(par_as_string, par_as_string, "\\\\\\.", "_xxbdotxx_");
2796 // handle '.' -> '[^]', replace later as '[^\}\{\\]'
2797 regex_replace(par_as_string, par_as_string, "\\.", "[^]");
2798 // replace '[^...]' with '[^...\}\{\\]'
2799 regex_replace(par_as_string, par_as_string, "\\[\\^([^\\\\\\]]*)\\]", "_xxbrlxx_$1\\}\\{\\\\_xxbrrxx_");
2800 regex_replace(par_as_string, par_as_string, "_xxbrlxx_", "[^");
2801 regex_replace(par_as_string, par_as_string, "_xxbrrxx_", "]");
2803 regex_replace(par_as_string, par_as_string, "_xxbdotxx_", "\\.");
2806 LYXERR(Debug::FIND, "par_as_string now is '" << par_as_string << "'");
2807 LYXERR(Debug::FIND, "Open braces: " << open_braces);
2808 LYXERR(Debug::FIND, "Close .*? : " << close_wildcards);
2809 LYXERR(Debug::FIND, "Replaced text (to be used as regex): " << par_as_string);
2811 // If entered regexp must match at begin of searched string buffer
2812 // Kornel: Added parentheses to use $1 for size of the leading string
2816 // TODO: Adapt '\[12345678]' in par_as_string to acount for the first '()
2817 // Unfortunately is '\1', '\2', etc not working for strings with extra format
2818 // so the convert has no effect in that case
2819 for (int i = 8; i > 0; --i) {
2820 string orig = "\\\\" + std::to_string(i);
2821 string dest = "\\" + std::to_string(i+1);
2822 while (regex_replace(par_as_string, par_as_string, orig, dest));
2824 regexp_str = "(" + lead_as_regexp + ")" + par_as_string;
2825 regexp2_str = "(" + lead_as_regexp + ").*?" + par_as_string;
2827 LYXERR(Debug::FIND, "Setting regexp to : '" << regexp_str << "'");
2828 regexp = lyx::regex(regexp_str);
2830 LYXERR(Debug::FIND, "Setting regexp2 to: '" << regexp2_str << "'");
2831 regexp2 = lyx::regex(regexp2_str);
2836 // Count number of characters in string
2840 // \\[a-zA-Z]+ ==> 1
2841 static int computeSize(string s, int len)
2847 for (int i = 0; i < len; i += skip, count++) {
2850 if (isalpha(s[i+1])) {
2851 for (int j = 2; i+j < len; j++) {
2852 if (! isalpha(s[i+j])) {
2855 else if ((s[i+j] == '{') && s[i+j+1] == '}')
2857 else if ((s[i+j] == '{') && (i + j + 1 >= len))
2865 else if (s[i] == '{') {
2871 else if (s[i] == '-') {
2872 if (s[i+1] == '-') {
2888 MatchResult MatchStringAdv::findAux(DocIterator const & cur, int len, bool at_begin) const
2893 (opt.restr == FindAndReplaceOptions::R_ONLY_MATHS && !cur.inMathed()) )
2896 docstring docstr = stringifyFromForSearch(opt, cur, len);
2897 string str = normalize(docstr, true);
2898 if (!opt.ignoreformat) {
2899 str = correctlanguagesetting(str, false, !opt.ignoreformat);
2902 mres.match_len = -1;
2905 LYXERR(Debug::FIND, "Matching against '" << lyx::to_utf8(docstr) << "'");
2906 LYXERR(Debug::FIND, "After normalization: '" << str << "'");
2909 LYXERR(Debug::FIND, "Searching in regexp mode: at_begin=" << at_begin);
2910 regex const *p_regexp;
2911 regex_constants::match_flag_type flags;
2913 flags = regex_constants::match_continuous;
2916 flags = regex_constants::match_default;
2917 p_regexp = ®exp2;
2919 sregex_iterator re_it(str.begin(), str.end(), *p_regexp, flags);
2920 if (re_it == sregex_iterator())
2922 match_results<string::const_iterator> const & m = *re_it;
2924 if (0) { // Kornel Benko: DO NOT CHECKK
2925 // Check braces on the segment that matched the entire regexp expression,
2926 // plus the last subexpression, if a (.*?) was inserted in the constructor.
2927 if (!braces_match(m[0].first, m[0].second, open_braces))
2931 // Check braces on segments that matched all (.*?) subexpressions,
2932 // except the last "padding" one inserted by lyx.
2933 for (size_t i = 1; i < m.size() - 1; ++i)
2934 if (!braces_match(m[i].first, m[i].second, open_braces))
2937 // Exclude from the returned match length any length
2938 // due to close wildcards added at end of regexp
2939 // and also the length of the leading (e.g. '\emph{}')
2941 // Whole found string, including the leading: m[0].second - m[0].first
2942 // Size of the leading string: m[1].second - m[1].first
2943 int leadingsize = 0;
2945 leadingsize = m[1].second - m[1].first;
2947 for (size_t i = 0; i < m.size(); i++) {
2948 LYXERR(Debug::FIND, "Match " << i << " is " << m[i].second - m[i].first << " long");
2950 if (close_wildcards == 0)
2951 result = m[0].second - m[0].first;
2954 result = m[m.size() - close_wildcards].first - m[0].first;
2956 size_t pos = m.position(size_t(0));
2957 // Ignore last closing characters
2958 while (result > 0) {
2959 if (str[pos+result-1] == '}')
2964 if (result > leadingsize)
2965 result -= leadingsize;
2968 mres.match_len = computeSize(str.substr(pos+leadingsize,result), result);
2969 mres.match2end = str.size() - pos - leadingsize;
2970 mres.pos = pos+leadingsize;
2974 // else !use_regexp: but all code paths above return
2975 LYXERR(Debug::FIND, "Searching in normal mode: par_as_string='"
2976 << par_as_string << "', str='" << str << "'");
2977 LYXERR(Debug::FIND, "Searching in normal mode: lead_as_string='"
2978 << lead_as_string << "', par_as_string_nolead='"
2979 << par_as_string_nolead << "'");
2982 LYXERR(Debug::FIND, "size=" << par_as_string.size()
2983 << ", substr='" << str.substr(0, par_as_string.size()) << "'");
2984 if (str.substr(0, par_as_string.size()) == par_as_string) {
2985 mres.match_len = par_as_string.size();
2986 mres.match2end = str.size();
2991 // Start the search _after_ the leading part
2992 size_t pos = str.find(par_as_string_nolead, lead_as_string.size());
2993 if (pos != string::npos) {
2994 mres.match_len = par_as_string.size();
2995 mres.match2end = str.size() - pos;
3004 MatchResult MatchStringAdv::operator()(DocIterator const & cur, int len, bool at_begin) const
3006 MatchResult mres = findAux(cur, len, at_begin);
3007 int res = mres.match_len;
3009 "res=" << res << ", at_begin=" << at_begin
3010 << ", matchword=" << opt.matchword
3011 << ", inTexted=" << cur.inTexted());
3012 if (res == 0 || !at_begin || !opt.matchword || !cur.inTexted())
3014 if ((len > 0) && (res < len)) {
3018 Paragraph const & par = cur.paragraph();
3019 bool ws_left = (cur.pos() > 0)
3020 ? par.isWordSeparator(cur.pos() - 1)
3026 ws_right = (cur.pos() + len < par.size())
3027 ? par.isWordSeparator(cur.pos() + len)
3031 "cur.pos()=" << cur.pos() << ", res=" << res
3032 << ", separ: " << ws_left << ", " << ws_right
3035 if (ws_left && ws_right) {
3036 // Check for word separators inside the found 'word'
3037 for (int i = 0; i < len; i++) {
3038 if (par.isWordSeparator(cur.pos() + i)) {
3050 string MatchStringAdv::normalize(docstring const & s, bool hack_braces) const
3053 if (! opt.casesensitive)
3054 t = lyx::to_utf8(lowercase(s));
3056 t = lyx::to_utf8(s);
3057 // Remove \n at begin
3058 while (!t.empty() && t[0] == '\n')
3061 while (!t.empty() && t[t.size() - 1] == '\n')
3062 t = t.substr(0, t.size() - 1);
3064 // Handle all other '\n'
3065 while ((pos = t.find("\n")) != string::npos) {
3066 if (pos > 1 && t[pos-1] == '\\' && t[pos-2] == '\\' ) {
3068 if (isAlnumASCII(t[pos+1])) {
3069 t.replace(pos-2, 3, " ");
3072 t.replace(pos-2, 3, "");
3075 else if (!isAlnumASCII(t[pos+1]) || !isAlnumASCII(t[pos-1])) {
3076 // '\n' adjacent to non-alpha-numerics, discard
3077 t.replace(pos, 1, "");
3080 // Replace all other \n with spaces
3081 t.replace(pos, 1, " ");
3084 // Remove stale empty \emph{}, \textbf{} and similar blocks from latexify
3085 // Kornel: Added textsl, textsf, textit, texttt and noun
3086 // + allow to seach for colored text too
3087 LYXERR(Debug::FIND, "Removing stale empty \\emph{}, \\textbf{}, \\*section{} macros from: " << t);
3088 while (regex_replace(t, t, "\\\\(emph|noun|text(bf|sl|sf|it|tt)|(u|uu)line|(s|x)out|uwave)(\\{(\\{\\})?\\})+", ""))
3089 LYXERR(Debug::FIND, " further removing stale empty \\emph{}, \\textbf{} macros from: " << t);
3090 while (regex_replace(t, t, "\\\\((sub)?(((sub)?section)|paragraph)|part)\\*?(\\{(\\{\\})?\\})+", ""))
3091 LYXERR(Debug::FIND, " further removing stale empty \\emph{}, \\textbf{} macros from: " << t);
3093 while (regex_replace(t, t, "\\\\(foreignlanguage|textcolor|item)\\{[a-z]+\\}(\\{(\\{\\})?\\})+", ""));
3094 // FIXME - check what preceeds the brace
3096 if (opt.ignoreformat)
3097 while (regex_replace(t, t, "\\{", "_x_<")
3098 || regex_replace(t, t, "\\}", "_x_>"))
3099 LYXERR(Debug::FIND, "After {} replacement: '" << t << "'");
3101 while (regex_replace(t, t, "\\\\\\{", "_x_<")
3102 || regex_replace(t, t, "\\\\\\}", "_x_>"))
3103 LYXERR(Debug::FIND, "After {} replacement: '" << t << "'");
3110 docstring stringifyFromCursor(DocIterator const & cur, int len)
3112 LYXERR(Debug::FIND, "Stringifying with len=" << len << " from cursor at pos: " << cur);
3113 if (cur.inTexted()) {
3114 Paragraph const & par = cur.paragraph();
3115 // TODO what about searching beyond/across paragraph breaks ?
3116 // TODO Try adding a AS_STR_INSERTS as last arg
3117 pos_type end = ( len == -1 || cur.pos() + len > int(par.size()) ) ?
3118 int(par.size()) : cur.pos() + len;
3119 // OutputParams runparams(&cur.buffer()->params().encoding());
3120 OutputParams runparams(encodings.fromLyXName("utf8"));
3121 runparams.nice = true;
3122 runparams.flavor = OutputParams::XETEX;
3123 runparams.linelen = 10000; //lyxrc.plaintext_linelen;
3124 // No side effect of file copying and image conversion
3125 runparams.dryrun = true;
3126 runparams.for_search = true;
3127 LYXERR(Debug::FIND, "Stringifying with cur: "
3128 << cur << ", from pos: " << cur.pos() << ", end: " << end);
3129 return par.asString(cur.pos(), end,
3130 AS_STR_INSETS | AS_STR_SKIPDELETE | AS_STR_PLAINTEXT,
3132 } else if (cur.inMathed()) {
3133 CursorSlice cs = cur.top();
3134 MathData md = cs.cell();
3135 MathData::const_iterator it_end =
3136 (( len == -1 || cs.pos() + len > int(md.size()))
3138 : md.begin() + cs.pos() + len );
3140 for (MathData::const_iterator it = md.begin() + cs.pos();
3143 docstring s = asString(md2);
3144 LYXERR(Debug::FIND, "Stringified math: '" << s << "'");
3147 LYXERR(Debug::FIND, "Don't know how to stringify from here: " << cur);
3152 /** Computes the LaTeX export of buf starting from cur and ending len positions
3153 * after cur, if len is positive, or at the paragraph or innermost inset end
3156 docstring latexifyFromCursor(DocIterator const & cur, int len)
3158 LYXERR(Debug::FIND, "Latexifying with len=" << len << " from cursor at pos: " << cur);
3159 LYXERR(Debug::FIND, " with cur.lastpost=" << cur.lastpos() << ", cur.lastrow="
3160 << cur.lastrow() << ", cur.lastcol=" << cur.lastcol());
3161 Buffer const & buf = *cur.buffer();
3163 odocstringstream ods;
3165 //OutputParams runparams(&buf.params().encoding());
3166 OutputParams runparams(encodings.fromLyXName("utf8"));
3167 runparams.nice = false;
3168 runparams.flavor = OutputParams::XETEX;
3169 runparams.linelen = 8000; //lyxrc.plaintext_linelen;
3170 // No side effect of file copying and image conversion
3171 runparams.dryrun = true;
3172 runparams.for_search = true;
3174 if (cur.inTexted()) {
3175 // @TODO what about searching beyond/across paragraph breaks ?
3176 pos_type endpos = cur.paragraph().size();
3177 if (len != -1 && endpos > cur.pos() + len)
3178 endpos = cur.pos() + len;
3179 TeXOnePar(buf, *cur.innerText(), cur.pit(), os, runparams,
3180 string(), cur.pos(), endpos);
3181 string s = lyx::to_utf8(ods.str());
3182 LYXERR(Debug::FIND, "Latexified +modified text: '" << s << "'");
3183 return(lyx::from_utf8(s));
3184 } else if (cur.inMathed()) {
3185 // Retrieve the math environment type, and add '$' or '$[' or others (\begin{equation}) accordingly
3186 for (int s = cur.depth() - 1; s >= 0; --s) {
3187 CursorSlice const & cs = cur[s];
3188 if (cs.asInsetMath() && cs.asInsetMath()->asHullInset()) {
3190 cs.asInsetMath()->asHullInset()->header_write(ws);
3195 CursorSlice const & cs = cur.top();
3196 MathData md = cs.cell();
3197 MathData::const_iterator it_end =
3198 ((len == -1 || cs.pos() + len > int(md.size()))
3200 : md.begin() + cs.pos() + len);
3202 for (MathData::const_iterator it = md.begin() + cs.pos();
3206 ods << asString(md2);
3207 // Retrieve the math environment type, and add '$' or '$]'
3208 // or others (\end{equation}) accordingly
3209 for (int s = cur.depth() - 1; s >= 0; --s) {
3210 CursorSlice const & cs2 = cur[s];
3211 InsetMath * inset = cs2.asInsetMath();
3212 if (inset && inset->asHullInset()) {
3214 inset->asHullInset()->footer_write(ws);
3218 LYXERR(Debug::FIND, "Latexified math: '" << lyx::to_utf8(ods.str()) << "'");
3220 LYXERR(Debug::FIND, "Don't know how to stringify from here: " << cur);
3226 /** Finalize an advanced find operation, advancing the cursor to the innermost
3227 ** position that matches, plus computing the length of the matching text to
3230 int findAdvFinalize(DocIterator & cur, MatchStringAdv const & match)
3232 // Search the foremost position that matches (avoids find of entire math
3233 // inset when match at start of it)
3235 DocIterator old_cur(cur.buffer());
3237 LYXERR(Debug::FIND, "Forwarding one step (searching for innermost match)");
3241 } while (cur && cur.depth() > d && match(cur).match_len > 0);
3243 int max_match = match(cur).match_len; /* match valid only if not searching whole words */
3244 if (max_match <= 0) return 0;
3245 LYXERR(Debug::FIND, "Ok");
3247 // Compute the match length
3249 if (cur.pos() + len > cur.lastpos())
3251 if (match.opt.matchword) {
3252 LYXERR(Debug::FIND, "verifying unmatch with len = " << len);
3253 while (cur.pos() + len <= cur.lastpos() && match(cur, len).match_len <= 0) {
3255 LYXERR(Debug::FIND, "verifying unmatch with len = " << len);
3257 // Length of matched text (different from len param)
3258 int old_match = match(cur, len).match_len;
3262 // Greedy behaviour while matching regexps
3263 while ((new_match = match(cur, len + 1).match_len) > old_match) {
3265 old_match = new_match;
3266 LYXERR(Debug::FIND, "verifying match with len = " << len);
3273 int maxl = cur.lastpos() - cur.pos();
3274 // Greedy behaviour while matching regexps
3275 while (maxl > minl) {
3276 int actual_match = match(cur, len).match_len;
3277 if (actual_match >= max_match) {
3278 // actual_match > max_match _can_ happen,
3279 // if the search area splits
3280 // some following word so that the regex
3281 // (e.g. 'r.*r\b' matches 'r' from the middle of the
3283 // This means, the len value is too big
3285 len = (int)((maxl + minl)/2);
3288 // (actual_match < max_match)
3290 len = (int)((maxl + minl)/2);
3294 // Search for real start of matched characters
3299 } while (cur.depth() > old_cur.depth()); /* Skip inner insets */
3300 if (cur.depth() < old_cur.depth()) {
3302 LYXERR(Debug::INFO, "cur.depth() < old_cur.depth(), this should never happen");
3305 if (cur.pos() != old_cur.pos()) {
3306 // OK, forwarded 1 pos in actual inset
3307 actual_match = match(cur, len-1).match_len;
3308 if (actual_match == max_match) {
3309 // Ha, got it! The shorter selection has the same match length
3314 // OK, the shorter selection matches less chars, revert to previous value
3320 LYXERR(Debug::INFO, "cur.pos() == old_cur.pos(), this should never happen");
3321 actual_match = match(cur, len).match_len;
3322 if (actual_match == max_match)
3332 int findForwardAdv(DocIterator & cur, MatchStringAdv const & match)
3336 while (!theApp()->longOperationCancelled() && cur) {
3337 LYXERR(Debug::FIND, "findForwardAdv() cur: " << cur);
3338 MatchResult mres = match(cur, -1, false);
3339 int match_len = mres.match_len;
3340 LYXERR(Debug::FIND, "match_len: " << match_len);
3341 if ((mres.pos > 100000) || (mres.match2end > 100000) || (match_len > 100000)) {
3342 LYXERR(Debug::INFO, "BIG LENGTHS: " << mres.pos << ", " << match_len << ", " << mres.match2end);
3345 if (match_len > 0) {
3346 // Try to find the begin of searched string
3347 int increment = mres.pos/2;
3348 while (mres.pos > 5 && (increment > 5)) {
3349 DocIterator old_cur = cur;
3350 for (int i = 0; i < increment && cur; cur.forwardPos(), i++) {
3352 if (! cur || (cur.pit() > old_cur.pit())) {
3353 // Are we outside of the paragraph?
3354 // This can happen if moving past some UTF8-encoded chars
3359 MatchResult mres2 = match(cur, -1, false);
3360 if ((mres2.match2end < mres.match2end) ||
3361 (mres2.match_len < mres.match_len)) {
3368 if (increment > mres.pos/2)
3369 increment = mres.pos/2;
3373 int match_len_zero_count = 0;
3374 for (int i = 0; !theApp()->longOperationCancelled() && cur; cur.forwardPos()) {
3376 int remaining_len = match(cur, -1, false).match_len;
3377 if (remaining_len <= 0) {
3378 // Apparently the searched string is not in the remaining part
3385 LYXERR(Debug::FIND, "Advancing cur: " << cur);
3386 int match_len3 = match(cur, 1).match_len;
3389 int match_len2 = match(cur).match_len;
3390 LYXERR(Debug::FIND, "match_len2: " << match_len2);
3391 if (match_len2 > 0) {
3392 // Sometimes in finalize we understand it wasn't a match
3393 // and we need to continue the outest loop
3394 int len = findAdvFinalize(cur, match);
3399 if (match_len2 >= 0) {
3400 if (match_len2 == 0)
3401 match_len_zero_count++;
3403 match_len_zero_count = 0;
3406 if (++match_len_zero_count > 3) {
3407 LYXERR(Debug::FIND, "match_len2_zero_count: " << match_len_zero_count << ", match_len was " << match_len);
3415 if (match_len >= 0 && cur.pit() < cur.lastpit()) {
3416 LYXERR(Debug::FIND, "Advancing par: cur=" << cur);
3419 // This should exit nested insets, if any, or otherwise undefine the currsor.
3420 cur.pos() = cur.lastpos();
3421 LYXERR(Debug::FIND, "Advancing pos: cur=" << cur);
3429 /// Find the most backward consecutive match within same paragraph while searching backwards.
3430 int findMostBackwards(DocIterator & cur, MatchStringAdv const & match)
3432 DocIterator cur_begin = doc_iterator_begin(cur.buffer());
3433 DocIterator tmp_cur = cur;
3434 int len = findAdvFinalize(tmp_cur, match);
3435 Inset & inset = cur.inset();
3436 for (; cur != cur_begin; cur.backwardPos()) {
3437 LYXERR(Debug::FIND, "findMostBackwards(): cur=" << cur);
3438 DocIterator new_cur = cur;
3439 new_cur.backwardPos();
3440 if (new_cur == cur || &new_cur.inset() != &inset || !match(new_cur).match_len)
3442 int new_len = findAdvFinalize(new_cur, match);
3447 LYXERR(Debug::FIND, "findMostBackwards(): exiting with cur=" << cur);
3453 int findBackwardsAdv(DocIterator & cur, MatchStringAdv & match)
3457 // Backup of original position
3458 DocIterator cur_begin = doc_iterator_begin(cur.buffer());
3459 if (cur == cur_begin)
3462 DocIterator cur_orig(cur);
3463 bool pit_changed = false;
3466 bool found_match = (match(cur, -1, false).match_len > 0);
3470 cur.pos() = cur.lastpos();
3472 cur.pos() = cur_orig.pos();
3473 LYXERR(Debug::FIND, "findBackAdv2: cur: " << cur);
3474 DocIterator cur_prev_iter;
3476 found_match = (match(cur).match_len > 0);
3477 LYXERR(Debug::FIND, "findBackAdv3: found_match="
3478 << found_match << ", cur: " << cur);
3480 return findMostBackwards(cur, match);
3482 // Stop if begin of document reached
3483 if (cur == cur_begin)
3485 cur_prev_iter = cur;
3489 if (cur == cur_begin)
3496 } while (!theApp()->longOperationCancelled());
3504 docstring stringifyFromForSearch(FindAndReplaceOptions const & opt,
3505 DocIterator const & cur, int len)
3507 if (cur.pos() < 0 || cur.pos() > cur.lastpos())
3509 if (!opt.ignoreformat)
3510 return latexifyFromCursor(cur, len);
3512 return stringifyFromCursor(cur, len);
3516 FindAndReplaceOptions::FindAndReplaceOptions(
3517 docstring const & _find_buf_name, bool _casesensitive,
3518 bool _matchword, bool _forward, bool _expandmacros, bool _ignoreformat,
3519 docstring const & _repl_buf_name, bool _keep_case,
3520 SearchScope _scope, SearchRestriction _restr, bool _replace_all)
3521 : find_buf_name(_find_buf_name), casesensitive(_casesensitive), matchword(_matchword),
3522 forward(_forward), expandmacros(_expandmacros), ignoreformat(_ignoreformat),
3523 repl_buf_name(_repl_buf_name), keep_case(_keep_case), scope(_scope), restr(_restr), replace_all(_replace_all)
3531 /** Check if 'len' letters following cursor are all non-lowercase */
3532 static bool allNonLowercase(Cursor const & cur, int len)
3534 pos_type beg_pos = cur.selectionBegin().pos();
3535 pos_type end_pos = cur.selectionBegin().pos() + len;
3536 if (len > cur.lastpos() + 1 - beg_pos) {
3537 LYXERR(Debug::FIND, "This should not happen, more debug needed");
3538 len = cur.lastpos() + 1 - beg_pos;
3539 end_pos = beg_pos + len;
3541 for (pos_type pos = beg_pos; pos != end_pos; ++pos)
3542 if (isLowerCase(cur.paragraph().getChar(pos)))
3548 /** Check if first letter is upper case and second one is lower case */
3549 static bool firstUppercase(Cursor const & cur)
3552 pos_type pos = cur.selectionBegin().pos();
3553 if (pos >= cur.lastpos() - 1) {
3554 LYXERR(Debug::FIND, "No upper-case at cur: " << cur);
3557 ch1 = cur.paragraph().getChar(pos);
3558 ch2 = cur.paragraph().getChar(pos + 1);
3559 bool result = isUpperCase(ch1) && isLowerCase(ch2);
3560 LYXERR(Debug::FIND, "firstUppercase(): "
3561 << "ch1=" << ch1 << "(" << char(ch1) << "), ch2="
3562 << ch2 << "(" << char(ch2) << ")"
3563 << ", result=" << result << ", cur=" << cur);
3568 /** Make first letter of supplied buffer upper-case, and the rest lower-case.
3570 ** \fixme What to do with possible further paragraphs in replace buffer ?
3572 static void changeFirstCase(Buffer & buffer, TextCase first_case, TextCase others_case)
3574 ParagraphList::iterator pit = buffer.paragraphs().begin();
3575 LASSERT(!pit->empty(), /**/);
3576 pos_type right = pos_type(1);
3577 pit->changeCase(buffer.params(), pos_type(0), right, first_case);
3578 right = pit->size();
3579 pit->changeCase(buffer.params(), pos_type(1), right, others_case);
3585 static int findAdvReplace(BufferView * bv, FindAndReplaceOptions const & opt, MatchStringAdv & matchAdv)
3587 Cursor & cur = bv->cursor();
3588 if (opt.repl_buf_name.empty()
3589 || theBufferList().getBuffer(FileName(to_utf8(opt.repl_buf_name)), true) == 0
3590 || theBufferList().getBuffer(FileName(to_utf8(opt.find_buf_name)), true) == 0)
3593 DocIterator sel_beg = cur.selectionBegin();
3594 DocIterator sel_end = cur.selectionEnd();
3595 if (&sel_beg.inset() != &sel_end.inset()
3596 || sel_beg.pit() != sel_end.pit()
3597 || sel_beg.idx() != sel_end.idx())
3599 int sel_len = sel_end.pos() - sel_beg.pos();
3600 LYXERR(Debug::FIND, "sel_beg: " << sel_beg << ", sel_end: " << sel_end
3601 << ", sel_len: " << sel_len << endl);
3604 LASSERT(sel_len > 0, return 0);
3606 if (!matchAdv(sel_beg, sel_len).match_len)
3609 // Build a copy of the replace buffer, adapted to the KeepCase option
3610 Buffer const & repl_buffer_orig = *theBufferList().getBuffer(FileName(to_utf8(opt.repl_buf_name)), true);
3612 repl_buffer_orig.write(oss);
3613 string lyx = oss.str();
3614 Buffer repl_buffer("", false);
3615 repl_buffer.setUnnamed(true);
3616 LASSERT(repl_buffer.readString(lyx), return 0);
3617 if (opt.keep_case && sel_len >= 2) {
3618 LYXERR(Debug::FIND, "keep_case true: cur.pos()=" << cur.pos() << ", sel_len=" << sel_len);
3619 if (cur.inTexted()) {
3620 if (firstUppercase(cur))
3621 changeFirstCase(repl_buffer, text_uppercase, text_lowercase);
3622 else if (allNonLowercase(cur, sel_len))
3623 changeFirstCase(repl_buffer, text_uppercase, text_uppercase);
3626 cap::cutSelection(cur, false);
3627 if (cur.inTexted()) {
3628 repl_buffer.changeLanguage(
3629 repl_buffer.language(),
3630 cur.getFont().language());
3631 LYXERR(Debug::FIND, "Replacing by pasteParagraphList()ing repl_buffer");
3632 LYXERR(Debug::FIND, "Before pasteParagraphList() cur=" << cur << endl);
3633 cap::pasteParagraphList(cur, repl_buffer.paragraphs(),
3634 repl_buffer.params().documentClassPtr(),
3635 bv->buffer().errorList("Paste"));
3636 LYXERR(Debug::FIND, "After pasteParagraphList() cur=" << cur << endl);
3637 sel_len = repl_buffer.paragraphs().begin()->size();
3638 } else if (cur.inMathed()) {
3639 odocstringstream ods;
3641 // OutputParams runparams(&repl_buffer.params().encoding());
3642 OutputParams runparams(encodings.fromLyXName("utf8"));
3643 runparams.nice = false;
3644 runparams.flavor = OutputParams::XETEX;
3645 runparams.linelen = 8000; //lyxrc.plaintext_linelen;
3646 runparams.dryrun = true;
3647 TeXOnePar(repl_buffer, repl_buffer.text(), 0, os, runparams);
3648 //repl_buffer.getSourceCode(ods, 0, repl_buffer.paragraphs().size(), false);
3649 docstring repl_latex = ods.str();
3650 LYXERR(Debug::FIND, "Latexified replace_buffer: '" << repl_latex << "'");
3652 (void)regex_replace(to_utf8(repl_latex), s, "\\$(.*)\\$", "$1");
3653 (void)regex_replace(s, s, "\\\\\\[(.*)\\\\\\]", "$1");
3654 repl_latex = from_utf8(s);
3655 LYXERR(Debug::FIND, "Replacing by insert()ing latex: '" << repl_latex << "' cur=" << cur << " with depth=" << cur.depth());
3656 MathData ar(cur.buffer());
3657 asArray(repl_latex, ar, Parse::NORMAL);
3659 sel_len = ar.size();
3660 LYXERR(Debug::FIND, "After insert() cur=" << cur << " with depth: " << cur.depth() << " and len: " << sel_len);
3662 if (cur.pos() >= sel_len)
3663 cur.pos() -= sel_len;
3666 LYXERR(Debug::FIND, "After pos adj cur=" << cur << " with depth: " << cur.depth() << " and len: " << sel_len);
3667 bv->putSelectionAt(DocIterator(cur), sel_len, !opt.forward);
3668 bv->processUpdateFlags(Update::Force);
3673 /// Perform a FindAdv operation.
3674 bool findAdv(BufferView * bv, FindAndReplaceOptions const & opt)
3679 // e.g., when invoking word-findadv from mini-buffer wither with
3680 // wrong options syntax or before ever opening advanced F&R pane
3681 if (theBufferList().getBuffer(FileName(to_utf8(opt.find_buf_name)), true) == 0)
3685 MatchStringAdv matchAdv(bv->buffer(), opt);
3686 int length = bv->cursor().selectionEnd().pos() - bv->cursor().selectionBegin().pos();
3688 bv->putSelectionAt(bv->cursor().selectionBegin(), length, !opt.forward);
3689 num_replaced += findAdvReplace(bv, opt, matchAdv);
3692 match_len = findForwardAdv(cur, matchAdv);
3694 match_len = findBackwardsAdv(cur, matchAdv);
3696 // This may only be raised by lyx::regex()
3697 bv->message(_("Invalid regular expression!"));
3701 if (match_len == 0) {
3702 if (num_replaced > 0) {
3703 switch (num_replaced)
3706 bv->message(_("One match has been replaced."));
3709 bv->message(_("Two matches have been replaced."));
3712 bv->message(bformat(_("%1$d matches have been replaced."), num_replaced));
3718 bv->message(_("Match not found."));
3723 if (num_replaced > 0)
3724 bv->message(_("Match has been replaced."));
3726 bv->message(_("Match found."));
3728 LYXERR(Debug::FIND, "Putting selection at cur=" << cur << " with len: " << match_len);
3729 bv->putSelectionAt(cur, match_len, !opt.forward);
3735 ostringstream & operator<<(ostringstream & os, FindAndReplaceOptions const & opt)
3737 os << to_utf8(opt.find_buf_name) << "\nEOSS\n"
3738 << opt.casesensitive << ' '
3739 << opt.matchword << ' '
3740 << opt.forward << ' '
3741 << opt.expandmacros << ' '
3742 << opt.ignoreformat << ' '
3743 << opt.replace_all << ' '
3744 << to_utf8(opt.repl_buf_name) << "\nEOSS\n"
3745 << opt.keep_case << ' '
3746 << int(opt.scope) << ' '
3749 LYXERR(Debug::FIND, "built: " << os.str());
3755 istringstream & operator>>(istringstream & is, FindAndReplaceOptions & opt)
3757 LYXERR(Debug::FIND, "parsing");
3761 while (line != "EOSS") {
3765 if (is.eof()) // Tolerate malformed request
3769 LYXERR(Debug::FIND, "file_buf_name: '" << s << "'");
3770 opt.find_buf_name = from_utf8(s);
3771 is >> opt.casesensitive >> opt.matchword >> opt.forward >> opt.expandmacros >> opt.ignoreformat >> opt.replace_all;
3772 is.get(); // Waste space before replace string
3775 while (line != "EOSS") {
3779 if (is.eof()) // Tolerate malformed request
3783 LYXERR(Debug::FIND, "repl_buf_name: '" << s << "'");
3784 opt.repl_buf_name = from_utf8(s);
3785 is >> opt.keep_case;
3788 opt.scope = FindAndReplaceOptions::SearchScope(i);
3790 opt.restr = FindAndReplaceOptions::SearchRestriction(i);
3792 LYXERR(Debug::FIND, "parsed: " << opt.casesensitive << ' ' << opt.matchword << ' ' << opt.forward << ' '
3793 << opt.expandmacros << ' ' << opt.ignoreformat << ' ' << opt.keep_case << ' '
3794 << opt.scope << ' ' << opt.restr);