3 * This file is part of LyX, the document processor.
4 * License details can be found in the file COPYING.
6 * \author Lars Gullik Bjønnes
9 * \author Alfredo Braunstein
10 * \author Tommaso Cucinotta
12 * Full author contact details are available in file CREDITS.
20 #include "buffer_funcs.h"
21 #include "BufferList.h"
22 #include "BufferParams.h"
23 #include "BufferView.h"
26 #include "CutAndPaste.h"
27 #include "FuncRequest.h"
29 #include "output_latex.h"
30 #include "OutputParams.h"
31 #include "Paragraph.h"
32 #include "ParIterator.h"
36 #include "frontends/Application.h"
37 #include "frontends/alert.h"
39 #include "mathed/InsetMath.h"
40 #include "mathed/InsetMathGrid.h"
41 #include "mathed/InsetMathHull.h"
42 #include "mathed/MathData.h"
43 #include "mathed/MathStream.h"
44 #include "mathed/MathSupport.h"
46 #include "support/convert.h"
47 #include "support/debug.h"
48 #include "support/docstream.h"
49 #include "support/FileName.h"
50 #include "support/gettext.h"
51 #include "support/lassert.h"
52 #include "support/lstrings.h"
54 #include "support/regex.h"
58 using namespace lyx::support;
63 // Helper class for deciding what should be ignored
68 : ignoreFamily_(false), ignoreSeries_(false),
69 ignoreShape_(false), ignoreUnderline_(false),
70 ignoreMarkUp_(false), ignoreStrikeOut_(false),
71 ignoreSectioning_(false), ignoreFrontMatter_(false),
72 ignoreColor_(false), ignoreLanguage_(false) {}
74 bool getFamily() { return ignoreFamily_; };
76 bool getSeries() { return ignoreSeries_; };
78 bool getShape() { return ignoreShape_; };
80 bool getUnderline() { return ignoreUnderline_; };
82 bool getMarkUp() { return ignoreMarkUp_; };
84 bool getStrikeOut() { return ignoreStrikeOut_; };
86 bool getSectioning() { return ignoreSectioning_; };
88 bool getFrontMatter() { return ignoreFrontMatter_; };
90 bool getColor() { return ignoreColor_; };
92 bool getLanguage() { return ignoreLanguage_; };
94 void setIgnoreFormat(string type, bool value);
104 bool ignoreUnderline_;
108 bool ignoreStrikeOut_;
110 bool ignoreSectioning_;
112 bool ignoreFrontMatter_;
116 bool ignoreLanguage_;
120 void IgnoreFormats::setIgnoreFormat(string type, bool value)
122 if (type == "color") {
123 ignoreColor_ = value;
125 else if (type == "language") {
126 ignoreLanguage_ = value;
128 else if (type == "sectioning") {
129 ignoreSectioning_ = value;
130 ignoreFrontMatter_ = value;
132 else if (type == "font") {
133 ignoreSeries_ = value;
134 ignoreShape_ = value;
135 ignoreFamily_ = value;
137 else if (type == "series") {
138 ignoreSeries_ = value;
140 else if (type == "shape") {
141 ignoreShape_ = value;
143 else if (type == "family") {
144 ignoreFamily_ = value;
146 else if (type == "markup") {
147 ignoreMarkUp_ = value;
149 else if (type == "underline") {
150 ignoreUnderline_ = value;
152 else if (type == "strike") {
153 ignoreStrikeOut_ = value;
157 // The global variable that can be changed from outside
158 IgnoreFormats ignoreFormats;
161 void setIgnoreFormat(string type, bool value)
163 ignoreFormats.setIgnoreFormat(type, value);
169 bool parse_bool(docstring & howto)
174 howto = split(howto, var, ' ');
179 class MatchString : public binary_function<Paragraph, pos_type, int>
182 MatchString(docstring const & str, bool cs, bool mw)
183 : str(str), case_sens(cs), whole_words(mw)
186 // returns true if the specified string is at the specified position
187 // del specifies whether deleted strings in ct mode will be considered
188 int operator()(Paragraph const & par, pos_type pos, bool del = true) const
190 return par.find(str, case_sens, whole_words, pos, del);
198 // match whole words only
203 int findForward(DocIterator & cur, MatchString const & match,
204 bool find_del = true)
206 for (; cur; cur.forwardChar())
207 if (cur.inTexted()) {
208 int len = match(cur.paragraph(), cur.pos(), find_del);
216 int findBackwards(DocIterator & cur, MatchString const & match,
217 bool find_del = true)
221 if (cur.inTexted()) {
222 int len = match(cur.paragraph(), cur.pos(), find_del);
231 bool searchAllowed(docstring const & str)
234 frontend::Alert::error(_("Search error"), _("Search string is empty"));
241 bool findOne(BufferView * bv, docstring const & searchstr,
242 bool case_sens, bool whole, bool forward,
243 bool find_del = true, bool check_wrap = false)
245 if (!searchAllowed(searchstr))
248 DocIterator cur = forward
249 ? bv->cursor().selectionEnd()
250 : bv->cursor().selectionBegin();
252 MatchString const match(searchstr, case_sens, whole);
254 int match_len = forward
255 ? findForward(cur, match, find_del)
256 : findBackwards(cur, match, find_del);
259 bv->putSelectionAt(cur, match_len, !forward);
260 else if (check_wrap) {
261 DocIterator cur_orig(bv->cursor());
264 q = _("End of file reached while searching forward.\n"
265 "Continue searching from the beginning?");
267 q = _("Beginning of file reached while searching backward.\n"
268 "Continue searching from the end?");
269 int wrap_answer = frontend::Alert::prompt(_("Wrap search?"),
270 q, 0, 1, _("&Yes"), _("&No"));
271 if (wrap_answer == 0) {
273 bv->cursor().clear();
274 bv->cursor().push_back(CursorSlice(bv->buffer().inset()));
276 bv->cursor().setCursor(doc_iterator_end(&bv->buffer()));
277 bv->cursor().backwardPos();
279 bv->clearSelection();
280 if (findOne(bv, searchstr, case_sens, whole, forward, find_del, false))
283 bv->cursor().setCursor(cur_orig);
287 return match_len > 0;
291 int replaceAll(BufferView * bv,
292 docstring const & searchstr, docstring const & replacestr,
293 bool case_sens, bool whole)
295 Buffer & buf = bv->buffer();
297 if (!searchAllowed(searchstr) || buf.isReadonly())
300 DocIterator cur_orig(bv->cursor());
302 MatchString const match(searchstr, case_sens, whole);
305 int const rsize = replacestr.size();
306 int const ssize = searchstr.size();
309 cur.setCursor(doc_iterator_begin(&buf));
310 int match_len = findForward(cur, match, false);
311 while (match_len > 0) {
312 // Backup current cursor position and font.
313 pos_type const pos = cur.pos();
314 Font const font = cur.paragraph().getFontSettings(buf.params(), pos);
316 int striked = ssize -
317 cur.paragraph().eraseChars(pos, pos + match_len,
318 buf.params().track_changes);
319 cur.paragraph().insert(pos, replacestr, font,
320 Change(buf.params().track_changes
322 : Change::UNCHANGED));
323 for (int i = 0; i < rsize + striked; ++i)
326 match_len = findForward(cur, match, false);
329 bv->putSelectionAt(doc_iterator_begin(&buf), 0, false);
331 cur_orig.fixIfBroken();
332 bv->setCursor(cur_orig);
338 // the idea here is that we are going to replace the string that
339 // is selected IF it is the search string.
340 // if there is a selection, but it is not the search string, then
341 // we basically ignore it. (FIXME We ought to replace only within
343 // if there is no selection, then:
344 // (i) if some search string has been provided, then we find it.
345 // (think of how the dialog works when you hit "replace" the
347 // (ii) if no search string has been provided, then we treat the
348 // word the cursor is in as the search string. (why? i have no
349 // idea.) but this only works in text?
351 // returns the number of replacements made (one, if any) and
352 // whether anything at all was done.
353 pair<bool, int> replaceOne(BufferView * bv, docstring searchstr,
354 docstring const & replacestr, bool case_sens,
355 bool whole, bool forward, bool findnext)
357 Cursor & cur = bv->cursor();
359 if (!cur.selection()) {
360 // no selection, non-empty search string: find it
361 if (!searchstr.empty()) {
362 found = findOne(bv, searchstr, case_sens, whole, forward, true, findnext);
363 return make_pair(found, 0);
365 // empty search string
368 return make_pair(false, 0);
369 // select current word and treat it as the search string.
370 // This causes a minor bug as undo will restore this selection,
371 // which the user did not create (#8986).
372 cur.innerText()->selectWord(cur, WHOLE_WORD);
373 searchstr = cur.selectionAsString(false);
376 // if we still don't have a search string, report the error
378 if (!searchAllowed(searchstr))
379 return make_pair(false, 0);
381 bool have_selection = cur.selection();
382 docstring const selected = cur.selectionAsString(false);
385 ? searchstr == selected
386 : compare_no_case(searchstr, selected) == 0;
388 // no selection or current selection is not search word:
389 // just find the search word
390 if (!have_selection || !match) {
391 found = findOne(bv, searchstr, case_sens, whole, forward, true, findnext);
392 return make_pair(found, 0);
395 // we're now actually ready to replace. if the buffer is
396 // read-only, we can't, though.
397 if (bv->buffer().isReadonly())
398 return make_pair(false, 0);
400 cap::replaceSelectionWithString(cur, replacestr);
402 cur.pos() += replacestr.length();
403 LASSERT(cur.pos() <= cur.lastpos(),
404 cur.pos() = cur.lastpos());
407 findOne(bv, searchstr, case_sens, whole, forward, false, findnext);
409 return make_pair(true, 1);
415 docstring const find2string(docstring const & search,
416 bool casesensitive, bool matchword, bool forward)
420 << int(casesensitive) << ' '
421 << int(matchword) << ' '
427 docstring const replace2string(docstring const & replace,
428 docstring const & search,
429 bool casesensitive, bool matchword,
430 bool all, bool forward, bool findnext)
433 ss << replace << '\n'
435 << int(casesensitive) << ' '
436 << int(matchword) << ' '
438 << int(forward) << ' '
444 bool lyxfind(BufferView * bv, FuncRequest const & ev)
446 if (!bv || ev.action() != LFUN_WORD_FIND)
449 //lyxerr << "find called, cmd: " << ev << endl;
451 // data is of the form
453 // <casesensitive> <matchword> <forward>"
455 docstring howto = split(ev.argument(), search, '\n');
457 bool casesensitive = parse_bool(howto);
458 bool matchword = parse_bool(howto);
459 bool forward = parse_bool(howto);
461 return findOne(bv, search, casesensitive, matchword, forward, true, true);
465 bool lyxreplace(BufferView * bv,
466 FuncRequest const & ev, bool has_deleted)
468 if (!bv || ev.action() != LFUN_WORD_REPLACE)
471 // data is of the form
474 // <casesensitive> <matchword> <all> <forward> <findnext>"
477 docstring howto = split(ev.argument(), rplc, '\n');
478 howto = split(howto, search, '\n');
480 bool casesensitive = parse_bool(howto);
481 bool matchword = parse_bool(howto);
482 bool all = parse_bool(howto);
483 bool forward = parse_bool(howto);
484 bool findnext = howto.empty() ? true : parse_bool(howto);
489 int replace_count = 0;
491 replace_count = replaceAll(bv, search, rplc, casesensitive, matchword);
492 update = replace_count > 0;
495 replaceOne(bv, search, rplc, casesensitive, matchword, forward, findnext);
497 replace_count = rv.second;
500 Buffer const & buf = bv->buffer();
502 // emit message signal.
503 buf.message(_("String not found."));
505 if (replace_count == 0) {
506 buf.message(_("String found."));
507 } else if (replace_count == 1) {
508 buf.message(_("String has been replaced."));
510 docstring const str =
511 bformat(_("%1$d strings have been replaced."), replace_count);
515 } else if (findnext) {
516 // if we have deleted characters, we do not replace at all, but
517 // rather search for the next occurence
518 if (findOne(bv, search, casesensitive, matchword, forward, true, findnext))
521 bv->message(_("String not found."));
527 bool findNextChange(BufferView * bv, Cursor & cur, bool const check_wrap)
529 for (; cur; cur.forwardPos())
530 if (cur.inTexted() && cur.paragraph().isChanged(cur.pos()))
534 DocIterator cur_orig(bv->cursor());
535 docstring q = _("End of file reached while searching forward.\n"
536 "Continue searching from the beginning?");
537 int wrap_answer = frontend::Alert::prompt(_("Wrap search?"),
538 q, 0, 1, _("&Yes"), _("&No"));
539 if (wrap_answer == 0) {
540 bv->cursor().clear();
541 bv->cursor().push_back(CursorSlice(bv->buffer().inset()));
542 bv->clearSelection();
543 cur.setCursor(bv->cursor().selectionBegin());
544 if (findNextChange(bv, cur, false))
547 bv->cursor().setCursor(cur_orig);
554 bool findPreviousChange(BufferView * bv, Cursor & cur, bool const check_wrap)
556 for (cur.backwardPos(); cur; cur.backwardPos()) {
557 if (cur.inTexted() && cur.paragraph().isChanged(cur.pos()))
562 DocIterator cur_orig(bv->cursor());
563 docstring q = _("Beginning of file reached while searching backward.\n"
564 "Continue searching from the end?");
565 int wrap_answer = frontend::Alert::prompt(_("Wrap search?"),
566 q, 0, 1, _("&Yes"), _("&No"));
567 if (wrap_answer == 0) {
568 bv->cursor().setCursor(doc_iterator_end(&bv->buffer()));
569 bv->cursor().backwardPos();
570 bv->clearSelection();
571 cur.setCursor(bv->cursor().selectionBegin());
572 if (findPreviousChange(bv, cur, false))
575 bv->cursor().setCursor(cur_orig);
582 bool selectChange(Cursor & cur, bool forward)
584 if (!cur.inTexted() || !cur.paragraph().isChanged(cur.pos()))
586 Change ch = cur.paragraph().lookupChange(cur.pos());
588 CursorSlice tip1 = cur.top();
589 for (; tip1.pit() < tip1.lastpit() || tip1.pos() < tip1.lastpos(); tip1.forwardPos()) {
590 Change ch2 = tip1.paragraph().lookupChange(tip1.pos());
591 if (!ch2.isSimilarTo(ch))
594 CursorSlice tip2 = cur.top();
595 for (; tip2.pit() > 0 || tip2.pos() > 0;) {
597 Change ch2 = tip2.paragraph().lookupChange(tip2.pos());
598 if (!ch2.isSimilarTo(ch)) {
599 // take a step forward to correctly set the selection
607 cur.bv().mouseSetCursor(cur, false);
609 cur.bv().mouseSetCursor(cur, true);
617 bool findChange(BufferView * bv, bool forward)
620 cur.setCursor(forward ? bv->cursor().selectionEnd()
621 : bv->cursor().selectionBegin());
622 forward ? findNextChange(bv, cur, true) : findPreviousChange(bv, cur, true);
623 return selectChange(cur, forward);
628 bool findNextChange(BufferView * bv)
630 return findChange(bv, true);
634 bool findPreviousChange(BufferView * bv)
636 return findChange(bv, false);
643 typedef vector<pair<string, string> > Escapes;
645 /// A map of symbols and their escaped equivalent needed within a regex.
646 /// @note Beware of order
647 Escapes const & get_regexp_escapes()
649 typedef std::pair<std::string, std::string> P;
651 static Escapes escape_map;
652 if (escape_map.empty()) {
653 escape_map.push_back(P("$", "_x_$"));
654 escape_map.push_back(P("{", "_x_{"));
655 escape_map.push_back(P("}", "_x_}"));
656 escape_map.push_back(P("[", "_x_["));
657 escape_map.push_back(P("]", "_x_]"));
658 escape_map.push_back(P("(", "_x_("));
659 escape_map.push_back(P(")", "_x_)"));
660 escape_map.push_back(P("+", "_x_+"));
661 escape_map.push_back(P("*", "_x_*"));
662 escape_map.push_back(P(".", "_x_."));
663 escape_map.push_back(P("\\", "(?:\\\\|\\\\backslash)"));
664 escape_map.push_back(P("~", "(?:\\\\textasciitilde|\\\\sim)"));
665 escape_map.push_back(P("^", "(?:\\^|\\\\textasciicircum\\{\\}|\\\\textasciicircum|\\\\mathcircumflex)"));
666 escape_map.push_back(P("_x_", "\\"));
671 /// A map of lyx escaped strings and their unescaped equivalent.
672 Escapes const & get_lyx_unescapes()
674 typedef std::pair<std::string, std::string> P;
676 static Escapes escape_map;
677 if (escape_map.empty()) {
678 escape_map.push_back(P("\\%", "%"));
679 escape_map.push_back(P("\\mathcircumflex ", "^"));
680 escape_map.push_back(P("\\mathcircumflex", "^"));
681 escape_map.push_back(P("\\backslash ", "\\"));
682 escape_map.push_back(P("\\backslash", "\\"));
683 escape_map.push_back(P("\\\\{", "_x_<"));
684 escape_map.push_back(P("\\\\}", "_x_>"));
685 escape_map.push_back(P("\\sim ", "~"));
686 escape_map.push_back(P("\\sim", "~"));
691 /// A map of escapes turning a regexp matching text to one matching latex.
692 Escapes const & get_regexp_latex_escapes()
694 typedef std::pair<std::string, std::string> P;
696 static Escapes escape_map;
697 if (escape_map.empty()) {
698 escape_map.push_back(P("\\\\", "(?:\\\\\\\\|\\\\backslash|\\\\textbackslash\\{\\}|\\\\textbackslash)"));
699 escape_map.push_back(P("(<?!\\\\\\\\textbackslash)\\{", "\\\\\\{"));
700 escape_map.push_back(P("(<?!\\\\\\\\textbackslash\\\\\\{)\\}", "\\\\\\}"));
701 escape_map.push_back(P("\\[", "\\{\\[\\}"));
702 escape_map.push_back(P("\\]", "\\{\\]\\}"));
703 escape_map.push_back(P("\\^", "(?:\\^|\\\\textasciicircum\\{\\}|\\\\textasciicircum|\\\\mathcircumflex)"));
704 escape_map.push_back(P("%", "\\\\\\%"));
705 escape_map.push_back(P("#", "\\\\#"));
710 /** @todo Probably the maps need to be migrated to regexps, in order to distinguish if
711 ** the found occurrence were escaped.
713 string apply_escapes(string s, Escapes const & escape_map)
715 LYXERR(Debug::FIND, "Escaping: '" << s << "'");
716 Escapes::const_iterator it;
717 for (it = escape_map.begin(); it != escape_map.end(); ++it) {
718 // LYXERR(Debug::FIND, "Escaping " << it->first << " as " << it->second);
719 unsigned int pos = 0;
720 while (pos < s.length() && (pos = s.find(it->first, pos)) < s.length()) {
721 s.replace(pos, it->first.length(), it->second);
722 LYXERR(Debug::FIND, "After escape: " << s);
723 pos += it->second.length();
724 // LYXERR(Debug::FIND, "pos: " << pos);
727 LYXERR(Debug::FIND, "Escaped : '" << s << "'");
732 /// Within \regexp{} apply get_lyx_unescapes() only (i.e., preserve regexp semantics of the string),
733 /// while outside apply get_lyx_unescapes()+get_regexp_escapes().
734 /// If match_latex is true, then apply regexp_latex_escapes() to \regexp{} contents as well.
735 string escape_for_regex(string s, bool match_latex)
738 while (pos < s.size()) {
739 size_t new_pos = s.find("\\regexp{", pos);
740 if (new_pos == string::npos)
742 LYXERR(Debug::FIND, "new_pos: " << new_pos);
743 string t = apply_escapes(s.substr(pos, new_pos - pos), get_lyx_unescapes());
744 LYXERR(Debug::FIND, "t [lyx]: " << t);
745 t = apply_escapes(t, get_regexp_escapes());
746 LYXERR(Debug::FIND, "t [rxp]: " << t);
747 s.replace(pos, new_pos - pos, t);
748 new_pos = pos + t.size();
749 LYXERR(Debug::FIND, "Regexp after escaping: " << s);
750 LYXERR(Debug::FIND, "new_pos: " << new_pos);
751 if (new_pos == s.size())
753 // Might fail if \\endregexp{} is preceeded by unexpected stuff (weird escapes)
754 size_t end_pos = s.find("\\endregexp{}}", new_pos + 8);
755 LYXERR(Debug::FIND, "end_pos: " << end_pos);
756 t = s.substr(new_pos + 8, end_pos - (new_pos + 8));
757 LYXERR(Debug::FIND, "t in regexp : " << t);
758 t = apply_escapes(t, get_lyx_unescapes());
759 LYXERR(Debug::FIND, "t in regexp [lyx]: " << t);
761 t = apply_escapes(t, get_regexp_latex_escapes());
762 LYXERR(Debug::FIND, "t in regexp [ltx]: " << t);
764 if (end_pos == s.size()) {
765 s.replace(new_pos, end_pos - new_pos, t);
766 LYXERR(Debug::FIND, "Regexp after \\regexp{} removal: " << s);
769 s.replace(new_pos, end_pos + 13 - new_pos, t);
770 LYXERR(Debug::FIND, "Regexp after \\regexp{...\\endregexp{}} removal: " << s);
771 pos = new_pos + t.size();
772 LYXERR(Debug::FIND, "pos: " << pos);
778 /// Wrapper for lyx::regex_replace with simpler interface
779 bool regex_replace(string const & s, string & t, string const & searchstr,
780 string const & replacestr)
782 lyx::regex e(searchstr, regex_constants::ECMAScript);
784 ostream_iterator<char, char> it(oss);
785 lyx::regex_replace(it, s.begin(), s.end(), e, replacestr);
786 // tolerate t and s be references to the same variable
787 bool rv = (s != oss.str());
793 /** Checks if supplied string segment is well-formed from the standpoint of matching open-closed braces.
795 ** Verify that closed braces exactly match open braces. This avoids that, for example,
796 ** \frac{.*}{x} matches \frac{x+\frac{y}{x}}{z} with .* being 'x+\frac{y'.
799 ** Number of open braces that must remain open at the end for the verification to succeed.
801 bool braces_match(string::const_iterator const & beg,
802 string::const_iterator const & end,
806 string::const_iterator it = beg;
807 LYXERR(Debug::FIND, "Checking " << unmatched << " unmatched braces in '" << string(beg, end) << "'");
808 for (; it != end; ++it) {
809 // Skip escaped braces in the count
814 } else if (*it == '{') {
816 } else if (*it == '}') {
817 if (open_pars == 0) {
818 LYXERR(Debug::FIND, "Found unmatched closed brace");
824 if (open_pars != unmatched) {
825 LYXERR(Debug::FIND, "Found " << open_pars
826 << " instead of " << unmatched
827 << " unmatched open braces at the end of count");
830 LYXERR(Debug::FIND, "Braces match as expected");
835 /** The class performing a match between a position in the document and the FindAdvOptions.
837 class MatchStringAdv {
839 MatchStringAdv(lyx::Buffer & buf, FindAndReplaceOptions const & opt);
841 /** Tests if text starting at the supplied position matches with the one provided to the MatchStringAdv
842 ** constructor as opt.search, under the opt.* options settings.
845 ** If set, then match is searched only against beginning of text starting at cur.
846 ** If unset, then match is searched anywhere in text starting at cur.
849 ** The length of the matching text, or zero if no match was found.
851 int operator()(DocIterator const & cur, int len = -1, bool at_begin = true) const;
856 /// first buffer on which search was started
857 lyx::Buffer * const p_first_buf;
859 FindAndReplaceOptions const & opt;
862 /// Auxiliary find method (does not account for opt.matchword)
863 int findAux(DocIterator const & cur, int len = -1, bool at_begin = true) const;
865 /** Normalize a stringified or latexified LyX paragraph.
869 ** <li>if search is not casesensitive, then lowercase the string;
870 ** <li>remove any newline at begin or end of the string;
871 ** <li>replace any newline in the middle of the string with a simple space;
872 ** <li>remove stale empty styles and environments, like \emph{} and \textbf{}.
875 ** @todo Normalization should also expand macros, if the corresponding
876 ** search option was checked.
878 string normalize(docstring const & s, bool hack_braces) const;
879 // normalized string to search
880 string par_as_string;
881 // regular expression to use for searching
883 // same as regexp, but prefixed with a ".*?"
885 // leading format material as string
886 string lead_as_string;
887 // par_as_string after removal of lead_as_string
888 string par_as_string_nolead;
889 // unmatched open braces in the search string/regexp
891 // number of (.*?) subexpressions added at end of search regexp for closing
892 // environments, math mode, styles, etc...
894 // Are we searching with regular expressions ?
899 static docstring buffer_to_latex(Buffer & buffer)
901 OutputParams runparams(&buffer.params().encoding());
902 odocstringstream ods;
904 runparams.nice = true;
905 runparams.flavor = OutputParams::LATEX;
906 runparams.linelen = 100000; //lyxrc.plaintext_linelen;
907 // No side effect of file copying and image conversion
908 runparams.dryrun = true;
909 runparams.for_search = true;
910 pit_type const endpit = buffer.paragraphs().size();
911 for (pit_type pit = 0; pit != endpit; ++pit) {
912 TeXOnePar(buffer, buffer.text(), pit, os, runparams);
913 LYXERR(Debug::FIND, "searchString up to here: " << ods.str());
919 static docstring stringifySearchBuffer(Buffer & buffer, FindAndReplaceOptions const & opt)
922 if (!opt.ignoreformat) {
923 str = buffer_to_latex(buffer);
925 OutputParams runparams(&buffer.params().encoding());
926 runparams.nice = true;
927 runparams.flavor = OutputParams::LATEX;
928 runparams.linelen = 100000; //lyxrc.plaintext_linelen;
929 runparams.dryrun = true;
930 runparams.for_search = true;
931 for (pos_type pit = pos_type(0); pit < (pos_type)buffer.paragraphs().size(); ++pit) {
932 Paragraph const & par = buffer.paragraphs().at(pit);
933 LYXERR(Debug::FIND, "Adding to search string: '"
934 << par.asString(pos_type(0), par.size(),
935 AS_STR_INSETS | AS_STR_SKIPDELETE | AS_STR_PLAINTEXT,
938 str += par.asString(pos_type(0), par.size(),
939 AS_STR_INSETS | AS_STR_SKIPDELETE | AS_STR_PLAINTEXT,
947 /// Return separation pos between the leading material and the rest
948 static size_t identifyLeading(string const & s)
951 // @TODO Support \item[text]
952 // Kornel: Added textsl, textsf, textit, texttt and noun
953 // + allow to search for colored text too
954 while (regex_replace(t, t, REGEX_BOS "\\\\(((footnotesize|tiny|scriptsize|small|large|Large|LARGE|huge|Huge|emph|noun|minisec|text(bf|md|sl|sf|it|tt))|((textcolor|foreignlanguage|latexenvironment)\\{[a-z]+\\*?\\})|(u|uu)line|(s|x)out|uwave)|((sub)?(((sub)?section)|paragraph)|part|chapter)\\*?)\\{", "")
955 || regex_replace(t, t, REGEX_BOS "\\$", "")
956 || regex_replace(t, t, REGEX_BOS "\\\\\\[ ", "")
957 || regex_replace(t, t, REGEX_BOS " ?\\\\item\\{[a-z]+\\}", "")
958 || regex_replace(t, t, REGEX_BOS "\\\\begin\\{[a-zA-Z_]*\\*?\\} ", ""))
960 LYXERR(Debug::FIND, " after removing leading $, \\[ , \\emph{, \\textbf{, etc.: '" << t << "'");
965 * Given a latexified string, retrieve some handled features
966 * The features of the regex will later be compared with the features
967 * of the searched text. If the regex features are not a
968 * subset of the analized, then, in not format ignoring search
969 * we can early stop the search in the relevant inset.
971 typedef map<string, bool> Features;
973 static Features identifyFeatures(string const & s)
975 static regex const feature("\\\\(([a-zA-Z]+(\\{([a-z]+\\*?)\\}|\\*)?))\\{");
976 static regex const valid("^("
978 "(footnotesize|tiny|scriptsize|small|large|Large|LARGE|huge|Huge|"
979 "emph|noun|text(bf|md|sl|sf|it|tt)|"
980 "(textcolor|foreignlanguage|item|listitem|latexenvironment)\\{[a-z]+\\*?\\})|"
981 "(u|uu)line|(s|x)out|uwave|"
982 "(sub|extra)?title|author|subject|publishers|dedication|(upper|lower)titleback|lyx(right)?address)|"
983 "((sub)?(((sub)?section)|paragraph)|part|chapter|lyxslide)\\*?)$");
988 for (sregex_iterator it(s.begin(), s.end(), feature), end; it != end; ++it) {
991 if (sub.str(1).compare("regexp") == 0) {
995 string token = sub.str(1);
997 if (regex_match(token, sub2, valid)) {
1005 if (sub.str(1).compare("endregexp") == 0) {
1015 * defines values features of a key "\\[a-z]+{"
1020 /* Char type with content discarded
1021 * like \hspace{1cm} */
1023 /* Char, like \backslash */
1025 /* \part, \section*, ... */
1027 /* title, author etc */
1029 /* \foreignlanguage{ngerman}, ... */
1032 * to discard language in content */
1035 /* \begin{eqnarray}...\end{eqnarray}, ... $...$ */
1037 /* fonts, colors, markups, ... */
1039 /* footnotesize, ... large, ...
1040 * Ignore all of them */
1043 /* inputencoding, ...
1044 * Discard also content, because they do not help in search */
1047 * like remove, but also all arguments */
1049 /* item, listitem */
1051 /* tex, latex, ... like isChar */
1053 /* like \lettrine[lines=5]{}{} */
1055 /* End of arguments marker for lettrine,
1056 * so that they can be ignored */
1066 parenthesiscount(1),
1070 KeyInfo(KeyType type, int parcount, bool disable)
1076 parenthesiscount(parcount),
1085 int parenthesiscount;
1087 bool used; /* by pattern */
1092 Border(int l=0, int u=0) : low(l), upper(u) {};
1097 #define MAXOPENED 30
1099 bool isPatternString;
1101 explicit Intervall(bool isPattern) :
1102 isPatternString(isPattern),
1104 actualdeptindex(0) { depts[0] = 0; closes[0] = 0;};
1107 int depts[MAXOPENED];
1108 int closes[MAXOPENED];
1109 int actualdeptindex;
1110 Border borders[2*MAXOPENED];
1111 int previousNotIgnored(int);
1112 int nextNotIgnored(int);
1113 void handleOpenP(int i);
1114 void handleCloseP(int i, bool closingAllowed);
1115 void resetOpenedP(int openPos);
1116 void addIntervall(int upper);
1117 void addIntervall(int low, int upper); /* if explicit */
1118 void setForDefaultLang(KeyInfo &defLang);
1119 int findclosing(int start, int end, char up, char down, int repeat);
1120 void handleParentheses(int lastpos, bool closingAllowed);
1123 void output(ostringstream &os, int lastpos);
1124 // string show(int lastpos);
1127 void Intervall::setForDefaultLang(KeyInfo &defLang)
1129 // Enable the use of first token again
1130 if (ignoreidx >= 0) {
1131 int value = defLang._tokenstart + defLang._tokensize;
1133 if (borders[0].low < value)
1134 borders[0].low = value;
1135 if (borders[0].upper < value)
1136 borders[0].upper = value;
1141 static void checkDepthIndex(int val)
1143 static int maxdepthidx = MAXOPENED-2;
1144 if (val > maxdepthidx) {
1146 LYXERR0("maxdepthidx now " << val);
1150 static void checkIgnoreIdx(int val)
1152 static int maxignoreidx = 2*MAXOPENED - 4;
1153 if (val > maxignoreidx) {
1155 LYXERR0("maxignoreidx now " << val);
1160 * Expand the region of ignored parts of the input latex string
1161 * The region is only relevant in output()
1163 void Intervall::addIntervall(int low, int upper)
1166 if (low == upper) return;
1167 for (idx = ignoreidx+1; idx > 0; --idx) {
1168 if (low > borders[idx-1].upper) {
1172 Border br(low, upper);
1173 if (idx > ignoreidx) {
1176 checkIgnoreIdx(ignoreidx);
1180 // Expand only if one of the new bound is inside the interwall
1181 // We know here that br.low > borders[idx-1].upper
1182 if (br.upper < borders[idx].low) {
1183 // We have to insert at this pos
1184 for (int i = ignoreidx+1; i > idx; --i) {
1185 borders[i] = borders[i-1];
1189 checkIgnoreIdx(ignoreidx);
1192 // Here we know, that we are overlapping
1193 if (br.low > borders[idx].low)
1194 br.low = borders[idx].low;
1195 // check what has to be concatenated
1197 for (int i = idx; i <= ignoreidx; i++) {
1198 if (br.upper >= borders[i].low) {
1200 if (br.upper < borders[i].upper)
1201 br.upper = borders[i].upper;
1207 // count should be >= 1 here
1210 for (int i = idx + count; i <= ignoreidx; i++) {
1211 borders[i-count+1] = borders[i];
1213 ignoreidx -= count - 1;
1219 void Intervall::handleOpenP(int i)
1222 depts[actualdeptindex] = i+1;
1223 closes[actualdeptindex] = -1;
1224 checkDepthIndex(actualdeptindex);
1227 void Intervall::handleCloseP(int i, bool closingAllowed)
1229 if (actualdeptindex <= 0) {
1230 if (! closingAllowed)
1231 LYXERR(Debug::FIND, "Bad closing parenthesis in latex"); /* should not happen, but the latex input may be wrong */
1232 // if we are at the very end
1233 addIntervall(i, i+1);
1236 closes[actualdeptindex] = i+1;
1241 void Intervall::resetOpenedP(int openPos)
1243 // Used as initializer for foreignlanguage entry
1244 actualdeptindex = 1;
1245 depts[1] = openPos+1;
1249 int Intervall::previousNotIgnored(int start)
1251 int idx = 0; /* int intervalls */
1252 for (idx = ignoreidx; idx >= 0; --idx) {
1253 if (start > borders[idx].upper)
1255 if (start >= borders[idx].low)
1256 start = borders[idx].low-1;
1261 int Intervall::nextNotIgnored(int start)
1263 int idx = 0; /* int intervalls */
1264 for (idx = 0; idx <= ignoreidx; idx++) {
1265 if (start < borders[idx].low)
1267 if (start < borders[idx].upper)
1268 start = borders[idx].upper;
1273 typedef map<string, KeyInfo> KeysMap;
1274 typedef vector< KeyInfo> Entries;
1275 static KeysMap keys = map<string, KeyInfo>();
1282 void buildKeys(bool);
1283 void buildEntries(bool);
1284 void makeKey(const string &, KeyInfo, bool isPatternString);
1285 void processRegion(int start, int region_end); /* remove {} parts */
1286 void removeHead(KeyInfo&, int count=0);
1289 LatexInfo(string par, bool isPatternString) : entidx(-1), interval(isPatternString) {
1291 interval.hasTitle = false;
1292 interval.titleValue = "";
1293 buildKeys(isPatternString);
1294 entries = vector<KeyInfo>();
1295 buildEntries(isPatternString);
1299 if (entries.empty()) {
1302 if (entries[0].keytype == KeyInfo::isTitle) {
1303 if (! entries[0].disabled) {
1304 interval.hasTitle = true;
1305 interval.titleValue = entries[0].head;
1308 interval.hasTitle = false;
1309 interval.titleValue = "";
1311 removeHead(entries[0]);
1312 if (entries.size() > 1)
1321 if (int(entries.size()) > entidx) {
1328 bool setNextKey(int idx) {
1329 if ((idx == entidx) && (entidx >= 0)) {
1336 int find(int start, KeyInfo::KeyType keytype) {
1340 while (tmpIdx < int(entries.size())) {
1341 if (entries[tmpIdx].keytype == keytype)
1347 int process(ostringstream &os, KeyInfo &actual);
1348 int dispatch(ostringstream &os, int previousStart, KeyInfo &actual);
1349 // string show(int lastpos) { return interval.show(lastpos);};
1350 int nextNotIgnored(int start) { return interval.nextNotIgnored(start);};
1351 KeyInfo &getKeyInfo(int keyinfo) {
1352 static KeyInfo invalidInfo = KeyInfo();
1353 if ((keyinfo < 0) || ( keyinfo >= int(entries.size())))
1356 return entries[keyinfo];
1358 void setForDefaultLang(KeyInfo &defLang) {interval.setForDefaultLang(defLang);};
1359 void addIntervall(int low, int up) { interval.addIntervall(low, up); };
1363 int Intervall::findclosing(int start, int end, char up = '{', char down = '}', int repeat = 1)
1368 for (int i = start; i < end; i += 1 + skip) {
1372 if (c == '\\') skip = 1;
1376 else if (c == down) {
1378 if ((repeat <= 0) || (par[i+1] != up))
1396 vector<MathEntry> entries;
1401 void insert(string wait, size_t start, size_t end) {
1402 MathEntry m = MathEntry();
1404 m.mathStart = start;
1406 m.mathSize = end - start;
1407 entries.push_back(m);
1409 bool empty() { return entries.empty(); };
1410 size_t getEndPos() {
1411 if (entries.empty() || (actualIdx >= entries.size())) {
1414 return entries[actualIdx].mathEnd;
1416 size_t getStartPos() {
1417 if (entries.empty() || (actualIdx >= entries.size())) {
1418 return 100000; /* definitely enough? */
1420 return entries[actualIdx].mathStart;
1422 size_t getFirstPos() {
1424 return getStartPos();
1427 if (entries.empty() || (actualIdx >= entries.size())) {
1430 return entries[actualIdx].mathSize;
1432 void incrEntry() { actualIdx++; };
1435 void LatexInfo::buildEntries(bool isPatternString)
1437 static regex const rmath("\\$|\\\\\\[|\\\\\\]|\\\\(begin|end)\\{((eqnarray|equation|flalign|gather|multline|align|alignat)\\*?)\\}");
1438 static regex const rkeys("\\$|\\\\\\[|\\\\\\]|\\\\((([a-zA-Z]+\\*?)(\\{([a-z]+\\*?)\\}|=[0-9]+[a-z]+)?))");
1439 static bool disableLanguageOverride = false;
1440 smatch sub, submath;
1441 bool evaluatingRegexp = false;
1443 bool evaluatingMath = false;
1444 bool evaluatingCode = false;
1446 bool evaluatingOptional = false;
1447 size_t optionalEnd = 0;
1450 bool math_end_waiting = false;
1451 size_t math_pos = 10000;
1454 for (sregex_iterator itmath(interval.par.begin(), interval.par.end(), rmath), end; itmath != end; ++itmath) {
1456 if (math_end_waiting) {
1457 size_t pos = submath.position(size_t(0));
1458 if ((math_end == "$") &&
1459 (submath.str(0) == "$") &&
1460 (interval.par[pos-1] != '\\')) {
1461 mi.insert("$", math_pos, pos + 1);
1462 math_end_waiting = false;
1464 else if ((math_end == "\\]") &&
1465 (submath.str(0) == "\\]")) {
1466 mi.insert("\\]", math_pos, pos + 2);
1467 math_end_waiting = false;
1469 else if ((submath.str(1).compare("end") == 0) &&
1470 (submath.str(2).compare(math_end) == 0)) {
1471 mi.insert(math_end, math_pos, pos + submath.str(0).length());
1472 math_end_waiting = false;
1478 if (submath.str(1).compare("begin") == 0) {
1479 math_end_waiting = true;
1480 math_end = submath.str(2);
1481 math_pos = submath.position(size_t(0));
1483 else if (submath.str(0).compare("\\[") == 0) {
1484 math_end_waiting = true;
1486 math_pos = submath.position(size_t(0));
1488 else if (submath.str(0) == "$") {
1489 size_t pos = submath.position(size_t(0));
1490 if ((pos == 0) || (interval.par[pos-1] != '\\')) {
1491 math_end_waiting = true;
1498 // Ignore language if there is math somewhere in pattern-string
1499 if (isPatternString) {
1502 keys["foreignlanguage"].disabled = true;
1503 disableLanguageOverride = true;
1506 disableLanguageOverride = false;
1509 if (disableLanguageOverride) {
1510 keys["foreignlanguage"].disabled = true;
1513 math_pos = mi.getFirstPos();
1514 for (sregex_iterator it(interval.par.begin(), interval.par.end(), rkeys), end; it != end; ++it) {
1516 string key = sub.str(3);
1518 if (sub.str(0)[0] == '\\')
1519 key = sub.str(0)[1];
1523 size_t k_pos = sub.position(size_t(0));
1524 if ((k_pos > 0) && (interval.par[k_pos - 1] == '\\')) {
1525 // Escaped '$', ignoring
1531 if (evaluatingRegexp) {
1532 if (sub.str(1).compare("endregexp") == 0) {
1533 evaluatingRegexp = false;
1534 // found._tokenstart already set
1535 found._dataEnd = sub.position(size_t(0)) + 13;
1536 found._dataStart = found._dataEnd;
1537 found._tokensize = found._dataEnd - found._tokenstart;
1538 found.parenthesiscount = 0;
1539 found.head = interval.par.substr(found._tokenstart, found._tokensize);
1545 if (evaluatingMath) {
1546 if (size_t(sub.position(size_t(0))) < mi.getEndPos())
1548 evaluatingMath = false;
1550 math_pos = mi.getStartPos();
1552 if (keys.find(key) == keys.end()) {
1553 found = KeyInfo(KeyInfo::isStandard, 0, true);
1554 if (isPatternString) {
1555 found.keytype = KeyInfo::isChar;
1556 found.disabled = false;
1563 if (key.compare("regexp") == 0) {
1564 evaluatingRegexp = true;
1565 found._tokenstart = sub.position(size_t(0));
1566 found._tokensize = 0;
1570 // Handle the other params of key
1571 if (found.keytype == KeyInfo::isIgnored)
1573 else if (found.keytype == KeyInfo::isMath) {
1574 if (size_t(sub.position(size_t(0))) == math_pos) {
1576 found._tokenstart = sub.position(size_t(0));
1577 found._tokensize = mi.getSize();
1578 found._dataEnd = found._tokenstart + found._tokensize;
1579 found._dataStart = found._dataEnd;
1580 found.parenthesiscount = 0;
1581 found.head = interval.par.substr(found._tokenstart, found._tokensize);
1582 evaluatingMath = true;
1585 // begin|end of unknown env, discard
1586 // First handle tables
1587 // longtable|tabular
1588 bool discardComment;
1590 found.keytype = KeyInfo::doRemove;
1591 if ((sub.str(5).compare("longtable") == 0) ||
1592 (sub.str(5).compare("tabular") == 0)) {
1593 discardComment = true; /* '%' */
1596 discardComment = false;
1597 static regex const removeArgs("^(multicols|multipar|sectionbox|subsectionbox|tcolorbox)$");
1599 string token = sub.str(5);
1600 if (regex_match(token, sub2, removeArgs)) {
1601 found.keytype = KeyInfo::removeWithArg;
1604 // discard spaces before pos(0)
1605 int pos = sub.position(size_t(0));
1607 for (count = 0; pos - count > 0; count++) {
1608 char c = interval.par[pos-count-1];
1609 if (discardComment) {
1610 if ((c != ' ') && (c != '%'))
1616 found._tokenstart = pos - count;
1617 if (sub.str(1).compare(0, 5, "begin") == 0) {
1618 size_t pos1 = pos + sub.str(0).length();
1619 if (sub.str(5).compare("cjk") == 0) {
1620 pos1 = interval.findclosing(pos1+1, interval.par.length()) + 1;
1621 if ((interval.par[pos1] == '{') && (interval.par[pos1+1] == '}'))
1623 found.keytype = KeyInfo::isMain;
1624 found._dataStart = pos1;
1625 found._dataEnd = interval.par.length();
1626 found.disabled = keys["foreignlanguage"].disabled;
1627 found.used = keys["foreignlanguage"].used;
1628 found._tokensize = pos1 - found._tokenstart;
1629 found.head = interval.par.substr(found._tokenstart, found._tokensize);
1632 // Swallow possible optional params
1633 while (interval.par[pos1] == '[') {
1634 pos1 = interval.findclosing(pos1+1, interval.par.length(), '[', ']')+1;
1636 // Swallow also the eventual parameter
1637 if (interval.par[pos1] == '{') {
1638 found._dataEnd = interval.findclosing(pos1+1, interval.par.length()) + 1;
1641 found._dataEnd = pos1;
1643 found._dataStart = found._dataEnd;
1644 found._tokensize = count + found._dataEnd - pos;
1645 found.parenthesiscount = 0;
1646 found.head = interval.par.substr(found._tokenstart, found._tokensize);
1647 found.disabled = true;
1651 // Handle "\end{...}"
1652 found._dataStart = pos + sub.str(0).length();
1653 found._dataEnd = found._dataStart;
1654 found._tokensize = count + found._dataEnd - pos;
1655 found.parenthesiscount = 0;
1656 found.head = interval.par.substr(found._tokenstart, found._tokensize);
1657 found.disabled = true;
1661 else if (found.keytype != KeyInfo::isRegex) {
1662 found._tokenstart = sub.position(size_t(0));
1663 if (found.parenthesiscount == 0) {
1664 // Probably to be discarded
1665 size_t following_pos = sub.position(size_t(0)) + sub.str(3).length() + 1;
1666 char following = interval.par[following_pos];
1667 if (following == ' ')
1668 found.head = "\\" + sub.str(3) + " ";
1669 else if (following == '=') {
1670 // like \uldepth=1000pt
1671 found.head = sub.str(0);
1674 found.head = "\\" + key;
1675 found._tokensize = found.head.length();
1676 found._dataEnd = found._tokenstart + found._tokensize;
1677 found._dataStart = found._dataEnd;
1680 int params = found._tokenstart + key.length() + 1;
1681 if (evaluatingOptional) {
1682 if (size_t(found._tokenstart) > optionalEnd) {
1683 evaluatingOptional = false;
1686 found.disabled = true;
1689 int optend = params;
1690 while (interval.par[optend] == '[') {
1691 // discard optional parameters
1692 optend = interval.findclosing(optend+1, interval.par.length(), '[', ']') + 1;
1694 if (optend > params) {
1695 key += interval.par.substr(params, optend-params);
1696 evaluatingOptional = true;
1697 optionalEnd = optend;
1699 string token = sub.str(5);
1700 int closings = found.parenthesiscount;
1701 if (found.parenthesiscount == 1) {
1702 found.head = "\\" + key + "{";
1704 else if (found.parenthesiscount > 1) {
1706 found.head = sub.str(0) + "{";
1707 closings = found.parenthesiscount - 1;
1710 found.head = "\\" + key + "{";
1713 found._tokensize = found.head.length();
1714 found._dataStart = found._tokenstart + found.head.length();
1715 if (interval.par.substr(found._dataStart-1, 15).compare("\\endarguments{}") == 0) {
1716 found._dataStart += 15;
1718 size_t endpos = interval.findclosing(found._dataStart, interval.par.length(), '{', '}', closings);
1719 if (found.keytype == KeyInfo::isList) {
1720 // Check if it really is list env
1721 static regex const listre("^([a-z]+)$");
1723 if (!regex_match(token, sub2, listre)) {
1724 // Change the key of this entry. It is not in a list/item environment
1725 found.keytype = KeyInfo::endArguments;
1728 if (found.keytype == KeyInfo::noMain) {
1729 evaluatingCode = true;
1731 codeStart = found._dataStart;
1733 else if (evaluatingCode) {
1734 if (size_t(found._dataStart) > codeEnd)
1735 evaluatingCode = false;
1736 else if (found.keytype == KeyInfo::isMain) {
1737 // Disable this key, treate it as standard
1738 found.keytype = KeyInfo::isStandard;
1739 found.disabled = true;
1740 if ((codeEnd == interval.par.length()) &&
1741 (found._tokenstart == codeStart)) {
1742 // trickery, because the code inset starts
1743 // with \selectlanguage ...
1745 if (entries.size() > 1) {
1746 entries[entries.size()-1]._dataEnd = codeEnd;
1751 if ((endpos == interval.par.length()) &&
1752 (found.keytype == KeyInfo::doRemove)) {
1753 // Missing closing => error in latex-input?
1754 // therefore do not delete remaining data
1755 found._dataStart -= 1;
1756 found._dataEnd = found._dataStart;
1759 found._dataEnd = endpos;
1761 if (isPatternString) {
1762 keys[key].used = true;
1765 entries.push_back(found);
1769 void LatexInfo::makeKey(const string &keysstring, KeyInfo keyI, bool isPatternString)
1771 stringstream s(keysstring);
1773 const char delim = '|';
1774 while (getline(s, key, delim)) {
1775 KeyInfo keyII(keyI);
1776 if (isPatternString) {
1779 else if ( !keys[key].used)
1780 keyII.disabled = true;
1785 void LatexInfo::buildKeys(bool isPatternString)
1788 static bool keysBuilt = false;
1789 if (keysBuilt && !isPatternString) return;
1791 // Known standard keys with 1 parameter.
1792 // Split is done, if not at start of region
1793 makeKey("textsf|textss|texttt", KeyInfo(KeyInfo::isStandard, 1, ignoreFormats.getFamily()), isPatternString);
1794 makeKey("textbf", KeyInfo(KeyInfo::isStandard, 1, ignoreFormats.getSeries()), isPatternString);
1795 makeKey("textit|textsc|textsl", KeyInfo(KeyInfo::isStandard, 1, ignoreFormats.getShape()), isPatternString);
1796 makeKey("uuline|uline|uwave", KeyInfo(KeyInfo::isStandard, 1, ignoreFormats.getUnderline()), isPatternString);
1797 makeKey("emph|noun", KeyInfo(KeyInfo::isStandard, 1, ignoreFormats.getMarkUp()), isPatternString);
1798 makeKey("sout|xout", KeyInfo(KeyInfo::isStandard, 1, ignoreFormats.getStrikeOut()), isPatternString);
1800 makeKey("section|subsection|subsubsection|paragraph|subparagraph|minisec",
1801 KeyInfo(KeyInfo::isSectioning, 1, ignoreFormats.getSectioning()), isPatternString);
1802 makeKey("section*|subsection*|subsubsection*|paragraph*",
1803 KeyInfo(KeyInfo::isSectioning, 1, ignoreFormats.getSectioning()), isPatternString);
1804 makeKey("part|part*|chapter|chapter*", KeyInfo(KeyInfo::isSectioning, 1, ignoreFormats.getSectioning()), isPatternString);
1805 makeKey("title|subtitle|author|subject|publishers|dedication|uppertitleback|lowertitleback|extratitle|lyxaddress|lyxrightaddress", KeyInfo(KeyInfo::isTitle, 1, ignoreFormats.getFrontMatter()), isPatternString);
1807 makeKey("regexp", KeyInfo(KeyInfo::isRegex, 1, false), isPatternString);
1809 // Split is done, if not at start of region
1810 makeKey("textcolor", KeyInfo(KeyInfo::isStandard, 2, ignoreFormats.getColor()), isPatternString);
1811 makeKey("latexenvironment", KeyInfo(KeyInfo::isStandard, 2, false), isPatternString);
1813 // Split is done always.
1814 makeKey("foreignlanguage", KeyInfo(KeyInfo::isMain, 2, ignoreFormats.getLanguage()), isPatternString);
1818 makeKey("backslash|textbackslash|slash", KeyInfo(KeyInfo::isChar, 0, false), isPatternString);
1819 makeKey("textasciicircum|textasciitilde", KeyInfo(KeyInfo::isChar, 0, false), isPatternString);
1820 makeKey("textasciiacute|texemdash", KeyInfo(KeyInfo::isChar, 0, false), isPatternString);
1821 makeKey("dots|ldots", KeyInfo(KeyInfo::isChar, 0, false), isPatternString);
1823 makeKey("quad|qquad|hfill|dotfill", KeyInfo(KeyInfo::isChar, 0, false), isPatternString);
1824 makeKey("textvisiblespace|nobreakspace", KeyInfo(KeyInfo::isChar, 0, false), isPatternString);
1825 makeKey("negthickspace|negmedspace|negthinspace", KeyInfo(KeyInfo::isChar, 0, false), isPatternString);
1827 // makeKey("enskip|smallskip|medskip|bigskip|vfill", KeyInfo(KeyInfo::isChar, 0, false), isPatternString);
1828 // Custom space/skip, remove the content (== length value)
1829 makeKey("vspace|hspace|mspace", KeyInfo(KeyInfo::noContent, 1, false), isPatternString);
1830 // Found in fr/UserGuide.lyx
1831 makeKey("og|fg", KeyInfo(KeyInfo::isChar, 0, false), isPatternString);
1833 makeKey("textquotedbl|quotesinglbase|lyxarrow", KeyInfo(KeyInfo::isChar, 0, false), isPatternString);
1834 makeKey("textquotedblleft|textquotedblright", KeyInfo(KeyInfo::isChar, 0, false), isPatternString);
1835 // Known macros to remove (including their parameter)
1837 makeKey("input|inputencoding|label|ref|index|bibitem", KeyInfo(KeyInfo::doRemove, 1, false), isPatternString);
1838 makeKey("addtocounter|setlength", KeyInfo(KeyInfo::noContent, 2, true), isPatternString);
1839 // handle like standard keys with 1 parameter.
1840 makeKey("url|href|vref|thanks", KeyInfo(KeyInfo::isStandard, 1, false), isPatternString);
1842 // Macros to remove, but let the parameter survive
1844 makeKey("menuitem|textmd|textrm", KeyInfo(KeyInfo::isStandard, 1, true), isPatternString);
1846 // Remove language spec from content of these insets
1847 makeKey("code", KeyInfo(KeyInfo::noMain, 1, false), isPatternString);
1849 // Same effect as previous, parameter will survive (because there is no one anyway)
1851 makeKey("noindent|textcompwordmark|maketitle", KeyInfo(KeyInfo::isStandard, 0, true), isPatternString);
1852 // Remove table decorations
1853 makeKey("hline|tabularnewline|toprule|bottomrule|midrule", KeyInfo(KeyInfo::doRemove, 0, true), isPatternString);
1854 // Discard shape-header.
1855 // For footnote or shortcut too, because of lang settings
1856 // and wrong handling if used 'KeyInfo::noMain'
1857 makeKey("circlepar|diamondpar|heartpar|nutpar", KeyInfo(KeyInfo::isStandard, 1, true), isPatternString);
1858 makeKey("trianglerightpar|hexagonpar|starpar", KeyInfo(KeyInfo::isStandard, 1, true), isPatternString);
1859 makeKey("triangleuppar|triangledownpar|droppar", KeyInfo(KeyInfo::isStandard, 1, true), isPatternString);
1860 makeKey("triangleleftpar|shapepar|dropuppar", KeyInfo(KeyInfo::isStandard, 1, true), isPatternString);
1861 makeKey("hphantom|footnote|shortcut|includegraphics", KeyInfo(KeyInfo::isStandard, 1, true), isPatternString);
1862 makeKey("parbox", KeyInfo(KeyInfo::doRemove, 1, true), isPatternString);
1863 // like ('tiny{}' or '\tiny ' ... )
1864 makeKey("footnotesize|tiny|scriptsize|small|large|Large|LARGE|huge|Huge", KeyInfo(KeyInfo::isSize, 0, false), isPatternString);
1866 // Survives, like known character
1867 makeKey("lyx|LyX|latex|LaTeX|latexe|LaTeXe|tex|TeX", KeyInfo(KeyInfo::isChar, 0, false), isPatternString);
1868 makeKey("item|listitem", KeyInfo(KeyInfo::isList, 1, false), isPatternString);
1870 makeKey("begin|end", KeyInfo(KeyInfo::isMath, 1, false), isPatternString);
1871 makeKey("[|]", KeyInfo(KeyInfo::isMath, 1, false), isPatternString);
1872 makeKey("$", KeyInfo(KeyInfo::isMath, 1, false), isPatternString);
1874 makeKey("par|uldepth|ULdepth|protect|nobreakdash|medskip|relax", KeyInfo(KeyInfo::isStandard, 0, true), isPatternString);
1875 // Remove RTL/LTR marker
1876 makeKey("l|r|textlr|textfr|textar|beginl|endl", KeyInfo(KeyInfo::isStandard, 0, true), isPatternString);
1877 makeKey("lettrine", KeyInfo(KeyInfo::cleanToStart, 0, true), isPatternString);
1878 makeKey("lyxslide", KeyInfo(KeyInfo::isSectioning, 1, true), isPatternString);
1879 makeKey("endarguments", KeyInfo(KeyInfo::endArguments, 0, true), isPatternString);
1880 makeKey("twocolumn", KeyInfo(KeyInfo::removeWithArg, 2, true), isPatternString);
1881 makeKey("tnotetext|ead|fntext|cortext|address", KeyInfo(KeyInfo::removeWithArg, 0, true), isPatternString);
1882 makeKey("lyxend", KeyInfo(KeyInfo::isStandard, 0, true), isPatternString);
1883 if (isPatternString) {
1884 // Allow the first searched string to rebuild the keys too
1888 // no need to rebuild again
1894 * Keep the list of actual opened parentheses actual
1895 * (e.g. depth == 4 means there are 4 '{' not processed yet)
1897 void Intervall::handleParentheses(int lastpos, bool closingAllowed)
1900 for (int i = depts[actualdeptindex]; i < lastpos; i+= 1 + skip) {
1904 if (c == '\\') skip = 1;
1905 else if (c == '{') {
1908 else if (c == '}') {
1909 handleCloseP(i, closingAllowed);
1915 string Intervall::show(int lastpos)
1917 int idx = 0; /* int intervalls */
1920 for (idx = 0; idx <= ignoreidx; idx++) {
1921 while (i < lastpos) {
1923 if (i <= borders[idx].low) {
1924 if (borders[idx].low > lastpos)
1925 printsize = lastpos - i;
1927 printsize = borders[idx].low - i;
1928 s += par.substr(i, printsize);
1930 if (i >= borders[idx].low)
1931 i = borders[idx].upper;
1934 i = borders[idx].upper;
1940 s += par.substr(i, lastpos-i);
1946 void Intervall::output(ostringstream &os, int lastpos)
1948 // get number of chars to output
1949 int idx = 0; /* int intervalls */
1952 string startTitle = titleValue;
1953 for (idx = 0; idx <= ignoreidx; idx++) {
1955 if (i <= borders[idx].low) {
1957 if (borders[idx].low > lastpos)
1958 printsize = lastpos - i;
1960 printsize = borders[idx].low - i;
1961 if (printsize > 0) {
1962 os << startTitle << par.substr(i, printsize);
1964 printed += printsize;
1967 handleParentheses(i, false);
1968 if (i >= borders[idx].low)
1969 i = borders[idx].upper;
1972 i = borders[idx].upper;
1979 os << startTitle << par.substr(i, lastpos-i);
1980 printed += lastpos-i;
1982 handleParentheses(lastpos, false);
1983 for (int i = actualdeptindex; i > 0; --i) {
1986 if (hasTitle && (printed > 0))
1988 if (! isPatternString)
1990 handleParentheses(lastpos, true); /* extra closings '}' allowed here */
1993 void LatexInfo::processRegion(int start, int region_end)
1995 while (start < region_end) { /* Let {[} and {]} survive */
1996 if ((interval.par[start] == '{') &&
1997 (interval.par[start+1] != ']') &&
1998 (interval.par[start+1] != '[')) {
1999 // Closing is allowed past the region
2000 int closing = interval.findclosing(start+1, interval.par.length());
2001 interval.addIntervall(start, start+1);
2002 interval.addIntervall(closing, closing+1);
2004 start = interval.nextNotIgnored(start+1);
2008 void LatexInfo::removeHead(KeyInfo &actual, int count)
2010 if (actual.parenthesiscount == 0) {
2011 // "{\tiny{} ...}" ==> "{{} ...}"
2012 interval.addIntervall(actual._tokenstart-count, actual._tokenstart + actual._tokensize);
2015 // Remove header hull, that is "\url{abcd}" ==> "abcd"
2016 interval.addIntervall(actual._tokenstart - count, actual._dataStart);
2017 interval.addIntervall(actual._dataEnd, actual._dataEnd+1);
2021 int LatexInfo::dispatch(ostringstream &os, int previousStart, KeyInfo &actual)
2024 switch (actual.keytype)
2026 case KeyInfo::isTitle: {
2028 nextKeyIdx = getNextKey();
2031 case KeyInfo::cleanToStart: {
2032 actual._dataEnd = actual._dataStart;
2033 nextKeyIdx = getNextKey();
2034 // Search for end of arguments
2035 int tmpIdx = find(nextKeyIdx, KeyInfo::endArguments);
2037 for (int i = nextKeyIdx; i <= tmpIdx; i++) {
2038 entries[i].disabled = true;
2040 actual._dataEnd = entries[tmpIdx]._dataEnd;
2042 while (interval.par[actual._dataEnd] == ' ')
2044 interval.addIntervall(0, actual._dataEnd+1);
2045 interval.actualdeptindex = 0;
2046 interval.depts[0] = actual._dataEnd+1;
2047 interval.closes[0] = -1;
2050 case KeyInfo::noContent: { /* char like "\hspace{2cm}" */
2051 if (actual.disabled)
2052 interval.addIntervall(actual._tokenstart, actual._dataEnd);
2054 interval.addIntervall(actual._dataStart, actual._dataEnd);
2057 case KeyInfo::isChar: {
2058 nextKeyIdx = getNextKey();
2061 case KeyInfo::isSize: {
2062 if (actual.disabled || (interval.par[actual._dataStart] != '{') || (interval.par[actual._dataStart-1] == ' ')) {
2063 processRegion(actual._dataEnd, actual._dataEnd+1); /* remove possibly following {} */
2064 interval.addIntervall(actual._tokenstart, actual._dataEnd+1);
2065 nextKeyIdx = getNextKey();
2067 // Here _dataStart points to '{', so correct it
2068 actual._dataStart += 1;
2069 actual._tokensize += 1;
2070 actual.parenthesiscount = 1;
2071 if (interval.par[actual._dataStart] == '}') {
2072 // Determine the end if used like '{\tiny{}...}'
2073 actual._dataEnd = interval.findclosing(actual._dataStart+1, interval.par.length()) + 1;
2074 interval.addIntervall(actual._dataStart, actual._dataStart+1);
2077 // Determine the end if used like '\tiny{...}'
2078 actual._dataEnd = interval.findclosing(actual._dataStart, interval.par.length()) + 1;
2080 // Split on this key if not at start
2081 int start = interval.nextNotIgnored(previousStart);
2082 if (start < actual._tokenstart) {
2083 interval.output(os, actual._tokenstart);
2084 interval.addIntervall(start, actual._tokenstart);
2086 // discard entry if at end of actual
2087 nextKeyIdx = process(os, actual);
2091 case KeyInfo::endArguments:
2092 // Remove trailing '{}' too
2093 actual._dataStart += 2;
2094 actual._dataEnd += 2;
2095 interval.addIntervall(actual._tokenstart, actual._dataEnd);
2096 nextKeyIdx = getNextKey();
2098 case KeyInfo::noMain:
2100 case KeyInfo::isStandard: {
2101 if (actual.disabled) {
2103 processRegion(actual._dataStart, actual._dataStart+1);
2104 nextKeyIdx = getNextKey();
2106 // Split on this key if not at datastart of calling entry
2107 int start = interval.nextNotIgnored(previousStart);
2108 if (start < actual._tokenstart) {
2109 interval.output(os, actual._tokenstart);
2110 interval.addIntervall(start, actual._tokenstart);
2112 // discard entry if at end of actual
2113 nextKeyIdx = process(os, actual);
2117 case KeyInfo::removeWithArg: {
2118 nextKeyIdx = getNextKey();
2119 // Search for end of arguments
2120 int tmpIdx = find(nextKeyIdx, KeyInfo::endArguments);
2122 for (int i = nextKeyIdx; i <= tmpIdx; i++) {
2123 entries[i].disabled = true;
2125 actual._dataEnd = entries[tmpIdx]._dataEnd;
2127 interval.addIntervall(actual._tokenstart, actual._dataEnd+1);
2130 case KeyInfo::doRemove: {
2131 // Remove the key with all parameters and following spaces
2133 for (pos = actual._dataEnd+1; pos < interval.par.length(); pos++) {
2134 if ((interval.par[pos] != ' ') && (interval.par[pos] != '%'))
2137 interval.addIntervall(actual._tokenstart, pos);
2138 nextKeyIdx = getNextKey();
2141 case KeyInfo::isList: {
2142 // Discard space before _tokenstart
2144 for (count = 0; count < actual._tokenstart; count++) {
2145 if (interval.par[actual._tokenstart-count-1] != ' ')
2148 nextKeyIdx = getNextKey();
2149 int tmpIdx = find(nextKeyIdx, KeyInfo::endArguments);
2151 // Special case: \item is not a list, but a command (like in Style Author_Biography in maa-monthly.layout)
2153 // How else can we catch this one?
2154 for (int i = nextKeyIdx; i <= tmpIdx; i++) {
2155 entries[i].disabled = true;
2157 actual._dataEnd = entries[tmpIdx]._dataEnd;
2159 else if (nextKeyIdx > 0) {
2160 // Ignore any lang entries inside data region
2161 for (int i = nextKeyIdx; i < int(entries.size()) && entries[i]._tokenstart < actual._dataEnd; i++) {
2162 if (entries[i].keytype == KeyInfo::isMain)
2163 entries[i].disabled = true;
2166 if (actual.disabled) {
2167 interval.addIntervall(actual._tokenstart-count, actual._dataEnd+1);
2170 interval.addIntervall(actual._tokenstart-count, actual._tokenstart);
2172 if (interval.par[actual._dataEnd+1] == '[') {
2173 int posdown = interval.findclosing(actual._dataEnd+2, interval.par.length(), '[', ']');
2174 if ((interval.par[actual._dataEnd+2] == '{') &&
2175 (interval.par[posdown-1] == '}')) {
2176 interval.addIntervall(actual._dataEnd+1,actual._dataEnd+3);
2177 interval.addIntervall(posdown-1, posdown+1);
2180 interval.addIntervall(actual._dataEnd+1, actual._dataEnd+2);
2181 interval.addIntervall(posdown, posdown+1);
2183 int blk = interval.nextNotIgnored(actual._dataEnd+1);
2184 if (blk > posdown) {
2185 // Discard at most 1 space after empty item
2187 for (count = 0; count < 1; count++) {
2188 if (interval.par[blk+count] != ' ')
2192 interval.addIntervall(blk, blk+count);
2197 case KeyInfo::isSectioning: {
2198 // Discard spaces before _tokenstart
2200 int val = actual._tokenstart;
2201 for (count = 0; count < actual._tokenstart;) {
2202 val = interval.previousNotIgnored(val-1);
2203 if (interval.par[val] != ' ')
2206 count = actual._tokenstart - val;
2209 if (actual.disabled) {
2210 removeHead(actual, count);
2211 nextKeyIdx = getNextKey();
2213 interval.addIntervall(actual._tokenstart-count, actual._tokenstart);
2214 nextKeyIdx = process(os, actual);
2218 case KeyInfo::isMath: {
2219 // Same as regex, use the content unchanged
2220 nextKeyIdx = getNextKey();
2223 case KeyInfo::isRegex: {
2224 // DO NOT SPLIT ON REGEX
2226 nextKeyIdx = getNextKey();
2229 case KeyInfo::isIgnored: {
2230 // Treat like a character for now
2231 nextKeyIdx = getNextKey();
2234 case KeyInfo::isMain: {
2235 if (interval.par.substr(actual._dataStart, 2) == "% ")
2236 interval.addIntervall(actual._dataStart, actual._dataStart+2);
2237 if (actual._tokenstart > 0) {
2238 int prev = interval.previousNotIgnored(actual._tokenstart - 1);
2239 if ((prev >= 0) && interval.par[prev] == '%')
2240 interval.addIntervall(prev, prev+1);
2242 if (actual.disabled) {
2244 if ((interval.par.substr(actual._dataStart, 3) == " \\[") ||
2245 (interval.par.substr(actual._dataStart, 8) == " \\begin{")) {
2246 // Discard also the space before math-equation
2247 interval.addIntervall(actual._dataStart, actual._dataStart+1);
2249 nextKeyIdx = getNextKey();
2250 // interval.resetOpenedP(actual._dataStart-1);
2253 if (actual._tokenstart < 26) {
2254 // for the first (and maybe dummy) language
2255 interval.setForDefaultLang(actual);
2257 interval.resetOpenedP(actual._dataStart-1);
2261 case KeyInfo::invalid:
2262 // This cannot happen, already handled
2265 // LYXERR0("Unhandled keytype");
2266 nextKeyIdx = getNextKey();
2273 int LatexInfo::process(ostringstream &os, KeyInfo &actual )
2275 int end = interval.nextNotIgnored(actual._dataEnd);
2276 int oldStart = actual._dataStart;
2277 int nextKeyIdx = getNextKey();
2279 if ((nextKeyIdx < 0) ||
2280 (entries[nextKeyIdx]._tokenstart >= actual._dataEnd) ||
2281 (entries[nextKeyIdx].keytype == KeyInfo::invalid)) {
2282 if (oldStart <= end) {
2283 processRegion(oldStart, end);
2288 KeyInfo &nextKey = getKeyInfo(nextKeyIdx);
2290 if ((nextKey.keytype == KeyInfo::isMain) && !nextKey.disabled) {
2291 (void) dispatch(os, actual._dataStart, nextKey);
2292 end = nextKey._tokenstart;
2295 processRegion(oldStart, nextKey._tokenstart);
2296 nextKeyIdx = dispatch(os, actual._dataStart, nextKey);
2298 oldStart = nextKey._dataEnd+1;
2300 // now nextKey is either invalid or is outside of actual._dataEnd
2301 // output the remaining and discard myself
2302 if (oldStart <= end) {
2303 processRegion(oldStart, end);
2305 if (interval.par[end] == '}') {
2307 // This is the normal case.
2308 // But if using the firstlanguage, the closing may be missing
2310 // get minimum of 'end' and 'actual._dataEnd' in case that the nextKey.keytype was 'KeyInfo::isMain'
2312 if (actual._dataEnd < end)
2313 output_end = interval.nextNotIgnored(actual._dataEnd);
2315 output_end = interval.nextNotIgnored(end);
2316 if ((actual.keytype == KeyInfo::isMain) && actual.disabled) {
2317 interval.addIntervall(actual._tokenstart, actual._tokenstart+actual._tokensize);
2319 // Remove possible empty data
2320 int dstart = interval.nextNotIgnored(actual._dataStart);
2321 while ((dstart < output_end) && (interval.par[dstart] == '{')) {
2322 interval.addIntervall(dstart, dstart+1);
2323 int dend = interval.findclosing(dstart+1, output_end);
2324 interval.addIntervall(dend, dend+1);
2325 dstart = interval.nextNotIgnored(dstart+1);
2327 if (dstart < output_end)
2328 interval.output(os, output_end);
2329 interval.addIntervall(actual._tokenstart, end);
2333 string splitOnKnownMacros(string par, bool isPatternString)
2336 LatexInfo li(par, isPatternString);
2337 // LYXERR0("Berfore split: " << par);
2338 KeyInfo DummyKey = KeyInfo(KeyInfo::KeyType::isMain, 2, true);
2340 DummyKey._tokensize = 0;
2341 DummyKey._dataStart = 0;
2342 DummyKey._dataEnd = par.length();
2343 DummyKey.disabled = true;
2344 int firstkeyIdx = li.getFirstKey();
2346 if (firstkeyIdx >= 0) {
2347 KeyInfo firstKey = li.getKeyInfo(firstkeyIdx);
2348 DummyKey._tokenstart = firstKey._tokenstart;
2350 if ((firstKey.keytype != KeyInfo::isMain) || firstKey.disabled) {
2351 // Use dummy firstKey
2352 firstKey = DummyKey;
2353 (void) li.setNextKey(firstkeyIdx);
2356 if (par.substr(firstKey._dataStart, 2) == "% ")
2357 li.addIntervall(firstKey._dataStart, firstKey._dataStart+2);
2359 nextkeyIdx = li.process(os, firstKey);
2360 while (nextkeyIdx >= 0) {
2361 // Check for a possible gap between the last
2362 // entry and this one
2363 int datastart = li.nextNotIgnored(firstKey._dataStart);
2364 KeyInfo &nextKey = li.getKeyInfo(nextkeyIdx);
2365 if ((nextKey._tokenstart > datastart)) {
2367 firstKey._dataStart = datastart;
2368 firstKey._dataEnd = par.length();
2369 (void) li.setNextKey(nextkeyIdx);
2370 // Fake the last opened parenthesis
2371 li.setForDefaultLang(firstKey);
2372 nextkeyIdx = li.process(os, firstKey);
2375 if (nextKey.keytype != KeyInfo::isMain) {
2376 firstKey._dataStart = datastart;
2377 firstKey._dataEnd = nextKey._dataEnd+1;
2378 (void) li.setNextKey(nextkeyIdx);
2379 li.setForDefaultLang(firstKey);
2380 nextkeyIdx = li.process(os, firstKey);
2383 nextkeyIdx = li.process(os, nextKey);
2387 // Handle the remaining
2388 firstKey._dataStart = li.nextNotIgnored(firstKey._dataStart);
2389 firstKey._dataEnd = par.length();
2391 if ((firstKey._dataStart < firstKey._dataEnd) &&
2392 (par[firstKey._dataStart] != '}')) {
2393 li.setForDefaultLang(firstKey);
2394 (void) li.process(os, firstKey);
2398 // return string definitelly impossible to match
2399 s = "\\foreignlanguage{ignore}{ }";
2403 s = par; /* no known macros found */
2404 // LYXERR0("After split: " << s);
2409 * Try to unify the language specs in the latexified text.
2410 * Resulting modified string is set to "", if
2411 * the searched tex does not contain all the features in the search pattern
2413 static string correctlanguagesetting(string par, bool isPatternString, bool withformat)
2415 static Features regex_f;
2416 static int missed = 0;
2417 static bool regex_with_format = false;
2419 int parlen = par.length();
2421 while ((parlen > 0) && (par[parlen-1] == '\n')) {
2424 if (isPatternString && (parlen > 0) && (par[parlen-1] == '~')) {
2425 // Happens to be there in case of description or labeling environment
2430 // Split the latex input into pieces which
2431 // can be digested by our search engine
2432 LYXERR(Debug::FIND, "input: \"" << par << "\"");
2433 result = splitOnKnownMacros(par.substr(0,parlen), isPatternString);
2434 LYXERR(Debug::FIND, "After split: \"" << result << "\"");
2437 result = par.substr(0, parlen);
2438 if (isPatternString) {
2441 regex_f = identifyFeatures(result);
2442 string features = "";
2443 for (auto it = regex_f.cbegin(); it != regex_f.cend(); ++it) {
2444 string a = it->first;
2445 regex_with_format = true;
2446 features += " " + a;
2447 // LYXERR0("Identified regex format:" << a);
2449 LYXERR(Debug::FIND, "Identified Features" << features);
2452 } else if (regex_with_format) {
2453 Features info = identifyFeatures(result);
2454 for (auto it = regex_f.cbegin(); it != regex_f.cend(); ++it) {
2455 string a = it->first;
2456 bool b = it->second;
2457 if (b && ! info[a]) {
2459 LYXERR(Debug::FIND, "Missed(" << missed << " " << a <<", srclen = " << parlen );
2465 // LYXERR0("No regex formats");
2471 // Remove trailing closure of math, macros and environments, so to catch parts of them.
2472 static int identifyClosing(string & t)
2474 int open_braces = 0;
2476 LYXERR(Debug::FIND, "identifyClosing(): t now is '" << t << "'");
2477 if (regex_replace(t, t, "(.*[^\\\\])\\$" REGEX_EOS, "$1"))
2479 if (regex_replace(t, t, "(.*[^\\\\]) \\\\\\]" REGEX_EOS, "$1"))
2481 if (regex_replace(t, t, "(.*[^\\\\]) \\\\end\\{[a-zA-Z_]*\\*?\\}" REGEX_EOS, "$1"))
2483 if (regex_replace(t, t, "(.*[^\\\\])\\}" REGEX_EOS, "$1")) {
2493 MatchStringAdv::MatchStringAdv(lyx::Buffer & buf, FindAndReplaceOptions const & opt)
2494 : p_buf(&buf), p_first_buf(&buf), opt(opt)
2496 Buffer & find_buf = *theBufferList().getBuffer(FileName(to_utf8(opt.find_buf_name)), true);
2497 docstring const & ds = stringifySearchBuffer(find_buf, opt);
2498 use_regexp = lyx::to_utf8(ds).find("\\regexp{") != std::string::npos;
2499 // When using regexp, braces are hacked already by escape_for_regex()
2500 par_as_string = normalize(ds, !use_regexp);
2502 close_wildcards = 0;
2504 size_t lead_size = 0;
2505 // correct the language settings
2506 par_as_string = correctlanguagesetting(par_as_string, true, !opt.ignoreformat);
2507 if (opt.ignoreformat) {
2509 // if par_as_string_nolead were emty,
2510 // the following call to findAux will always *find* the string
2511 // in the checked data, and thus always using the slow
2512 // examining of the current text part.
2513 par_as_string_nolead = par_as_string;
2516 lead_size = identifyLeading(par_as_string);
2517 LYXERR(Debug::FIND, "Lead_size: " << lead_size);
2518 lead_as_string = par_as_string.substr(0, lead_size);
2519 par_as_string_nolead = par_as_string.substr(lead_size, par_as_string.size() - lead_size);
2523 open_braces = identifyClosing(par_as_string);
2524 identifyClosing(par_as_string_nolead);
2525 LYXERR(Debug::FIND, "Open braces: " << open_braces);
2526 LYXERR(Debug::FIND, "Built MatchStringAdv object: par_as_string = '" << par_as_string << "'");
2528 string lead_as_regexp;
2529 if (lead_size > 0) {
2530 // @todo No need to search for \regexp{} insets in leading material
2531 lead_as_regexp = escape_for_regex(par_as_string.substr(0, lead_size), !opt.ignoreformat);
2532 par_as_string = par_as_string_nolead;
2533 LYXERR(Debug::FIND, "lead_as_regexp is '" << lead_as_regexp << "'");
2534 LYXERR(Debug::FIND, "par_as_string now is '" << par_as_string << "'");
2536 par_as_string = escape_for_regex(par_as_string, !opt.ignoreformat);
2537 // Insert (.*?) before trailing closure of math, macros and environments, so to catch parts of them.
2538 LYXERR(Debug::FIND, "par_as_string now is '" << par_as_string << "'");
2540 // Insert .* before trailing '\$' ('$' has been escaped by escape_for_regex)
2541 regex_replace(par_as_string, par_as_string, "(.*[^\\\\])(\\\\\\$)\\'", "$1(.*?)$2")
2542 // Insert .* before trailing '\\\]' ('\]' has been escaped by escape_for_regex)
2543 || regex_replace(par_as_string, par_as_string, "(.*[^\\\\])( \\\\\\\\\\\\\\])\\'", "$1(.*?)$2")
2544 // Insert .* before trailing '\\end\{...}' ('\end{...}' has been escaped by escape_for_regex)
2545 || regex_replace(par_as_string, par_as_string,
2546 "(.*[^\\\\])( \\\\\\\\end\\\\\\{[a-zA-Z_]*)(\\\\\\*)?(\\\\\\})\\'", "$1(.*?)$2$3$4")
2547 // Insert .* before trailing '\}' ('}' has been escaped by escape_for_regex)
2548 || regex_replace(par_as_string, par_as_string, "(.*[^\\\\])(\\\\\\})\\'", "$1(.*?)$2")
2552 if (!opt.ignoreformat) {
2553 // Remove extra '\}' at end
2554 while ( regex_replace(par_as_string, par_as_string, "(.*)\\\\}$", "$1")) {
2559 regex_replace(par_as_string, par_as_string, "\\\\\\.", "_xxbdotxx_");
2560 // handle '.' -> '[^]', replace later as '[^\}\{\\]'
2561 regex_replace(par_as_string, par_as_string, "\\.", "[^]");
2562 // replace '[^...]' with '[^...\}\{\\]'
2563 regex_replace(par_as_string, par_as_string, "\\[\\^([^\\\\\\]]*)\\]", "_xxbrlxx_$1\\}\\{\\\\_xxbrrxx_");
2564 regex_replace(par_as_string, par_as_string, "_xxbrlxx_", "[^");
2565 regex_replace(par_as_string, par_as_string, "_xxbrrxx_", "]");
2567 regex_replace(par_as_string, par_as_string, "_xxbdotxx_", "\\.");
2570 LYXERR(Debug::FIND, "par_as_string now is '" << par_as_string << "'");
2571 LYXERR(Debug::FIND, "Open braces: " << open_braces);
2572 LYXERR(Debug::FIND, "Close .*? : " << close_wildcards);
2573 LYXERR(Debug::FIND, "Replaced text (to be used as regex): " << par_as_string);
2575 // If entered regexp must match at begin of searched string buffer
2576 // Kornel: Added parentheses to use $1 for size of the leading string
2580 // TODO: Adapt '\[12345678]' in par_as_string to acount for the first '()
2581 // Unfortunately is '\1', '\2', etc not working for strings with extra format
2582 // so the convert has no effect in that case
2583 for (int i = 8; i > 0; --i) {
2584 string orig = "\\\\" + std::to_string(i);
2585 string dest = "\\" + std::to_string(i+1);
2586 while (regex_replace(par_as_string, par_as_string, orig, dest));
2588 regexp_str = "(" + lead_as_regexp + ")" + par_as_string;
2589 regexp2_str = "(" + lead_as_regexp + ").*?" + par_as_string;
2591 LYXERR(Debug::FIND, "Setting regexp to : '" << regexp_str << "'");
2592 regexp = lyx::regex(regexp_str);
2594 LYXERR(Debug::FIND, "Setting regexp2 to: '" << regexp2_str << "'");
2595 regexp2 = lyx::regex(regexp2_str);
2600 // Count number of characters in string
2604 // \\[a-zA-Z]+ ==> 1
2605 static int computeSize(string s, int len)
2611 for (int i = 0; i < len; i += skip, count++) {
2614 if (isalpha(s[i+1])) {
2615 for (int j = 2; i+j < len; j++) {
2616 if (! isalpha(s[i+j])) {
2619 else if ((s[i+j] == '{') && s[i+j+1] == '}')
2621 else if ((s[i+j] == '{') && (i + j + 1 >= len))
2629 else if (s[i] == '{') {
2635 else if (s[i] == '-') {
2636 if (s[i+1] == '-') {
2652 int MatchStringAdv::findAux(DocIterator const & cur, int len, bool at_begin) const
2655 (opt.restr == FindAndReplaceOptions::R_ONLY_MATHS && !cur.inMathed()) )
2658 docstring docstr = stringifyFromForSearch(opt, cur, len);
2659 string str = normalize(docstr, true);
2660 if (!opt.ignoreformat) {
2661 str = correctlanguagesetting(str, false, !opt.ignoreformat);
2663 if (str.empty()) return(-1);
2664 LYXERR(Debug::FIND, "Matching against '" << lyx::to_utf8(docstr) << "'");
2665 LYXERR(Debug::FIND, "After normalization: '" << str << "'");
2668 LYXERR(Debug::FIND, "Searching in regexp mode: at_begin=" << at_begin);
2669 regex const *p_regexp;
2670 regex_constants::match_flag_type flags;
2672 flags = regex_constants::match_continuous;
2675 flags = regex_constants::match_default;
2676 p_regexp = ®exp2;
2678 sregex_iterator re_it(str.begin(), str.end(), *p_regexp, flags);
2679 if (re_it == sregex_iterator())
2681 match_results<string::const_iterator> const & m = *re_it;
2683 if (0) { // Kornel Benko: DO NOT CHECKK
2684 // Check braces on the segment that matched the entire regexp expression,
2685 // plus the last subexpression, if a (.*?) was inserted in the constructor.
2686 if (!braces_match(m[0].first, m[0].second, open_braces))
2690 // Check braces on segments that matched all (.*?) subexpressions,
2691 // except the last "padding" one inserted by lyx.
2692 for (size_t i = 1; i < m.size() - 1; ++i)
2693 if (!braces_match(m[i].first, m[i].second, open_braces))
2696 // Exclude from the returned match length any length
2697 // due to close wildcards added at end of regexp
2698 // and also the length of the leading (e.g. '\emph{')
2700 // Whole found string, including the leading: m[0].second - m[0].first
2701 // Size of the leading string: m[1].second - m[1].first
2702 int leadingsize = 0;
2704 leadingsize = m[1].second - m[1].first;
2706 for (size_t i = 0; i < m.size(); i++) {
2707 LYXERR(Debug::FIND, "Match " << i << " is " << m[i].second - m[i].first << " long");
2709 if (close_wildcards == 0)
2710 result = m[0].second - m[0].first;
2713 result = m[m.size() - close_wildcards].first - m[0].first;
2715 size_t pos = m.position(size_t(0));
2716 // Ignore last closing characters
2717 while (result > 0) {
2718 if (str[pos+result-1] == '}')
2723 if (result > leadingsize)
2724 result -= leadingsize;
2727 return computeSize(str.substr(pos+leadingsize,result), result);
2730 // else !use_regexp: but all code paths above return
2731 LYXERR(Debug::FIND, "Searching in normal mode: par_as_string='"
2732 << par_as_string << "', str='" << str << "'");
2733 LYXERR(Debug::FIND, "Searching in normal mode: lead_as_string='"
2734 << lead_as_string << "', par_as_string_nolead='"
2735 << par_as_string_nolead << "'");
2738 LYXERR(Debug::FIND, "size=" << par_as_string.size()
2739 << ", substr='" << str.substr(0, par_as_string.size()) << "'");
2740 if (str.substr(0, par_as_string.size()) == par_as_string)
2741 return par_as_string.size();
2743 size_t pos = str.find(par_as_string_nolead);
2744 if (pos != string::npos)
2745 return par_as_string.size();
2751 int MatchStringAdv::operator()(DocIterator const & cur, int len, bool at_begin) const
2753 int res = findAux(cur, len, at_begin);
2755 "res=" << res << ", at_begin=" << at_begin
2756 << ", matchword=" << opt.matchword
2757 << ", inTexted=" << cur.inTexted());
2758 if (res == 0 || !at_begin || !opt.matchword || !cur.inTexted())
2760 if ((len > 0) && (res < len))
2762 Paragraph const & par = cur.paragraph();
2763 bool ws_left = (cur.pos() > 0)
2764 ? par.isWordSeparator(cur.pos() - 1)
2766 bool ws_right = (cur.pos() + len < par.size())
2767 ? par.isWordSeparator(cur.pos() + len)
2770 "cur.pos()=" << cur.pos() << ", res=" << res
2771 << ", separ: " << ws_left << ", " << ws_right
2774 if (ws_left && ws_right) {
2775 // Check for word separators inside the found 'word'
2776 for (int i = 0; i < len; i++) {
2777 if (par.isWordSeparator(cur.pos() + i))
2786 string MatchStringAdv::normalize(docstring const & s, bool hack_braces) const
2789 if (! opt.casesensitive)
2790 t = lyx::to_utf8(lowercase(s));
2792 t = lyx::to_utf8(s);
2793 // Remove \n at begin
2794 while (!t.empty() && t[0] == '\n')
2797 while (!t.empty() && t[t.size() - 1] == '\n')
2798 t = t.substr(0, t.size() - 1);
2800 // Handle all other '\n'
2801 while ((pos = t.find("\n")) != string::npos) {
2802 if (pos > 1 && t[pos-1] == '\\' && t[pos-2] == '\\' ) {
2804 if (std::isalnum(t[pos+1])) {
2805 t.replace(pos-2, 3, " ");
2808 t.replace(pos-2, 3, "");
2811 else if (!std::isalnum(t[pos+1]) || !std::isalnum(t[pos-1])) {
2812 // '\n' adjacent to non-alpha-numerics, discard
2813 t.replace(pos, 1, "");
2816 // Replace all other \n with spaces
2817 t.replace(pos, 1, " ");
2820 // Remove stale empty \emph{}, \textbf{} and similar blocks from latexify
2821 // Kornel: Added textsl, textsf, textit, texttt and noun
2822 // + allow to seach for colored text too
2823 LYXERR(Debug::FIND, "Removing stale empty \\emph{}, \\textbf{}, \\*section{} macros from: " << t);
2824 while (regex_replace(t, t, "\\\\(emph|noun|text(bf|sl|sf|it|tt)|(u|uu)line|(s|x)out|uwave)(\\{(\\{\\})?\\})+", ""))
2825 LYXERR(Debug::FIND, " further removing stale empty \\emph{}, \\textbf{} macros from: " << t);
2826 while (regex_replace(t, t, "\\\\((sub)?(((sub)?section)|paragraph)|part)\\*?(\\{(\\{\\})?\\})+", ""))
2827 LYXERR(Debug::FIND, " further removing stale empty \\emph{}, \\textbf{} macros from: " << t);
2829 while (regex_replace(t, t, "\\\\(foreignlanguage|textcolor|item)\\{[a-z]+\\}(\\{(\\{\\})?\\})+", ""));
2830 // FIXME - check what preceeds the brace
2832 if (opt.ignoreformat)
2833 while (regex_replace(t, t, "\\{", "_x_<")
2834 || regex_replace(t, t, "\\}", "_x_>"))
2835 LYXERR(Debug::FIND, "After {} replacement: '" << t << "'");
2837 while (regex_replace(t, t, "\\\\\\{", "_x_<")
2838 || regex_replace(t, t, "\\\\\\}", "_x_>"))
2839 LYXERR(Debug::FIND, "After {} replacement: '" << t << "'");
2846 docstring stringifyFromCursor(DocIterator const & cur, int len)
2848 LYXERR(Debug::FIND, "Stringifying with len=" << len << " from cursor at pos: " << cur);
2849 if (cur.inTexted()) {
2850 Paragraph const & par = cur.paragraph();
2851 // TODO what about searching beyond/across paragraph breaks ?
2852 // TODO Try adding a AS_STR_INSERTS as last arg
2853 pos_type end = ( len == -1 || cur.pos() + len > int(par.size()) ) ?
2854 int(par.size()) : cur.pos() + len;
2855 OutputParams runparams(&cur.buffer()->params().encoding());
2856 runparams.nice = true;
2857 runparams.flavor = OutputParams::LATEX;
2858 runparams.linelen = 100000; //lyxrc.plaintext_linelen;
2859 // No side effect of file copying and image conversion
2860 runparams.dryrun = true;
2861 LYXERR(Debug::FIND, "Stringifying with cur: "
2862 << cur << ", from pos: " << cur.pos() << ", end: " << end);
2863 return par.asString(cur.pos(), end,
2864 AS_STR_INSETS | AS_STR_SKIPDELETE | AS_STR_PLAINTEXT,
2866 } else if (cur.inMathed()) {
2867 CursorSlice cs = cur.top();
2868 MathData md = cs.cell();
2869 MathData::const_iterator it_end =
2870 (( len == -1 || cs.pos() + len > int(md.size()))
2872 : md.begin() + cs.pos() + len );
2874 for (MathData::const_iterator it = md.begin() + cs.pos();
2877 docstring s = asString(md2);
2878 LYXERR(Debug::FIND, "Stringified math: '" << s << "'");
2881 LYXERR(Debug::FIND, "Don't know how to stringify from here: " << cur);
2886 /** Computes the LaTeX export of buf starting from cur and ending len positions
2887 * after cur, if len is positive, or at the paragraph or innermost inset end
2890 docstring latexifyFromCursor(DocIterator const & cur, int len)
2892 LYXERR(Debug::FIND, "Latexifying with len=" << len << " from cursor at pos: " << cur);
2893 LYXERR(Debug::FIND, " with cur.lastpost=" << cur.lastpos() << ", cur.lastrow="
2894 << cur.lastrow() << ", cur.lastcol=" << cur.lastcol());
2895 Buffer const & buf = *cur.buffer();
2897 odocstringstream ods;
2899 OutputParams runparams(&buf.params().encoding());
2900 runparams.nice = false;
2901 runparams.flavor = OutputParams::LATEX;
2902 runparams.linelen = 8000; //lyxrc.plaintext_linelen;
2903 // No side effect of file copying and image conversion
2904 runparams.dryrun = true;
2905 runparams.for_search = true;
2907 if (cur.inTexted()) {
2908 // @TODO what about searching beyond/across paragraph breaks ?
2909 pos_type endpos = cur.paragraph().size();
2910 if (len != -1 && endpos > cur.pos() + len)
2911 endpos = cur.pos() + len;
2912 TeXOnePar(buf, *cur.innerText(), cur.pit(), os, runparams,
2913 string(), cur.pos(), endpos);
2914 string s = lyx::to_utf8(ods.str());
2915 LYXERR(Debug::FIND, "Latexified +modified text: '" << s << "'");
2916 return(lyx::from_utf8(s));
2917 } else if (cur.inMathed()) {
2918 // Retrieve the math environment type, and add '$' or '$[' or others (\begin{equation}) accordingly
2919 for (int s = cur.depth() - 1; s >= 0; --s) {
2920 CursorSlice const & cs = cur[s];
2921 if (cs.asInsetMath() && cs.asInsetMath()->asHullInset()) {
2923 cs.asInsetMath()->asHullInset()->header_write(ws);
2928 CursorSlice const & cs = cur.top();
2929 MathData md = cs.cell();
2930 MathData::const_iterator it_end =
2931 ((len == -1 || cs.pos() + len > int(md.size()))
2933 : md.begin() + cs.pos() + len);
2935 for (MathData::const_iterator it = md.begin() + cs.pos();
2939 ods << asString(md2);
2940 // Retrieve the math environment type, and add '$' or '$]'
2941 // or others (\end{equation}) accordingly
2942 for (int s = cur.depth() - 1; s >= 0; --s) {
2943 CursorSlice const & cs2 = cur[s];
2944 InsetMath * inset = cs2.asInsetMath();
2945 if (inset && inset->asHullInset()) {
2947 inset->asHullInset()->footer_write(ws);
2951 LYXERR(Debug::FIND, "Latexified math: '" << lyx::to_utf8(ods.str()) << "'");
2953 LYXERR(Debug::FIND, "Don't know how to stringify from here: " << cur);
2959 /** Finalize an advanced find operation, advancing the cursor to the innermost
2960 ** position that matches, plus computing the length of the matching text to
2963 int findAdvFinalize(DocIterator & cur, MatchStringAdv const & match)
2965 // Search the foremost position that matches (avoids find of entire math
2966 // inset when match at start of it)
2968 DocIterator old_cur(cur.buffer());
2970 LYXERR(Debug::FIND, "Forwarding one step (searching for innermost match)");
2974 } while (cur && cur.depth() > d && match(cur) > 0);
2976 int max_match = match(cur); /* match valid only if not searching whole words */
2977 if (max_match <= 0) return 0;
2978 LYXERR(Debug::FIND, "Ok");
2980 // Compute the match length
2982 if (cur.pos() + len > cur.lastpos())
2984 if (match.opt.matchword) {
2985 LYXERR(Debug::FIND, "verifying unmatch with len = " << len);
2986 while (cur.pos() + len <= cur.lastpos() && match(cur, len) <= 0) {
2988 LYXERR(Debug::FIND, "verifying unmatch with len = " << len);
2990 // Length of matched text (different from len param)
2991 int old_match = match(cur, len);
2995 // Greedy behaviour while matching regexps
2996 while ((new_match = match(cur, len + 1)) > old_match) {
2998 old_match = new_match;
2999 LYXERR(Debug::FIND, "verifying match with len = " << len);
3006 int maxl = cur.lastpos() - cur.pos();
3007 // Greedy behaviour while matching regexps
3008 while (maxl > minl) {
3009 int actual_match = match(cur, len);
3010 if (actual_match >= max_match) {
3011 // actual_match > max_match _can_ happen,
3012 // if the search area splits
3013 // some following word so that the regex
3014 // (e.g. 'r.*r\b' matches 'r' from the middle of the
3016 // This means, the len value is too big
3018 len = (int)((maxl + minl)/2);
3021 // (actual_match < max_match)
3023 len = (int)((maxl + minl)/2);
3027 // Search for real start of matched characters
3032 } while (cur.depth() > old_cur.depth()); /* Skip inner insets */
3033 if (cur.depth() < old_cur.depth()) {
3035 LYXERR0("cur.depth() < old_cur.depth(), this should never happen");
3038 if (cur.pos() != old_cur.pos()) {
3039 // OK, forwarded 1 pos in actual inset
3040 actual_match = match(cur, len-1);
3041 if (actual_match == max_match) {
3042 // Ha, got it! The shorter selection has the same match length
3047 // OK, the shorter selection matches less chars, revert to previous value
3053 LYXERR0("cur.pos() == old_cur.pos(), this should never happen");
3054 actual_match = match(cur, len);
3055 if (actual_match == max_match)
3065 int findForwardAdv(DocIterator & cur, MatchStringAdv & match)
3069 while (!theApp()->longOperationCancelled() && cur) {
3070 LYXERR(Debug::FIND, "findForwardAdv() cur: " << cur);
3071 int match_len = match(cur, -1, false);
3072 LYXERR(Debug::FIND, "match_len: " << match_len);
3073 if (match_len > 0) {
3074 int match_len_zero_count = 0;
3075 for (; !theApp()->longOperationCancelled() && cur; cur.forwardPos()) {
3076 LYXERR(Debug::FIND, "Advancing cur: " << cur);
3077 int match_len3 = match(cur, 1);
3080 int match_len2 = match(cur);
3081 LYXERR(Debug::FIND, "match_len2: " << match_len2);
3082 if (match_len2 > 0) {
3083 // Sometimes in finalize we understand it wasn't a match
3084 // and we need to continue the outest loop
3085 int len = findAdvFinalize(cur, match);
3090 if (match_len2 >= 0) {
3091 if (match_len2 == 0)
3092 match_len_zero_count++;
3094 match_len_zero_count = 0;
3097 if (++match_len_zero_count > 3) {
3098 LYXERR(Debug::FIND, "match_len2_zero_count: " << match_len_zero_count << ", match_len was " << match_len);
3099 match_len_zero_count = 0;
3107 if (match_len >= 0 && cur.pit() < cur.lastpit()) {
3108 LYXERR(Debug::FIND, "Advancing par: cur=" << cur);
3111 // This should exit nested insets, if any, or otherwise undefine the currsor.
3112 cur.pos() = cur.lastpos();
3113 LYXERR(Debug::FIND, "Advancing pos: cur=" << cur);
3121 /// Find the most backward consecutive match within same paragraph while searching backwards.
3122 int findMostBackwards(DocIterator & cur, MatchStringAdv const & match)
3124 DocIterator cur_begin = doc_iterator_begin(cur.buffer());
3125 DocIterator tmp_cur = cur;
3126 int len = findAdvFinalize(tmp_cur, match);
3127 Inset & inset = cur.inset();
3128 for (; cur != cur_begin; cur.backwardPos()) {
3129 LYXERR(Debug::FIND, "findMostBackwards(): cur=" << cur);
3130 DocIterator new_cur = cur;
3131 new_cur.backwardPos();
3132 if (new_cur == cur || &new_cur.inset() != &inset || !match(new_cur))
3134 int new_len = findAdvFinalize(new_cur, match);
3139 LYXERR(Debug::FIND, "findMostBackwards(): exiting with cur=" << cur);
3145 int findBackwardsAdv(DocIterator & cur, MatchStringAdv & match)
3149 // Backup of original position
3150 DocIterator cur_begin = doc_iterator_begin(cur.buffer());
3151 if (cur == cur_begin)
3154 DocIterator cur_orig(cur);
3155 bool pit_changed = false;
3158 bool found_match = match(cur, -1, false);
3162 cur.pos() = cur.lastpos();
3164 cur.pos() = cur_orig.pos();
3165 LYXERR(Debug::FIND, "findBackAdv2: cur: " << cur);
3166 DocIterator cur_prev_iter;
3168 found_match = match(cur);
3169 LYXERR(Debug::FIND, "findBackAdv3: found_match="
3170 << found_match << ", cur: " << cur);
3172 return findMostBackwards(cur, match);
3174 // Stop if begin of document reached
3175 if (cur == cur_begin)
3177 cur_prev_iter = cur;
3181 if (cur == cur_begin)
3188 } while (!theApp()->longOperationCancelled());
3196 docstring stringifyFromForSearch(FindAndReplaceOptions const & opt,
3197 DocIterator const & cur, int len)
3199 if (cur.pos() < 0 || cur.pos() > cur.lastpos())
3201 if (!opt.ignoreformat)
3202 return latexifyFromCursor(cur, len);
3204 return stringifyFromCursor(cur, len);
3208 FindAndReplaceOptions::FindAndReplaceOptions(
3209 docstring const & find_buf_name, bool casesensitive,
3210 bool matchword, bool forward, bool expandmacros, bool ignoreformat,
3211 docstring const & repl_buf_name, bool keep_case,
3212 SearchScope scope, SearchRestriction restr)
3213 : find_buf_name(find_buf_name), casesensitive(casesensitive), matchword(matchword),
3214 forward(forward), expandmacros(expandmacros), ignoreformat(ignoreformat),
3215 repl_buf_name(repl_buf_name), keep_case(keep_case), scope(scope), restr(restr)
3223 /** Check if 'len' letters following cursor are all non-lowercase */
3224 static bool allNonLowercase(Cursor const & cur, int len)
3226 pos_type beg_pos = cur.selectionBegin().pos();
3227 pos_type end_pos = cur.selectionBegin().pos() + len;
3228 if (len > cur.lastpos() + 1 - beg_pos) {
3229 LYXERR(Debug::FIND, "This should not happen, more debug needed");
3230 len = cur.lastpos() + 1 - beg_pos;
3231 end_pos = beg_pos + len;
3233 for (pos_type pos = beg_pos; pos != end_pos; ++pos)
3234 if (isLowerCase(cur.paragraph().getChar(pos)))
3240 /** Check if first letter is upper case and second one is lower case */
3241 static bool firstUppercase(Cursor const & cur)
3244 pos_type pos = cur.selectionBegin().pos();
3245 if (pos >= cur.lastpos() - 1) {
3246 LYXERR(Debug::FIND, "No upper-case at cur: " << cur);
3249 ch1 = cur.paragraph().getChar(pos);
3250 ch2 = cur.paragraph().getChar(pos + 1);
3251 bool result = isUpperCase(ch1) && isLowerCase(ch2);
3252 LYXERR(Debug::FIND, "firstUppercase(): "
3253 << "ch1=" << ch1 << "(" << char(ch1) << "), ch2="
3254 << ch2 << "(" << char(ch2) << ")"
3255 << ", result=" << result << ", cur=" << cur);
3260 /** Make first letter of supplied buffer upper-case, and the rest lower-case.
3262 ** \fixme What to do with possible further paragraphs in replace buffer ?
3264 static void changeFirstCase(Buffer & buffer, TextCase first_case, TextCase others_case)
3266 ParagraphList::iterator pit = buffer.paragraphs().begin();
3267 LASSERT(pit->size() >= 1, /**/);
3268 pos_type right = pos_type(1);
3269 pit->changeCase(buffer.params(), pos_type(0), right, first_case);
3270 right = pit->size();
3271 pit->changeCase(buffer.params(), pos_type(1), right, others_case);
3277 static void findAdvReplace(BufferView * bv, FindAndReplaceOptions const & opt, MatchStringAdv & matchAdv)
3279 Cursor & cur = bv->cursor();
3280 if (opt.repl_buf_name == docstring()
3281 || theBufferList().getBuffer(FileName(to_utf8(opt.repl_buf_name)), true) == 0
3282 || theBufferList().getBuffer(FileName(to_utf8(opt.find_buf_name)), true) == 0)
3285 DocIterator sel_beg = cur.selectionBegin();
3286 DocIterator sel_end = cur.selectionEnd();
3287 if (&sel_beg.inset() != &sel_end.inset()
3288 || sel_beg.pit() != sel_end.pit()
3289 || sel_beg.idx() != sel_end.idx())
3291 int sel_len = sel_end.pos() - sel_beg.pos();
3292 LYXERR(Debug::FIND, "sel_beg: " << sel_beg << ", sel_end: " << sel_end
3293 << ", sel_len: " << sel_len << endl);
3296 LASSERT(sel_len > 0, return);
3298 if (!matchAdv(sel_beg, sel_len))
3301 // Build a copy of the replace buffer, adapted to the KeepCase option
3302 Buffer & repl_buffer_orig = *theBufferList().getBuffer(FileName(to_utf8(opt.repl_buf_name)), true);
3304 repl_buffer_orig.write(oss);
3305 string lyx = oss.str();
3306 Buffer repl_buffer("", false);
3307 repl_buffer.setUnnamed(true);
3308 LASSERT(repl_buffer.readString(lyx), return);
3309 if (opt.keep_case && sel_len >= 2) {
3310 LYXERR(Debug::FIND, "keep_case true: cur.pos()=" << cur.pos() << ", sel_len=" << sel_len);
3311 if (cur.inTexted()) {
3312 if (firstUppercase(cur))
3313 changeFirstCase(repl_buffer, text_uppercase, text_lowercase);
3314 else if (allNonLowercase(cur, sel_len))
3315 changeFirstCase(repl_buffer, text_uppercase, text_uppercase);
3318 cap::cutSelection(cur, false);
3319 if (cur.inTexted()) {
3320 repl_buffer.changeLanguage(
3321 repl_buffer.language(),
3322 cur.getFont().language());
3323 LYXERR(Debug::FIND, "Replacing by pasteParagraphList()ing repl_buffer");
3324 LYXERR(Debug::FIND, "Before pasteParagraphList() cur=" << cur << endl);
3325 cap::pasteParagraphList(cur, repl_buffer.paragraphs(),
3326 repl_buffer.params().documentClassPtr(),
3327 bv->buffer().errorList("Paste"));
3328 LYXERR(Debug::FIND, "After pasteParagraphList() cur=" << cur << endl);
3329 sel_len = repl_buffer.paragraphs().begin()->size();
3330 } else if (cur.inMathed()) {
3331 odocstringstream ods;
3333 OutputParams runparams(&repl_buffer.params().encoding());
3334 runparams.nice = false;
3335 runparams.flavor = OutputParams::LATEX;
3336 runparams.linelen = 8000; //lyxrc.plaintext_linelen;
3337 runparams.dryrun = true;
3338 TeXOnePar(repl_buffer, repl_buffer.text(), 0, os, runparams);
3339 //repl_buffer.getSourceCode(ods, 0, repl_buffer.paragraphs().size(), false);
3340 docstring repl_latex = ods.str();
3341 LYXERR(Debug::FIND, "Latexified replace_buffer: '" << repl_latex << "'");
3343 (void)regex_replace(to_utf8(repl_latex), s, "\\$(.*)\\$", "$1");
3344 (void)regex_replace(s, s, "\\\\\\[(.*)\\\\\\]", "$1");
3345 repl_latex = from_utf8(s);
3346 LYXERR(Debug::FIND, "Replacing by insert()ing latex: '" << repl_latex << "' cur=" << cur << " with depth=" << cur.depth());
3347 MathData ar(cur.buffer());
3348 asArray(repl_latex, ar, Parse::NORMAL);
3350 sel_len = ar.size();
3351 LYXERR(Debug::FIND, "After insert() cur=" << cur << " with depth: " << cur.depth() << " and len: " << sel_len);
3353 if (cur.pos() >= sel_len)
3354 cur.pos() -= sel_len;
3357 LYXERR(Debug::FIND, "After pos adj cur=" << cur << " with depth: " << cur.depth() << " and len: " << sel_len);
3358 bv->putSelectionAt(DocIterator(cur), sel_len, !opt.forward);
3359 bv->processUpdateFlags(Update::Force);
3363 /// Perform a FindAdv operation.
3364 bool findAdv(BufferView * bv, FindAndReplaceOptions const & opt)
3369 // e.g., when invoking word-findadv from mini-buffer wither with
3370 // wrong options syntax or before ever opening advanced F&R pane
3371 if (theBufferList().getBuffer(FileName(to_utf8(opt.find_buf_name)), true) == 0)
3375 MatchStringAdv matchAdv(bv->buffer(), opt);
3376 int length = bv->cursor().selectionEnd().pos() - bv->cursor().selectionBegin().pos();
3378 bv->putSelectionAt(bv->cursor().selectionBegin(), length, !opt.forward);
3379 findAdvReplace(bv, opt, matchAdv);
3382 match_len = findForwardAdv(cur, matchAdv);
3384 match_len = findBackwardsAdv(cur, matchAdv);
3386 // This may only be raised by lyx::regex()
3387 bv->message(_("Invalid regular expression!"));
3391 if (match_len == 0) {
3392 bv->message(_("Match not found!"));
3396 bv->message(_("Match found!"));
3398 LYXERR(Debug::FIND, "Putting selection at cur=" << cur << " with len: " << match_len);
3399 bv->putSelectionAt(cur, match_len, !opt.forward);
3405 ostringstream & operator<<(ostringstream & os, FindAndReplaceOptions const & opt)
3407 os << to_utf8(opt.find_buf_name) << "\nEOSS\n"
3408 << opt.casesensitive << ' '
3409 << opt.matchword << ' '
3410 << opt.forward << ' '
3411 << opt.expandmacros << ' '
3412 << opt.ignoreformat << ' '
3413 << to_utf8(opt.repl_buf_name) << "\nEOSS\n"
3414 << opt.keep_case << ' '
3415 << int(opt.scope) << ' '
3418 LYXERR(Debug::FIND, "built: " << os.str());
3424 istringstream & operator>>(istringstream & is, FindAndReplaceOptions & opt)
3426 LYXERR(Debug::FIND, "parsing");
3430 while (line != "EOSS") {
3434 if (is.eof()) // Tolerate malformed request
3438 LYXERR(Debug::FIND, "file_buf_name: '" << s << "'");
3439 opt.find_buf_name = from_utf8(s);
3440 is >> opt.casesensitive >> opt.matchword >> opt.forward >> opt.expandmacros >> opt.ignoreformat;
3441 is.get(); // Waste space before replace string
3444 while (line != "EOSS") {
3448 if (is.eof()) // Tolerate malformed request
3452 LYXERR(Debug::FIND, "repl_buf_name: '" << s << "'");
3453 opt.repl_buf_name = from_utf8(s);
3454 is >> opt.keep_case;
3457 opt.scope = FindAndReplaceOptions::SearchScope(i);
3459 opt.restr = FindAndReplaceOptions::SearchRestriction(i);
3461 LYXERR(Debug::FIND, "parsed: " << opt.casesensitive << ' ' << opt.matchword << ' ' << opt.forward << ' '
3462 << opt.expandmacros << ' ' << opt.ignoreformat << ' ' << opt.keep_case << ' '
3463 << opt.scope << ' ' << opt.restr);