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"
37 #include "frontends/Application.h"
38 #include "frontends/alert.h"
40 #include "mathed/InsetMath.h"
41 #include "mathed/InsetMathGrid.h"
42 #include "mathed/InsetMathHull.h"
43 #include "mathed/MathData.h"
44 #include "mathed/MathStream.h"
45 #include "mathed/MathSupport.h"
47 #include "support/convert.h"
48 #include "support/debug.h"
49 #include "support/docstream.h"
50 #include "support/FileName.h"
51 #include "support/gettext.h"
52 #include "support/lassert.h"
53 #include "support/lstrings.h"
55 #include "support/regex.h"
56 #include "support/textutils.h"
60 using namespace lyx::support;
65 // Helper class for deciding what should be ignored
70 : ignoreFamily_(false), ignoreSeries_(false),
71 ignoreShape_(false), ignoreUnderline_(false),
72 ignoreMarkUp_(false), ignoreStrikeOut_(false),
73 ignoreSectioning_(false), ignoreFrontMatter_(false),
74 ignoreColor_(false), ignoreLanguage_(false) {}
76 bool getFamily() { return ignoreFamily_; };
78 bool getSeries() { return ignoreSeries_; };
80 bool getShape() { return ignoreShape_; };
82 bool getUnderline() { return ignoreUnderline_; };
84 bool getMarkUp() { return ignoreMarkUp_; };
86 bool getStrikeOut() { return ignoreStrikeOut_; };
88 bool getSectioning() { return ignoreSectioning_; };
90 bool getFrontMatter() { return ignoreFrontMatter_; };
92 bool getColor() { return ignoreColor_; };
94 bool getLanguage() { return ignoreLanguage_; };
96 void setIgnoreFormat(string type, bool value);
106 bool ignoreUnderline_;
110 bool ignoreStrikeOut_;
112 bool ignoreSectioning_;
114 bool ignoreFrontMatter_;
118 bool ignoreLanguage_;
122 void IgnoreFormats::setIgnoreFormat(string type, bool value)
124 if (type == "color") {
125 ignoreColor_ = value;
127 else if (type == "language") {
128 ignoreLanguage_ = value;
130 else if (type == "sectioning") {
131 ignoreSectioning_ = value;
132 ignoreFrontMatter_ = value;
134 else if (type == "font") {
135 ignoreSeries_ = value;
136 ignoreShape_ = value;
137 ignoreFamily_ = value;
139 else if (type == "series") {
140 ignoreSeries_ = value;
142 else if (type == "shape") {
143 ignoreShape_ = value;
145 else if (type == "family") {
146 ignoreFamily_ = value;
148 else if (type == "markup") {
149 ignoreMarkUp_ = value;
151 else if (type == "underline") {
152 ignoreUnderline_ = value;
154 else if (type == "strike") {
155 ignoreStrikeOut_ = value;
159 // The global variable that can be changed from outside
160 IgnoreFormats ignoreFormats;
163 void setIgnoreFormat(string type, bool value)
165 ignoreFormats.setIgnoreFormat(type, value);
171 bool parse_bool(docstring & howto)
176 howto = split(howto, var, ' ');
181 class MatchString : public binary_function<Paragraph, pos_type, int>
184 MatchString(docstring const & str, bool cs, bool mw)
185 : str(str), case_sens(cs), whole_words(mw)
188 // returns true if the specified string is at the specified position
189 // del specifies whether deleted strings in ct mode will be considered
190 int operator()(Paragraph const & par, pos_type pos, bool del = true) const
192 return par.find(str, case_sens, whole_words, pos, del);
200 // match whole words only
205 int findForward(DocIterator & cur, MatchString const & match,
206 bool find_del = true)
208 for (; cur; cur.forwardChar())
209 if (cur.inTexted()) {
210 int len = match(cur.paragraph(), cur.pos(), find_del);
218 int findBackwards(DocIterator & cur, MatchString const & match,
219 bool find_del = true)
223 if (cur.inTexted()) {
224 int len = match(cur.paragraph(), cur.pos(), find_del);
233 bool searchAllowed(docstring const & str)
236 frontend::Alert::error(_("Search error"), _("Search string is empty"));
243 bool findOne(BufferView * bv, docstring const & searchstr,
244 bool case_sens, bool whole, bool forward,
245 bool find_del = true, bool check_wrap = false)
247 if (!searchAllowed(searchstr))
250 DocIterator cur = forward
251 ? bv->cursor().selectionEnd()
252 : bv->cursor().selectionBegin();
254 MatchString const match(searchstr, case_sens, whole);
256 int match_len = forward
257 ? findForward(cur, match, find_del)
258 : findBackwards(cur, match, find_del);
261 bv->putSelectionAt(cur, match_len, !forward);
262 else if (check_wrap) {
263 DocIterator cur_orig(bv->cursor());
266 q = _("End of file reached while searching forward.\n"
267 "Continue searching from the beginning?");
269 q = _("Beginning of file reached while searching backward.\n"
270 "Continue searching from the end?");
271 int wrap_answer = frontend::Alert::prompt(_("Wrap search?"),
272 q, 0, 1, _("&Yes"), _("&No"));
273 if (wrap_answer == 0) {
275 bv->cursor().clear();
276 bv->cursor().push_back(CursorSlice(bv->buffer().inset()));
278 bv->cursor().setCursor(doc_iterator_end(&bv->buffer()));
279 bv->cursor().backwardPos();
281 bv->clearSelection();
282 if (findOne(bv, searchstr, case_sens, whole, forward, find_del, false))
285 bv->cursor().setCursor(cur_orig);
289 return match_len > 0;
293 int replaceAll(BufferView * bv,
294 docstring const & searchstr, docstring const & replacestr,
295 bool case_sens, bool whole)
297 Buffer & buf = bv->buffer();
299 if (!searchAllowed(searchstr) || buf.isReadonly())
302 DocIterator cur_orig(bv->cursor());
304 MatchString const match(searchstr, case_sens, whole);
307 int const rsize = replacestr.size();
308 int const ssize = searchstr.size();
311 cur.setCursor(doc_iterator_begin(&buf));
312 int match_len = findForward(cur, match, false);
313 while (match_len > 0) {
314 // Backup current cursor position and font.
315 pos_type const pos = cur.pos();
316 Font const font = cur.paragraph().getFontSettings(buf.params(), pos);
318 int striked = ssize -
319 cur.paragraph().eraseChars(pos, pos + match_len,
320 buf.params().track_changes);
321 cur.paragraph().insert(pos, replacestr, font,
322 Change(buf.params().track_changes
324 : Change::UNCHANGED));
325 for (int i = 0; i < rsize + striked; ++i)
328 match_len = findForward(cur, match, false);
331 bv->putSelectionAt(doc_iterator_begin(&buf), 0, false);
333 cur_orig.fixIfBroken();
334 bv->setCursor(cur_orig);
340 // the idea here is that we are going to replace the string that
341 // is selected IF it is the search string.
342 // if there is a selection, but it is not the search string, then
343 // we basically ignore it. (FIXME We ought to replace only within
345 // if there is no selection, then:
346 // (i) if some search string has been provided, then we find it.
347 // (think of how the dialog works when you hit "replace" the
349 // (ii) if no search string has been provided, then we treat the
350 // word the cursor is in as the search string. (why? i have no
351 // idea.) but this only works in text?
353 // returns the number of replacements made (one, if any) and
354 // whether anything at all was done.
355 pair<bool, int> replaceOne(BufferView * bv, docstring searchstr,
356 docstring const & replacestr, bool case_sens,
357 bool whole, bool forward, bool findnext)
359 Cursor & cur = bv->cursor();
361 if (!cur.selection()) {
362 // no selection, non-empty search string: find it
363 if (!searchstr.empty()) {
364 found = findOne(bv, searchstr, case_sens, whole, forward, true, findnext);
365 return make_pair(found, 0);
367 // empty search string
370 return make_pair(false, 0);
371 // select current word and treat it as the search string.
372 // This causes a minor bug as undo will restore this selection,
373 // which the user did not create (#8986).
374 cur.innerText()->selectWord(cur, WHOLE_WORD);
375 searchstr = cur.selectionAsString(false);
378 // if we still don't have a search string, report the error
380 if (!searchAllowed(searchstr))
381 return make_pair(false, 0);
383 bool have_selection = cur.selection();
384 docstring const selected = cur.selectionAsString(false);
387 ? searchstr == selected
388 : compare_no_case(searchstr, selected) == 0;
390 // no selection or current selection is not search word:
391 // just find the search word
392 if (!have_selection || !match) {
393 found = findOne(bv, searchstr, case_sens, whole, forward, true, findnext);
394 return make_pair(found, 0);
397 // we're now actually ready to replace. if the buffer is
398 // read-only, we can't, though.
399 if (bv->buffer().isReadonly())
400 return make_pair(false, 0);
402 cap::replaceSelectionWithString(cur, replacestr);
404 cur.pos() += replacestr.length();
405 LASSERT(cur.pos() <= cur.lastpos(),
406 cur.pos() = cur.lastpos());
409 findOne(bv, searchstr, case_sens, whole, forward, false, findnext);
411 return make_pair(true, 1);
417 docstring const find2string(docstring const & search,
418 bool casesensitive, bool matchword, bool forward)
422 << int(casesensitive) << ' '
423 << int(matchword) << ' '
429 docstring const replace2string(docstring const & replace,
430 docstring const & search,
431 bool casesensitive, bool matchword,
432 bool all, bool forward, bool findnext)
435 ss << replace << '\n'
437 << int(casesensitive) << ' '
438 << int(matchword) << ' '
440 << int(forward) << ' '
446 bool lyxfind(BufferView * bv, FuncRequest const & ev)
448 if (!bv || ev.action() != LFUN_WORD_FIND)
451 //lyxerr << "find called, cmd: " << ev << endl;
453 // data is of the form
455 // <casesensitive> <matchword> <forward>"
457 docstring howto = split(ev.argument(), search, '\n');
459 bool casesensitive = parse_bool(howto);
460 bool matchword = parse_bool(howto);
461 bool forward = parse_bool(howto);
463 return findOne(bv, search, casesensitive, matchword, forward, true, true);
467 bool lyxreplace(BufferView * bv,
468 FuncRequest const & ev, bool has_deleted)
470 if (!bv || ev.action() != LFUN_WORD_REPLACE)
473 // data is of the form
476 // <casesensitive> <matchword> <all> <forward> <findnext>"
479 docstring howto = split(ev.argument(), rplc, '\n');
480 howto = split(howto, search, '\n');
482 bool casesensitive = parse_bool(howto);
483 bool matchword = parse_bool(howto);
484 bool all = parse_bool(howto);
485 bool forward = parse_bool(howto);
486 bool findnext = howto.empty() ? true : parse_bool(howto);
491 int replace_count = 0;
493 replace_count = replaceAll(bv, search, rplc, casesensitive, matchword);
494 update = replace_count > 0;
497 replaceOne(bv, search, rplc, casesensitive, matchword, forward, findnext);
499 replace_count = rv.second;
502 Buffer const & buf = bv->buffer();
504 // emit message signal.
505 buf.message(_("String not found."));
507 if (replace_count == 0) {
508 buf.message(_("String found."));
509 } else if (replace_count == 1) {
510 buf.message(_("String has been replaced."));
512 docstring const str =
513 bformat(_("%1$d strings have been replaced."), replace_count);
517 } else if (findnext) {
518 // if we have deleted characters, we do not replace at all, but
519 // rather search for the next occurence
520 if (findOne(bv, search, casesensitive, matchword, forward, true, findnext))
523 bv->message(_("String not found."));
529 bool findNextChange(BufferView * bv, Cursor & cur, bool const check_wrap)
531 for (; cur; cur.forwardPos())
532 if (cur.inTexted() && cur.paragraph().isChanged(cur.pos()))
536 DocIterator cur_orig(bv->cursor());
537 docstring q = _("End of file reached while searching forward.\n"
538 "Continue searching from the beginning?");
539 int wrap_answer = frontend::Alert::prompt(_("Wrap search?"),
540 q, 0, 1, _("&Yes"), _("&No"));
541 if (wrap_answer == 0) {
542 bv->cursor().clear();
543 bv->cursor().push_back(CursorSlice(bv->buffer().inset()));
544 bv->clearSelection();
545 cur.setCursor(bv->cursor().selectionBegin());
546 if (findNextChange(bv, cur, false))
549 bv->cursor().setCursor(cur_orig);
556 bool findPreviousChange(BufferView * bv, Cursor & cur, bool const check_wrap)
558 for (cur.backwardPos(); cur; cur.backwardPos()) {
559 if (cur.inTexted() && cur.paragraph().isChanged(cur.pos()))
564 DocIterator cur_orig(bv->cursor());
565 docstring q = _("Beginning of file reached while searching backward.\n"
566 "Continue searching from the end?");
567 int wrap_answer = frontend::Alert::prompt(_("Wrap search?"),
568 q, 0, 1, _("&Yes"), _("&No"));
569 if (wrap_answer == 0) {
570 bv->cursor().setCursor(doc_iterator_end(&bv->buffer()));
571 bv->cursor().backwardPos();
572 bv->clearSelection();
573 cur.setCursor(bv->cursor().selectionBegin());
574 if (findPreviousChange(bv, cur, false))
577 bv->cursor().setCursor(cur_orig);
584 bool selectChange(Cursor & cur, bool forward)
586 if (!cur.inTexted() || !cur.paragraph().isChanged(cur.pos()))
588 Change ch = cur.paragraph().lookupChange(cur.pos());
590 CursorSlice tip1 = cur.top();
591 for (; tip1.pit() < tip1.lastpit() || tip1.pos() < tip1.lastpos(); tip1.forwardPos()) {
592 Change ch2 = tip1.paragraph().lookupChange(tip1.pos());
593 if (!ch2.isSimilarTo(ch))
596 CursorSlice tip2 = cur.top();
597 for (; tip2.pit() > 0 || tip2.pos() > 0;) {
599 Change ch2 = tip2.paragraph().lookupChange(tip2.pos());
600 if (!ch2.isSimilarTo(ch)) {
601 // take a step forward to correctly set the selection
609 cur.bv().mouseSetCursor(cur, false);
611 cur.bv().mouseSetCursor(cur, true);
619 bool findChange(BufferView * bv, bool forward)
622 cur.setCursor(forward ? bv->cursor().selectionEnd()
623 : bv->cursor().selectionBegin());
624 forward ? findNextChange(bv, cur, true) : findPreviousChange(bv, cur, true);
625 return selectChange(cur, forward);
630 bool findNextChange(BufferView * bv)
632 return findChange(bv, true);
636 bool findPreviousChange(BufferView * bv)
638 return findChange(bv, false);
645 typedef vector<pair<string, string> > Escapes;
647 /// A map of symbols and their escaped equivalent needed within a regex.
648 /// @note Beware of order
649 Escapes const & get_regexp_escapes()
651 typedef std::pair<std::string, std::string> P;
653 static Escapes escape_map;
654 if (escape_map.empty()) {
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("*", "_x_*"));
664 escape_map.push_back(P(".", "_x_."));
665 escape_map.push_back(P("\\", "(?:\\\\|\\\\backslash)"));
666 escape_map.push_back(P("~", "(?:\\\\textasciitilde|\\\\sim)"));
667 escape_map.push_back(P("^", "(?:\\^|\\\\textasciicircum\\{\\}|\\\\textasciicircum|\\\\mathcircumflex)"));
668 escape_map.push_back(P("_x_", "\\"));
673 /// A map of lyx escaped strings and their unescaped equivalent.
674 Escapes const & get_lyx_unescapes()
676 typedef std::pair<std::string, std::string> P;
678 static Escapes escape_map;
679 if (escape_map.empty()) {
680 escape_map.push_back(P("\\%", "%"));
681 escape_map.push_back(P("\\mathcircumflex ", "^"));
682 escape_map.push_back(P("\\mathcircumflex", "^"));
683 escape_map.push_back(P("\\backslash ", "\\"));
684 escape_map.push_back(P("\\backslash", "\\"));
685 escape_map.push_back(P("\\\\{", "_x_<"));
686 escape_map.push_back(P("\\\\}", "_x_>"));
687 escape_map.push_back(P("\\sim ", "~"));
688 escape_map.push_back(P("\\sim", "~"));
693 /// A map of escapes turning a regexp matching text to one matching latex.
694 Escapes const & get_regexp_latex_escapes()
696 typedef std::pair<std::string, std::string> P;
698 static Escapes escape_map;
699 if (escape_map.empty()) {
700 escape_map.push_back(P("\\\\", "(?:\\\\\\\\|\\\\backslash|\\\\textbackslash\\{\\}|\\\\textbackslash)"));
701 escape_map.push_back(P("(<?!\\\\\\\\textbackslash)\\{", "\\\\\\{"));
702 escape_map.push_back(P("(<?!\\\\\\\\textbackslash\\\\\\{)\\}", "\\\\\\}"));
703 escape_map.push_back(P("\\[", "\\{\\[\\}"));
704 escape_map.push_back(P("\\]", "\\{\\]\\}"));
705 escape_map.push_back(P("\\^", "(?:\\^|\\\\textasciicircum\\{\\}|\\\\textasciicircum|\\\\mathcircumflex)"));
706 escape_map.push_back(P("%", "\\\\\\%"));
707 escape_map.push_back(P("#", "\\\\#"));
712 /** @todo Probably the maps need to be migrated to regexps, in order to distinguish if
713 ** the found occurrence were escaped.
715 string apply_escapes(string s, Escapes const & escape_map)
717 LYXERR(Debug::FIND, "Escaping: '" << s << "'");
718 Escapes::const_iterator it;
719 for (it = escape_map.begin(); it != escape_map.end(); ++it) {
720 // LYXERR(Debug::FIND, "Escaping " << it->first << " as " << it->second);
721 unsigned int pos = 0;
722 while (pos < s.length() && (pos = s.find(it->first, pos)) < s.length()) {
723 s.replace(pos, it->first.length(), it->second);
724 LYXERR(Debug::FIND, "After escape: " << s);
725 pos += it->second.length();
726 // LYXERR(Debug::FIND, "pos: " << pos);
729 LYXERR(Debug::FIND, "Escaped : '" << s << "'");
734 /// Within \regexp{} apply get_lyx_unescapes() only (i.e., preserve regexp semantics of the string),
735 /// while outside apply get_lyx_unescapes()+get_regexp_escapes().
736 /// If match_latex is true, then apply regexp_latex_escapes() to \regexp{} contents as well.
737 string escape_for_regex(string s, bool match_latex)
740 while (pos < s.size()) {
741 size_t new_pos = s.find("\\regexp{", pos);
742 if (new_pos == string::npos)
746 LYXERR(Debug::FIND, "new_pos: " << new_pos);
747 t = apply_escapes(s.substr(pos, new_pos - pos), get_lyx_unescapes());
748 LYXERR(Debug::FIND, "t [lyx]: " << t);
749 t = apply_escapes(t, get_regexp_escapes());
750 LYXERR(Debug::FIND, "t [rxp]: " << t);
751 s.replace(pos, new_pos - pos, t);
752 new_pos = pos + t.size();
753 LYXERR(Debug::FIND, "Regexp after escaping: " << s);
754 LYXERR(Debug::FIND, "new_pos: " << new_pos);
755 if (new_pos == s.size())
758 // Might fail if \\endregexp{} is preceeded by unexpected stuff (weird escapes)
759 size_t end_pos = s.find("\\endregexp{}}", new_pos + 8);
760 LYXERR(Debug::FIND, "end_pos: " << end_pos);
761 t = s.substr(new_pos + 8, end_pos - (new_pos + 8));
762 LYXERR(Debug::FIND, "t in regexp : " << t);
763 t = apply_escapes(t, get_lyx_unescapes());
764 LYXERR(Debug::FIND, "t in regexp [lyx]: " << t);
766 t = apply_escapes(t, get_regexp_latex_escapes());
767 LYXERR(Debug::FIND, "t in regexp [ltx]: " << t);
769 if (end_pos == s.size()) {
770 s.replace(new_pos, end_pos - new_pos, t);
771 LYXERR(Debug::FIND, "Regexp after \\regexp{} removal: " << s);
774 s.replace(new_pos, end_pos + 13 - new_pos, t);
775 LYXERR(Debug::FIND, "Regexp after \\regexp{...\\endregexp{}} removal: " << s);
776 pos = new_pos + t.size();
777 LYXERR(Debug::FIND, "pos: " << pos);
783 /// Wrapper for lyx::regex_replace with simpler interface
784 bool regex_replace(string const & s, string & t, string const & searchstr,
785 string const & replacestr)
787 lyx::regex e(searchstr, regex_constants::ECMAScript);
789 ostream_iterator<char, char> it(oss);
790 lyx::regex_replace(it, s.begin(), s.end(), e, replacestr);
791 // tolerate t and s be references to the same variable
792 bool rv = (s != oss.str());
798 /** Checks if supplied string segment is well-formed from the standpoint of matching open-closed braces.
800 ** Verify that closed braces exactly match open braces. This avoids that, for example,
801 ** \frac{.*}{x} matches \frac{x+\frac{y}{x}}{z} with .* being 'x+\frac{y'.
804 ** Number of open braces that must remain open at the end for the verification to succeed.
806 bool braces_match(string::const_iterator const & beg,
807 string::const_iterator const & end,
811 string::const_iterator it = beg;
812 LYXERR(Debug::FIND, "Checking " << unmatched << " unmatched braces in '" << string(beg, end) << "'");
813 for (; it != end; ++it) {
814 // Skip escaped braces in the count
819 } else if (*it == '{') {
821 } else if (*it == '}') {
822 if (open_pars == 0) {
823 LYXERR(Debug::FIND, "Found unmatched closed brace");
829 if (open_pars != unmatched) {
830 LYXERR(Debug::FIND, "Found " << open_pars
831 << " instead of " << unmatched
832 << " unmatched open braces at the end of count");
835 LYXERR(Debug::FIND, "Braces match as expected");
845 MatchResult(): match_len(0),match2end(0), pos(0) {};
848 /** The class performing a match between a position in the document and the FindAdvOptions.
850 class MatchStringAdv {
852 MatchStringAdv(lyx::Buffer & buf, FindAndReplaceOptions const & opt);
854 /** Tests if text starting at the supplied position matches with the one provided to the MatchStringAdv
855 ** constructor as opt.search, under the opt.* options settings.
858 ** If set, then match is searched only against beginning of text starting at cur.
859 ** If unset, then match is searched anywhere in text starting at cur.
862 ** The length of the matching text, or zero if no match was found.
864 MatchResult operator()(DocIterator const & cur, int len = -1, bool at_begin = true) const;
869 /// first buffer on which search was started
870 lyx::Buffer * const p_first_buf;
872 FindAndReplaceOptions const & opt;
875 /// Auxiliary find method (does not account for opt.matchword)
876 MatchResult findAux(DocIterator const & cur, int len = -1, bool at_begin = true) const;
878 /** Normalize a stringified or latexified LyX paragraph.
882 ** <li>if search is not casesensitive, then lowercase the string;
883 ** <li>remove any newline at begin or end of the string;
884 ** <li>replace any newline in the middle of the string with a simple space;
885 ** <li>remove stale empty styles and environments, like \emph{} and \textbf{}.
888 ** @todo Normalization should also expand macros, if the corresponding
889 ** search option was checked.
891 string normalize(docstring const & s, bool hack_braces) const;
892 // normalized string to search
893 string par_as_string;
894 // regular expression to use for searching
896 // same as regexp, but prefixed with a ".*?"
898 // leading format material as string
899 string lead_as_string;
900 // par_as_string after removal of lead_as_string
901 string par_as_string_nolead;
902 // unmatched open braces in the search string/regexp
904 // number of (.*?) subexpressions added at end of search regexp for closing
905 // environments, math mode, styles, etc...
907 // Are we searching with regular expressions ?
912 static docstring buffer_to_latex(Buffer & buffer)
914 //OutputParams runparams(&buffer.params().encoding());
915 OutputParams runparams(encodings.fromLyXName("utf8"));
916 odocstringstream ods;
918 runparams.nice = true;
919 runparams.flavor = OutputParams::XETEX;
920 runparams.linelen = 10000; //lyxrc.plaintext_linelen;
921 // No side effect of file copying and image conversion
922 runparams.dryrun = true;
923 runparams.for_search = true;
924 pit_type const endpit = buffer.paragraphs().size();
925 for (pit_type pit = 0; pit != endpit; ++pit) {
926 TeXOnePar(buffer, buffer.text(), pit, os, runparams);
927 LYXERR(Debug::FIND, "searchString up to here: " << ods.str());
933 static docstring stringifySearchBuffer(Buffer & buffer, FindAndReplaceOptions const & opt)
936 if (!opt.ignoreformat) {
937 str = buffer_to_latex(buffer);
939 // OutputParams runparams(&buffer.params().encoding());
940 OutputParams runparams(encodings.fromLyXName("utf8"));
941 runparams.nice = true;
942 runparams.flavor = OutputParams::XETEX;
943 runparams.linelen = 10000; //lyxrc.plaintext_linelen;
944 runparams.dryrun = true;
945 runparams.for_search = true;
946 for (pos_type pit = pos_type(0); pit < (pos_type)buffer.paragraphs().size(); ++pit) {
947 Paragraph const & par = buffer.paragraphs().at(pit);
948 LYXERR(Debug::FIND, "Adding to search string: '"
949 << par.asString(pos_type(0), par.size(),
950 AS_STR_INSETS | AS_STR_SKIPDELETE | AS_STR_PLAINTEXT,
953 str += par.asString(pos_type(0), par.size(),
954 AS_STR_INSETS | AS_STR_SKIPDELETE | AS_STR_PLAINTEXT,
962 /// Return separation pos between the leading material and the rest
963 static size_t identifyLeading(string const & s)
966 // @TODO Support \item[text]
967 // Kornel: Added textsl, textsf, textit, texttt and noun
968 // + allow to search for colored text too
969 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)\\*?)\\{", "")
970 || regex_replace(t, t, REGEX_BOS "\\$", "")
971 || regex_replace(t, t, REGEX_BOS "\\\\\\[ ", "")
972 || regex_replace(t, t, REGEX_BOS " ?\\\\item\\{[a-z]+\\}", "")
973 || regex_replace(t, t, REGEX_BOS "\\\\begin\\{[a-zA-Z_]*\\*?\\} ", ""))
975 LYXERR(Debug::FIND, " after removing leading $, \\[ , \\emph{, \\textbf{, etc.: '" << t << "'");
980 * Given a latexified string, retrieve some handled features
981 * The features of the regex will later be compared with the features
982 * of the searched text. If the regex features are not a
983 * subset of the analized, then, in not format ignoring search
984 * we can early stop the search in the relevant inset.
986 typedef map<string, bool> Features;
988 static Features identifyFeatures(string const & s)
990 static regex const feature("\\\\(([a-zA-Z]+(\\{([a-z]+\\*?)\\}|\\*)?))\\{");
991 static regex const valid("^("
993 "(footnotesize|tiny|scriptsize|small|large|Large|LARGE|huge|Huge|"
994 "emph|noun|text(bf|md|sl|sf|it|tt)|"
995 "(textcolor|foreignlanguage|item|listitem|latexenvironment)\\{[a-z]+\\*?\\})|"
996 "(u|uu)line|(s|x)out|uwave|"
997 "(sub|extra)?title|author|subject|publishers|dedication|(upper|lower)titleback|lyx(right)?address)|"
998 "((sub)?(((sub)?section)|paragraph)|part|chapter|lyxslide)\\*?)$");
1003 for (sregex_iterator it(s.begin(), s.end(), feature), end; it != end; ++it) {
1006 if (sub.str(1).compare("regexp") == 0) {
1010 string token = sub.str(1);
1012 if (regex_match(token, sub2, valid)) {
1020 if (sub.str(1).compare("endregexp") == 0) {
1030 * defines values features of a key "\\[a-z]+{"
1035 /* Char type with content discarded
1036 * like \hspace{1cm} */
1038 /* Char, like \backslash */
1040 /* \part, \section*, ... */
1042 /* title, author etc */
1044 /* \foreignlanguage{ngerman}, ... */
1047 * to discard language in content */
1050 /* \begin{eqnarray}...\end{eqnarray}, ... $...$ */
1052 /* fonts, colors, markups, ... */
1054 /* footnotesize, ... large, ...
1055 * Ignore all of them */
1058 /* inputencoding, ...
1059 * Discard also content, because they do not help in search */
1062 * like remove, but also all arguments */
1064 /* item, listitem */
1066 /* tex, latex, ... like isChar */
1068 /* like \lettrine[lines=5]{}{} */
1070 /* End of arguments marker for lettrine,
1071 * so that they can be ignored */
1081 parenthesiscount(1),
1085 KeyInfo(KeyType type, int parcount, bool disable)
1091 parenthesiscount(parcount),
1100 int parenthesiscount;
1102 bool used; /* by pattern */
1107 Border(int l=0, int u=0) : low(l), upper(u) {};
1112 #define MAXOPENED 30
1114 bool isPatternString;
1116 explicit Intervall(bool isPattern) :
1117 isPatternString(isPattern),
1119 actualdeptindex(0) { depts[0] = 0; closes[0] = 0;};
1122 int depts[MAXOPENED];
1123 int closes[MAXOPENED];
1124 int actualdeptindex;
1125 Border borders[2*MAXOPENED];
1126 int previousNotIgnored(int);
1127 int nextNotIgnored(int);
1128 void handleOpenP(int i);
1129 void handleCloseP(int i, bool closingAllowed);
1130 void resetOpenedP(int openPos);
1131 void addIntervall(int upper);
1132 void addIntervall(int low, int upper); /* if explicit */
1133 void removeAccents();
1134 void setForDefaultLang(KeyInfo &defLang);
1135 int findclosing(int start, int end, char up, char down, int repeat);
1136 void handleParentheses(int lastpos, bool closingAllowed);
1138 int isOpeningPar(int pos);
1140 void output(ostringstream &os, int lastpos);
1141 // string show(int lastpos);
1144 int Intervall::isOpeningPar(int pos)
1146 if ((pos < 0) || (size_t(pos) >= par.size()))
1148 if (par[pos] != '{')
1150 if (size_t(pos) + 2 >= par.size())
1152 if (par[pos+2] != '}')
1154 if (par[pos+1] == '[' || par[pos+1] == ']')
1159 void Intervall::setForDefaultLang(KeyInfo &defLang)
1161 // Enable the use of first token again
1162 if (ignoreidx >= 0) {
1163 int value = defLang._tokenstart + defLang._tokensize;
1165 if (borders[0].low < value)
1166 borders[0].low = value;
1167 if (borders[0].upper < value)
1168 borders[0].upper = value;
1173 static void checkDepthIndex(int val)
1175 static int maxdepthidx = MAXOPENED-2;
1176 if (val > maxdepthidx) {
1178 LYXERR0("maxdepthidx now " << val);
1182 static void checkIgnoreIdx(int val)
1184 static int maxignoreidx = 2*MAXOPENED - 4;
1185 if (val > maxignoreidx) {
1187 LYXERR0("maxignoreidx now " << val);
1192 * Expand the region of ignored parts of the input latex string
1193 * The region is only relevant in output()
1195 void Intervall::addIntervall(int low, int upper)
1198 if (low == upper) return;
1199 for (idx = ignoreidx+1; idx > 0; --idx) {
1200 if (low > borders[idx-1].upper) {
1204 Border br(low, upper);
1205 if (idx > ignoreidx) {
1208 checkIgnoreIdx(ignoreidx);
1212 // Expand only if one of the new bound is inside the interwall
1213 // We know here that br.low > borders[idx-1].upper
1214 if (br.upper < borders[idx].low) {
1215 // We have to insert at this pos
1216 for (int i = ignoreidx+1; i > idx; --i) {
1217 borders[i] = borders[i-1];
1221 checkIgnoreIdx(ignoreidx);
1224 // Here we know, that we are overlapping
1225 if (br.low > borders[idx].low)
1226 br.low = borders[idx].low;
1227 // check what has to be concatenated
1229 for (int i = idx; i <= ignoreidx; i++) {
1230 if (br.upper >= borders[i].low) {
1232 if (br.upper < borders[i].upper)
1233 br.upper = borders[i].upper;
1239 // count should be >= 1 here
1242 for (int i = idx + count; i <= ignoreidx; i++) {
1243 borders[i-count+1] = borders[i];
1245 ignoreidx -= count - 1;
1251 typedef map<string, string> AccentsMap;
1252 static AccentsMap accents = map<string, string>();
1254 static void buildaccent(string n, string param, string values)
1258 const char delim = '|';
1259 while (getline(s, name, delim)) {
1261 for (size_t i = 0; i < param.size(); i++) {
1262 string key = name + "{" + param[i] + "}";
1263 // get the corresponding utf8-value
1264 if ((values[start] & 0xc0) != 0xc0) {
1265 // should not happen, utf8 encoding starts at least with 11xxxxxx
1269 for (int j = 1; ;j++) {
1270 if (start + j >= values.size())
1272 if ((values[start+j] & 0xc0) == 0xc0) {
1273 // This is the first byte of following utf8 char
1274 accents[key] = values.substr(start, j);
1283 static void buildAccentsMap()
1285 accents["imath"] = "ı";
1286 accents["jmath"] = "ȷ";
1287 accents["lyxmathsym{ß}"] = "ß";
1288 accents["ddot{\\imath}"] = "ï";
1289 buildaccent("ddot", "aAeEIoOuUyY",
1290 "äÄëËÏöÖüÜÿŸ"); // umlaut
1291 buildaccent("dot|.", "cCeEgGIzZaAoObBdDfFyY",
1292 "ċĊėĖġĠİżŻȧȦȯȮḃḂḋḊḟḞẏẎ");
1293 accents["acute{\\imath}"] = "í";
1294 buildaccent("acute", "aAcCeElLoOnNrRsSuUyYzZI",
1295 "áÁćĆéÉĺĹóÓńŃŕŔśŚúÚýÝźŹÍ");
1296 buildaccent("dacute|H|h", "oOuU", "őŐűŰ"); // double acute
1297 buildaccent("mathring|r", "uU", "ůŮ");
1298 accents["check{\\imath}"] = "ǐ";
1299 accents["check{\\jmath}"] = "ǰ";
1300 buildaccent("check|v", "cCdDaAeEIoOuUgGkKhHlLnNrRsSTzZ",
1301 "čČďĎǎǍěĚǏǒǑǔǓǧǦǩǨȟȞľĽňŇřŘšŠŤžŽ"); // caron
1302 accents["hat{\\imath}"] = "î";
1303 accents["hat{\\jmath}"] = "ĵ";
1304 buildaccent("hat|^", "aAeEiIcCgGhHJsSwWyYzZoOuU",
1305 "âÂêÊîÎĉĈĝĜĥĤĴŝŜŵŴŷŶẑẐôÔûÛ"); // circ
1306 accents["bar{\\imath}"] = "ī";
1307 buildaccent("bar|=", "aAeEIoOuUyY",
1308 "āĀēĒĪōŌūŪȳȲ"); // macron
1309 accents["tilde{\\imath}"] = "ĩ";
1310 buildaccent("tilde", "aAnNoOIuU",
1311 "ãÃñÑõÕĨũŨ"); // tilde
1315 * Created accents in math or regexp environment
1316 * are macros, but we need the utf8 equivalent
1318 void Intervall::removeAccents()
1320 if (accents.empty())
1322 static regex const accre("\\\\((lyxmathsym|ddot|dot|.|acute|dacute|h|H|mathring|r|check|v|hat|^|bar|=|tilde)\\{[^\\{\\}]+\\}|imath|jmath)");
1324 for (sregex_iterator itacc(par.begin(), par.end(), accre), end; itacc != end; ++itacc) {
1326 string key = sub.str(1);
1327 if (accents.find(key) != accents.end()) {
1328 string val = accents[key];
1329 size_t pos = sub.position(0);
1330 for (size_t i = 0; i < val.size(); i++) {
1331 par[pos+i] = val[i];
1333 addIntervall(pos+val.size(), pos + sub.str(0).size());
1334 for (size_t i = pos+val.size(); i < pos + sub.str(0).size(); i++) {
1335 // remove any remaining parentheses
1340 LYXERR0("Not added accent for \"" << key << "\"");
1345 void Intervall::handleOpenP(int i)
1348 depts[actualdeptindex] = i+1;
1349 closes[actualdeptindex] = -1;
1350 checkDepthIndex(actualdeptindex);
1353 void Intervall::handleCloseP(int i, bool closingAllowed)
1355 if (actualdeptindex <= 0) {
1356 if (! closingAllowed)
1357 LYXERR(Debug::FIND, "Bad closing parenthesis in latex"); /* should not happen, but the latex input may be wrong */
1358 // if we are at the very end
1359 addIntervall(i, i+1);
1362 closes[actualdeptindex] = i+1;
1367 void Intervall::resetOpenedP(int openPos)
1369 // Used as initializer for foreignlanguage entry
1370 actualdeptindex = 1;
1371 depts[1] = openPos+1;
1375 int Intervall::previousNotIgnored(int start)
1377 int idx = 0; /* int intervalls */
1378 for (idx = ignoreidx; idx >= 0; --idx) {
1379 if (start > borders[idx].upper)
1381 if (start >= borders[idx].low)
1382 start = borders[idx].low-1;
1387 int Intervall::nextNotIgnored(int start)
1389 int idx = 0; /* int intervalls */
1390 for (idx = 0; idx <= ignoreidx; idx++) {
1391 if (start < borders[idx].low)
1393 if (start < borders[idx].upper)
1394 start = borders[idx].upper;
1399 typedef map<string, KeyInfo> KeysMap;
1400 typedef vector< KeyInfo> Entries;
1401 static KeysMap keys = map<string, KeyInfo>();
1408 void buildKeys(bool);
1409 void buildEntries(bool);
1410 void makeKey(const string &, KeyInfo, bool isPatternString);
1411 void processRegion(int start, int region_end); /* remove {} parts */
1412 void removeHead(KeyInfo&, int count=0);
1415 LatexInfo(string par, bool isPatternString) : entidx(-1), interval(isPatternString) {
1417 interval.hasTitle = false;
1418 interval.titleValue = "";
1419 buildKeys(isPatternString);
1420 entries = vector<KeyInfo>();
1421 buildEntries(isPatternString);
1425 if (entries.empty()) {
1428 if (entries[0].keytype == KeyInfo::isTitle) {
1429 if (! entries[0].disabled) {
1430 interval.hasTitle = true;
1431 interval.titleValue = entries[0].head;
1434 interval.hasTitle = false;
1435 interval.titleValue = "";
1437 removeHead(entries[0]);
1438 if (entries.size() > 1)
1447 if (int(entries.size()) > entidx) {
1454 bool setNextKey(int idx) {
1455 if ((idx == entidx) && (entidx >= 0)) {
1462 int find(int start, KeyInfo::KeyType keytype) {
1466 while (tmpIdx < int(entries.size())) {
1467 if (entries[tmpIdx].keytype == keytype)
1473 int process(ostringstream &os, KeyInfo &actual);
1474 int dispatch(ostringstream &os, int previousStart, KeyInfo &actual);
1475 // string show(int lastpos) { return interval.show(lastpos);};
1476 int nextNotIgnored(int start) { return interval.nextNotIgnored(start);};
1477 KeyInfo &getKeyInfo(int keyinfo) {
1478 static KeyInfo invalidInfo = KeyInfo();
1479 if ((keyinfo < 0) || ( keyinfo >= int(entries.size())))
1482 return entries[keyinfo];
1484 void setForDefaultLang(KeyInfo &defLang) {interval.setForDefaultLang(defLang);};
1485 void addIntervall(int low, int up) { interval.addIntervall(low, up); };
1489 int Intervall::findclosing(int start, int end, char up = '{', char down = '}', int repeat = 1)
1494 for (int i = start; i < end; i += 1 + skip) {
1498 if (c == '\\') skip = 1;
1502 else if (c == down) {
1504 if ((repeat <= 0) || (par[i+1] != up))
1522 vector<MathEntry> entries;
1527 void insert(string wait, size_t start, size_t end) {
1528 MathEntry m = MathEntry();
1530 m.mathStart = start;
1532 m.mathSize = end - start;
1533 entries.push_back(m);
1535 bool empty() { return entries.empty(); };
1536 size_t getEndPos() {
1537 if (entries.empty() || (actualIdx >= entries.size())) {
1540 return entries[actualIdx].mathEnd;
1542 size_t getStartPos() {
1543 if (entries.empty() || (actualIdx >= entries.size())) {
1544 return 100000; /* definitely enough? */
1546 return entries[actualIdx].mathStart;
1548 size_t getFirstPos() {
1550 return getStartPos();
1553 if (entries.empty() || (actualIdx >= entries.size())) {
1556 return entries[actualIdx].mathSize;
1558 void incrEntry() { actualIdx++; };
1561 void LatexInfo::buildEntries(bool isPatternString)
1563 static regex const rmath("\\$|\\\\\\[|\\\\\\]|\\\\(begin|end)\\{((eqnarray|equation|flalign|gather|multline|align|alignat)\\*?)\\}");
1564 static regex const rkeys("\\$|\\\\\\[|\\\\\\]|\\\\((([a-zA-Z]+\\*?)(\\{([a-z]+\\*?)\\}|=[0-9]+[a-z]+)?))");
1565 static bool disableLanguageOverride = false;
1566 smatch sub, submath;
1567 bool evaluatingRegexp = false;
1569 bool evaluatingMath = false;
1570 bool evaluatingCode = false;
1572 bool evaluatingOptional = false;
1573 size_t optionalEnd = 0;
1576 bool math_end_waiting = false;
1577 size_t math_pos = 10000;
1580 interval.removeAccents();
1582 for (sregex_iterator itmath(interval.par.begin(), interval.par.end(), rmath), end; itmath != end; ++itmath) {
1584 if (math_end_waiting) {
1585 size_t pos = submath.position(size_t(0));
1586 if ((math_end == "$") &&
1587 (submath.str(0) == "$") &&
1588 (interval.par[pos-1] != '\\')) {
1589 mi.insert("$", math_pos, pos + 1);
1590 math_end_waiting = false;
1592 else if ((math_end == "\\]") &&
1593 (submath.str(0) == "\\]")) {
1594 mi.insert("\\]", math_pos, pos + 2);
1595 math_end_waiting = false;
1597 else if ((submath.str(1).compare("end") == 0) &&
1598 (submath.str(2).compare(math_end) == 0)) {
1599 mi.insert(math_end, math_pos, pos + submath.str(0).length());
1600 math_end_waiting = false;
1606 if (submath.str(1).compare("begin") == 0) {
1607 math_end_waiting = true;
1608 math_end = submath.str(2);
1609 math_pos = submath.position(size_t(0));
1611 else if (submath.str(0).compare("\\[") == 0) {
1612 math_end_waiting = true;
1614 math_pos = submath.position(size_t(0));
1616 else if (submath.str(0) == "$") {
1617 size_t pos = submath.position(size_t(0));
1618 if ((pos == 0) || (interval.par[pos-1] != '\\')) {
1619 math_end_waiting = true;
1626 // Ignore language if there is math somewhere in pattern-string
1627 if (isPatternString) {
1630 keys["foreignlanguage"].disabled = true;
1631 disableLanguageOverride = true;
1634 disableLanguageOverride = false;
1637 if (disableLanguageOverride) {
1638 keys["foreignlanguage"].disabled = true;
1641 math_pos = mi.getFirstPos();
1642 for (sregex_iterator it(interval.par.begin(), interval.par.end(), rkeys), end; it != end; ++it) {
1644 string key = sub.str(3);
1646 if (sub.str(0)[0] == '\\')
1647 key = sub.str(0)[1];
1651 size_t k_pos = sub.position(size_t(0));
1652 if ((k_pos > 0) && (interval.par[k_pos - 1] == '\\')) {
1653 // Escaped '$', ignoring
1659 if (evaluatingRegexp) {
1660 if (sub.str(1).compare("endregexp") == 0) {
1661 evaluatingRegexp = false;
1662 // found._tokenstart already set
1663 found._dataEnd = sub.position(size_t(0)) + 13;
1664 found._dataStart = found._dataEnd;
1665 found._tokensize = found._dataEnd - found._tokenstart;
1666 found.parenthesiscount = 0;
1667 found.head = interval.par.substr(found._tokenstart, found._tokensize);
1674 if (evaluatingMath) {
1675 if (size_t(sub.position(size_t(0))) < mi.getEndPos())
1677 evaluatingMath = false;
1679 math_pos = mi.getStartPos();
1681 if (keys.find(key) == keys.end()) {
1682 found = KeyInfo(KeyInfo::isStandard, 0, true);
1683 if (isPatternString) {
1684 found.keytype = KeyInfo::isChar;
1685 found.disabled = false;
1692 if (key.compare("regexp") == 0) {
1693 evaluatingRegexp = true;
1694 found._tokenstart = sub.position(size_t(0));
1695 found._tokensize = 0;
1699 // Handle the other params of key
1700 if (found.keytype == KeyInfo::isIgnored)
1702 else if (found.keytype == KeyInfo::isMath) {
1703 if (size_t(sub.position(size_t(0))) == math_pos) {
1705 found._tokenstart = sub.position(size_t(0));
1706 found._tokensize = mi.getSize();
1707 found._dataEnd = found._tokenstart + found._tokensize;
1708 found._dataStart = found._dataEnd;
1709 found.parenthesiscount = 0;
1710 found.head = interval.par.substr(found._tokenstart, found._tokensize);
1711 evaluatingMath = true;
1714 // begin|end of unknown env, discard
1715 // First handle tables
1716 // longtable|tabular
1717 bool discardComment;
1719 found.keytype = KeyInfo::doRemove;
1720 if ((sub.str(5).compare("longtable") == 0) ||
1721 (sub.str(5).compare("tabular") == 0)) {
1722 discardComment = true; /* '%' */
1725 discardComment = false;
1726 static regex const removeArgs("^(multicols|multipar|sectionbox|subsectionbox|tcolorbox)$");
1728 string token = sub.str(5);
1729 if (regex_match(token, sub2, removeArgs)) {
1730 found.keytype = KeyInfo::removeWithArg;
1733 // discard spaces before pos(0)
1734 int pos = sub.position(size_t(0));
1736 for (count = 0; pos - count > 0; count++) {
1737 char c = interval.par[pos-count-1];
1738 if (discardComment) {
1739 if ((c != ' ') && (c != '%'))
1745 found._tokenstart = pos - count;
1746 if (sub.str(1).compare(0, 5, "begin") == 0) {
1747 size_t pos1 = pos + sub.str(0).length();
1748 if (sub.str(5).compare("cjk") == 0) {
1749 pos1 = interval.findclosing(pos1+1, interval.par.length()) + 1;
1750 if ((interval.par[pos1] == '{') && (interval.par[pos1+1] == '}'))
1752 found.keytype = KeyInfo::isMain;
1753 found._dataStart = pos1;
1754 found._dataEnd = interval.par.length();
1755 found.disabled = keys["foreignlanguage"].disabled;
1756 found.used = keys["foreignlanguage"].used;
1757 found._tokensize = pos1 - found._tokenstart;
1758 found.head = interval.par.substr(found._tokenstart, found._tokensize);
1761 // Swallow possible optional params
1762 while (interval.par[pos1] == '[') {
1763 pos1 = interval.findclosing(pos1+1, interval.par.length(), '[', ']')+1;
1765 // Swallow also the eventual parameter
1766 if (interval.par[pos1] == '{') {
1767 found._dataEnd = interval.findclosing(pos1+1, interval.par.length()) + 1;
1770 found._dataEnd = pos1;
1772 found._dataStart = found._dataEnd;
1773 found._tokensize = count + found._dataEnd - pos;
1774 found.parenthesiscount = 0;
1775 found.head = interval.par.substr(found._tokenstart, found._tokensize);
1776 found.disabled = true;
1780 // Handle "\end{...}"
1781 found._dataStart = pos + sub.str(0).length();
1782 found._dataEnd = found._dataStart;
1783 found._tokensize = count + found._dataEnd - pos;
1784 found.parenthesiscount = 0;
1785 found.head = interval.par.substr(found._tokenstart, found._tokensize);
1786 found.disabled = true;
1790 else if (found.keytype != KeyInfo::isRegex) {
1791 found._tokenstart = sub.position(size_t(0));
1792 if (found.parenthesiscount == 0) {
1793 // Probably to be discarded
1794 size_t following_pos = sub.position(size_t(0)) + sub.str(3).length() + 1;
1795 char following = interval.par[following_pos];
1796 if (following == ' ')
1797 found.head = "\\" + sub.str(3) + " ";
1798 else if (following == '=') {
1799 // like \uldepth=1000pt
1800 found.head = sub.str(0);
1803 found.head = "\\" + key;
1804 found._tokensize = found.head.length();
1805 found._dataEnd = found._tokenstart + found._tokensize;
1806 found._dataStart = found._dataEnd;
1809 int params = found._tokenstart + key.length() + 1;
1810 if (evaluatingOptional) {
1811 if (size_t(found._tokenstart) > optionalEnd) {
1812 evaluatingOptional = false;
1815 found.disabled = true;
1818 int optend = params;
1819 while (interval.par[optend] == '[') {
1820 // discard optional parameters
1821 optend = interval.findclosing(optend+1, interval.par.length(), '[', ']') + 1;
1823 if (optend > params) {
1824 key += interval.par.substr(params, optend-params);
1825 evaluatingOptional = true;
1826 optionalEnd = optend;
1828 string token = sub.str(5);
1829 int closings = found.parenthesiscount;
1830 if (found.parenthesiscount == 1) {
1831 found.head = "\\" + key + "{";
1833 else if (found.parenthesiscount > 1) {
1835 found.head = sub.str(0) + "{";
1836 closings = found.parenthesiscount - 1;
1839 found.head = "\\" + key + "{";
1842 found._tokensize = found.head.length();
1843 found._dataStart = found._tokenstart + found.head.length();
1844 if (interval.par.substr(found._dataStart-1, 15).compare("\\endarguments{}") == 0) {
1845 found._dataStart += 15;
1847 size_t endpos = interval.findclosing(found._dataStart, interval.par.length(), '{', '}', closings);
1848 if (found.keytype == KeyInfo::isList) {
1849 // Check if it really is list env
1850 static regex const listre("^([a-z]+)$");
1852 if (!regex_match(token, sub2, listre)) {
1853 // Change the key of this entry. It is not in a list/item environment
1854 found.keytype = KeyInfo::endArguments;
1857 if (found.keytype == KeyInfo::noMain) {
1858 evaluatingCode = true;
1860 codeStart = found._dataStart;
1862 else if (evaluatingCode) {
1863 if (size_t(found._dataStart) > codeEnd)
1864 evaluatingCode = false;
1865 else if (found.keytype == KeyInfo::isMain) {
1866 // Disable this key, treate it as standard
1867 found.keytype = KeyInfo::isStandard;
1868 found.disabled = true;
1869 if ((codeEnd == interval.par.length()) &&
1870 (found._tokenstart == codeStart)) {
1871 // trickery, because the code inset starts
1872 // with \selectlanguage ...
1874 if (entries.size() > 1) {
1875 entries[entries.size()-1]._dataEnd = codeEnd;
1880 if ((endpos == interval.par.length()) &&
1881 (found.keytype == KeyInfo::doRemove)) {
1882 // Missing closing => error in latex-input?
1883 // therefore do not delete remaining data
1884 found._dataStart -= 1;
1885 found._dataEnd = found._dataStart;
1888 found._dataEnd = endpos;
1890 if (isPatternString) {
1891 keys[key].used = true;
1894 entries.push_back(found);
1898 void LatexInfo::makeKey(const string &keysstring, KeyInfo keyI, bool isPatternString)
1900 stringstream s(keysstring);
1902 const char delim = '|';
1903 while (getline(s, key, delim)) {
1904 KeyInfo keyII(keyI);
1905 if (isPatternString) {
1908 else if ( !keys[key].used)
1909 keyII.disabled = true;
1914 void LatexInfo::buildKeys(bool isPatternString)
1917 static bool keysBuilt = false;
1918 if (keysBuilt && !isPatternString) return;
1920 // Known standard keys with 1 parameter.
1921 // Split is done, if not at start of region
1922 makeKey("textsf|textss|texttt", KeyInfo(KeyInfo::isStandard, 1, ignoreFormats.getFamily()), isPatternString);
1923 makeKey("textbf", KeyInfo(KeyInfo::isStandard, 1, ignoreFormats.getSeries()), isPatternString);
1924 makeKey("textit|textsc|textsl", KeyInfo(KeyInfo::isStandard, 1, ignoreFormats.getShape()), isPatternString);
1925 makeKey("uuline|uline|uwave", KeyInfo(KeyInfo::isStandard, 1, ignoreFormats.getUnderline()), isPatternString);
1926 makeKey("emph|noun", KeyInfo(KeyInfo::isStandard, 1, ignoreFormats.getMarkUp()), isPatternString);
1927 makeKey("sout|xout", KeyInfo(KeyInfo::isStandard, 1, ignoreFormats.getStrikeOut()), isPatternString);
1929 makeKey("section|subsection|subsubsection|paragraph|subparagraph|minisec",
1930 KeyInfo(KeyInfo::isSectioning, 1, ignoreFormats.getSectioning()), isPatternString);
1931 makeKey("section*|subsection*|subsubsection*|paragraph*",
1932 KeyInfo(KeyInfo::isSectioning, 1, ignoreFormats.getSectioning()), isPatternString);
1933 makeKey("part|part*|chapter|chapter*", KeyInfo(KeyInfo::isSectioning, 1, ignoreFormats.getSectioning()), isPatternString);
1934 makeKey("title|subtitle|author|subject|publishers|dedication|uppertitleback|lowertitleback|extratitle|lyxaddress|lyxrightaddress", KeyInfo(KeyInfo::isTitle, 1, ignoreFormats.getFrontMatter()), isPatternString);
1936 makeKey("regexp", KeyInfo(KeyInfo::isRegex, 1, false), isPatternString);
1938 // Split is done, if not at start of region
1939 makeKey("textcolor", KeyInfo(KeyInfo::isStandard, 2, ignoreFormats.getColor()), isPatternString);
1940 makeKey("latexenvironment", KeyInfo(KeyInfo::isStandard, 2, false), isPatternString);
1942 // Split is done always.
1943 makeKey("foreignlanguage", KeyInfo(KeyInfo::isMain, 2, ignoreFormats.getLanguage()), isPatternString);
1947 makeKey("backslash|textbackslash|slash", KeyInfo(KeyInfo::isChar, 0, false), isPatternString);
1948 makeKey("textasciicircum|textasciitilde", KeyInfo(KeyInfo::isChar, 0, false), isPatternString);
1949 makeKey("textasciiacute|texemdash", KeyInfo(KeyInfo::isChar, 0, false), isPatternString);
1950 makeKey("dots|ldots", KeyInfo(KeyInfo::isChar, 0, false), isPatternString);
1952 makeKey("quad|qquad|hfill|dotfill", KeyInfo(KeyInfo::isChar, 0, false), isPatternString);
1953 makeKey("textvisiblespace|nobreakspace", KeyInfo(KeyInfo::isChar, 0, false), isPatternString);
1954 makeKey("negthickspace|negmedspace|negthinspace", KeyInfo(KeyInfo::isChar, 0, false), isPatternString);
1956 // makeKey("enskip|smallskip|medskip|bigskip|vfill", KeyInfo(KeyInfo::isChar, 0, false), isPatternString);
1957 // Custom space/skip, remove the content (== length value)
1958 makeKey("vspace|vspace*|hspace|hspace*|mspace", KeyInfo(KeyInfo::noContent, 1, false), isPatternString);
1959 // Found in fr/UserGuide.lyx
1960 makeKey("og|fg", KeyInfo(KeyInfo::isChar, 0, false), isPatternString);
1962 makeKey("textquotedbl|quotesinglbase|lyxarrow", KeyInfo(KeyInfo::isChar, 0, false), isPatternString);
1963 makeKey("textquotedblleft|textquotedblright", KeyInfo(KeyInfo::isChar, 0, false), isPatternString);
1964 // Known macros to remove (including their parameter)
1966 makeKey("input|inputencoding|label|ref|index|bibitem", KeyInfo(KeyInfo::doRemove, 1, false), isPatternString);
1967 makeKey("addtocounter|setlength", KeyInfo(KeyInfo::noContent, 2, true), isPatternString);
1968 // handle like standard keys with 1 parameter.
1969 makeKey("url|href|vref|thanks", KeyInfo(KeyInfo::isStandard, 1, false), isPatternString);
1971 // Macros to remove, but let the parameter survive
1973 makeKey("menuitem|textmd|textrm", KeyInfo(KeyInfo::isStandard, 1, true), isPatternString);
1975 // Remove language spec from content of these insets
1976 makeKey("code", KeyInfo(KeyInfo::noMain, 1, false), isPatternString);
1978 // Same effect as previous, parameter will survive (because there is no one anyway)
1980 makeKey("noindent|textcompwordmark|maketitle", KeyInfo(KeyInfo::isStandard, 0, true), isPatternString);
1981 // Remove table decorations
1982 makeKey("hline|tabularnewline|toprule|bottomrule|midrule", KeyInfo(KeyInfo::doRemove, 0, true), isPatternString);
1983 // Discard shape-header.
1984 // For footnote or shortcut too, because of lang settings
1985 // and wrong handling if used 'KeyInfo::noMain'
1986 makeKey("circlepar|diamondpar|heartpar|nutpar", KeyInfo(KeyInfo::isStandard, 1, true), isPatternString);
1987 makeKey("trianglerightpar|hexagonpar|starpar", KeyInfo(KeyInfo::isStandard, 1, true), isPatternString);
1988 makeKey("triangleuppar|triangledownpar|droppar", KeyInfo(KeyInfo::isStandard, 1, true), isPatternString);
1989 makeKey("triangleleftpar|shapepar|dropuppar", KeyInfo(KeyInfo::isStandard, 1, true), isPatternString);
1990 makeKey("hphantom|vphantom|footnote|shortcut|include|includegraphics", KeyInfo(KeyInfo::isStandard, 1, true), isPatternString);
1991 makeKey("parbox", KeyInfo(KeyInfo::doRemove, 1, true), isPatternString);
1992 // like ('tiny{}' or '\tiny ' ... )
1993 makeKey("footnotesize|tiny|scriptsize|small|large|Large|LARGE|huge|Huge", KeyInfo(KeyInfo::isSize, 0, false), isPatternString);
1995 // Survives, like known character
1996 makeKey("lyx|LyX|latex|LaTeX|latexe|LaTeXe|tex|TeX", KeyInfo(KeyInfo::isChar, 0, false), isPatternString);
1997 makeKey("item|listitem", KeyInfo(KeyInfo::isList, 1, false), isPatternString);
1999 makeKey("begin|end", KeyInfo(KeyInfo::isMath, 1, false), isPatternString);
2000 makeKey("[|]", KeyInfo(KeyInfo::isMath, 1, false), isPatternString);
2001 makeKey("$", KeyInfo(KeyInfo::isMath, 1, false), isPatternString);
2003 makeKey("par|uldepth|ULdepth|protect|nobreakdash|medskip|relax", KeyInfo(KeyInfo::isStandard, 0, true), isPatternString);
2004 // Remove RTL/LTR marker
2005 makeKey("l|r|textlr|textfr|textar|beginl|endl", KeyInfo(KeyInfo::isStandard, 0, true), isPatternString);
2006 makeKey("lettrine", KeyInfo(KeyInfo::cleanToStart, 0, true), isPatternString);
2007 makeKey("lyxslide", KeyInfo(KeyInfo::isSectioning, 1, true), isPatternString);
2008 makeKey("endarguments", KeyInfo(KeyInfo::endArguments, 0, true), isPatternString);
2009 makeKey("twocolumn", KeyInfo(KeyInfo::removeWithArg, 2, true), isPatternString);
2010 makeKey("tnotetext|ead|fntext|cortext|address", KeyInfo(KeyInfo::removeWithArg, 0, true), isPatternString);
2011 makeKey("lyxend", KeyInfo(KeyInfo::isStandard, 0, true), isPatternString);
2012 if (isPatternString) {
2013 // Allow the first searched string to rebuild the keys too
2017 // no need to rebuild again
2023 * Keep the list of actual opened parentheses actual
2024 * (e.g. depth == 4 means there are 4 '{' not processed yet)
2026 void Intervall::handleParentheses(int lastpos, bool closingAllowed)
2029 for (int i = depts[actualdeptindex]; i < lastpos; i+= 1 + skip) {
2033 if (c == '\\') skip = 1;
2034 else if (c == '{') {
2037 else if (c == '}') {
2038 handleCloseP(i, closingAllowed);
2044 string Intervall::show(int lastpos)
2046 int idx = 0; /* int intervalls */
2049 for (idx = 0; idx <= ignoreidx; idx++) {
2050 while (i < lastpos) {
2052 if (i <= borders[idx].low) {
2053 if (borders[idx].low > lastpos)
2054 printsize = lastpos - i;
2056 printsize = borders[idx].low - i;
2057 s += par.substr(i, printsize);
2059 if (i >= borders[idx].low)
2060 i = borders[idx].upper;
2063 i = borders[idx].upper;
2069 s += par.substr(i, lastpos-i);
2075 void Intervall::output(ostringstream &os, int lastpos)
2077 // get number of chars to output
2078 int idx = 0; /* int intervalls */
2081 string startTitle = titleValue;
2082 for (idx = 0; idx <= ignoreidx; idx++) {
2084 if (i <= borders[idx].low) {
2086 if (borders[idx].low > lastpos)
2087 printsize = lastpos - i;
2089 printsize = borders[idx].low - i;
2090 if (printsize > 0) {
2091 os << startTitle << par.substr(i, printsize);
2093 printed += printsize;
2096 handleParentheses(i, false);
2097 if (i >= borders[idx].low)
2098 i = borders[idx].upper;
2101 i = borders[idx].upper;
2108 os << startTitle << par.substr(i, lastpos-i);
2109 printed += lastpos-i;
2111 handleParentheses(lastpos, false);
2112 for (int i = actualdeptindex; i > 0; --i) {
2115 if (hasTitle && (printed > 0))
2117 if (! isPatternString)
2119 handleParentheses(lastpos, true); /* extra closings '}' allowed here */
2122 void LatexInfo::processRegion(int start, int region_end)
2124 while (start < region_end) { /* Let {[} and {]} survive */
2125 int cnt = interval.isOpeningPar(start);
2127 // Closing is allowed past the region
2128 int closing = interval.findclosing(start+1, interval.par.length());
2129 interval.addIntervall(start, start+1);
2130 interval.addIntervall(closing, closing+1);
2134 start = interval.nextNotIgnored(start+1);
2138 void LatexInfo::removeHead(KeyInfo &actual, int count)
2140 if (actual.parenthesiscount == 0) {
2141 // "{\tiny{} ...}" ==> "{{} ...}"
2142 interval.addIntervall(actual._tokenstart-count, actual._tokenstart + actual._tokensize);
2145 // Remove header hull, that is "\url{abcd}" ==> "abcd"
2146 interval.addIntervall(actual._tokenstart - count, actual._dataStart);
2147 interval.addIntervall(actual._dataEnd, actual._dataEnd+1);
2151 int LatexInfo::dispatch(ostringstream &os, int previousStart, KeyInfo &actual)
2154 switch (actual.keytype)
2156 case KeyInfo::isTitle: {
2158 nextKeyIdx = getNextKey();
2161 case KeyInfo::cleanToStart: {
2162 actual._dataEnd = actual._dataStart;
2163 nextKeyIdx = getNextKey();
2164 // Search for end of arguments
2165 int tmpIdx = find(nextKeyIdx, KeyInfo::endArguments);
2167 for (int i = nextKeyIdx; i <= tmpIdx; i++) {
2168 entries[i].disabled = true;
2170 actual._dataEnd = entries[tmpIdx]._dataEnd;
2172 while (interval.par[actual._dataEnd] == ' ')
2174 interval.addIntervall(0, actual._dataEnd+1);
2175 interval.actualdeptindex = 0;
2176 interval.depts[0] = actual._dataEnd+1;
2177 interval.closes[0] = -1;
2180 case KeyInfo::noContent: { /* char like "\hspace{2cm}" */
2181 if (actual.disabled)
2182 interval.addIntervall(actual._tokenstart, actual._dataEnd);
2184 interval.addIntervall(actual._dataStart, actual._dataEnd);
2187 case KeyInfo::isChar: {
2188 nextKeyIdx = getNextKey();
2191 case KeyInfo::isSize: {
2192 if (actual.disabled || (interval.par[actual._dataStart] != '{') || (interval.par[actual._dataStart-1] == ' ')) {
2193 processRegion(actual._dataEnd, actual._dataEnd+1); /* remove possibly following {} */
2194 interval.addIntervall(actual._tokenstart, actual._dataEnd+1);
2195 nextKeyIdx = getNextKey();
2197 // Here _dataStart points to '{', so correct it
2198 actual._dataStart += 1;
2199 actual._tokensize += 1;
2200 actual.parenthesiscount = 1;
2201 if (interval.par[actual._dataStart] == '}') {
2202 // Determine the end if used like '{\tiny{}...}'
2203 actual._dataEnd = interval.findclosing(actual._dataStart+1, interval.par.length()) + 1;
2204 interval.addIntervall(actual._dataStart, actual._dataStart+1);
2207 // Determine the end if used like '\tiny{...}'
2208 actual._dataEnd = interval.findclosing(actual._dataStart, interval.par.length()) + 1;
2210 // Split on this key if not at start
2211 int start = interval.nextNotIgnored(previousStart);
2212 if (start < actual._tokenstart) {
2213 interval.output(os, actual._tokenstart);
2214 interval.addIntervall(start, actual._tokenstart);
2216 // discard entry if at end of actual
2217 nextKeyIdx = process(os, actual);
2221 case KeyInfo::endArguments:
2222 // Remove trailing '{}' too
2223 actual._dataStart += 1;
2224 actual._dataEnd += 1;
2225 interval.addIntervall(actual._tokenstart, actual._dataEnd+1);
2226 nextKeyIdx = getNextKey();
2228 case KeyInfo::noMain:
2230 case KeyInfo::isStandard: {
2231 if (actual.disabled) {
2233 processRegion(actual._dataStart, actual._dataStart+1);
2234 nextKeyIdx = getNextKey();
2236 // Split on this key if not at datastart of calling entry
2237 int start = interval.nextNotIgnored(previousStart);
2238 if (start < actual._tokenstart) {
2239 interval.output(os, actual._tokenstart);
2240 interval.addIntervall(start, actual._tokenstart);
2242 // discard entry if at end of actual
2243 nextKeyIdx = process(os, actual);
2247 case KeyInfo::removeWithArg: {
2248 nextKeyIdx = getNextKey();
2249 // Search for end of arguments
2250 int tmpIdx = find(nextKeyIdx, KeyInfo::endArguments);
2252 for (int i = nextKeyIdx; i <= tmpIdx; i++) {
2253 entries[i].disabled = true;
2255 actual._dataEnd = entries[tmpIdx]._dataEnd;
2257 interval.addIntervall(actual._tokenstart, actual._dataEnd+1);
2260 case KeyInfo::doRemove: {
2261 // Remove the key with all parameters and following spaces
2263 for (pos = actual._dataEnd+1; pos < interval.par.length(); pos++) {
2264 if ((interval.par[pos] != ' ') && (interval.par[pos] != '%'))
2267 interval.addIntervall(actual._tokenstart, pos);
2268 nextKeyIdx = getNextKey();
2271 case KeyInfo::isList: {
2272 // Discard space before _tokenstart
2274 for (count = 0; count < actual._tokenstart; count++) {
2275 if (interval.par[actual._tokenstart-count-1] != ' ')
2278 nextKeyIdx = getNextKey();
2279 int tmpIdx = find(nextKeyIdx, KeyInfo::endArguments);
2281 // Special case: \item is not a list, but a command (like in Style Author_Biography in maa-monthly.layout)
2283 // How else can we catch this one?
2284 for (int i = nextKeyIdx; i <= tmpIdx; i++) {
2285 entries[i].disabled = true;
2287 actual._dataEnd = entries[tmpIdx]._dataEnd;
2289 else if (nextKeyIdx > 0) {
2290 // Ignore any lang entries inside data region
2291 for (int i = nextKeyIdx; i < int(entries.size()) && entries[i]._tokenstart < actual._dataEnd; i++) {
2292 if (entries[i].keytype == KeyInfo::isMain)
2293 entries[i].disabled = true;
2296 if (actual.disabled) {
2297 interval.addIntervall(actual._tokenstart-count, actual._dataEnd+1);
2300 interval.addIntervall(actual._tokenstart-count, actual._tokenstart);
2302 if (interval.par[actual._dataEnd+1] == '[') {
2303 int posdown = interval.findclosing(actual._dataEnd+2, interval.par.length(), '[', ']');
2304 if ((interval.par[actual._dataEnd+2] == '{') &&
2305 (interval.par[posdown-1] == '}')) {
2306 interval.addIntervall(actual._dataEnd+1,actual._dataEnd+3);
2307 interval.addIntervall(posdown-1, posdown+1);
2310 interval.addIntervall(actual._dataEnd+1, actual._dataEnd+2);
2311 interval.addIntervall(posdown, posdown+1);
2313 int blk = interval.nextNotIgnored(actual._dataEnd+1);
2314 if (blk > posdown) {
2315 // Discard at most 1 space after empty item
2317 for (count = 0; count < 1; count++) {
2318 if (interval.par[blk+count] != ' ')
2322 interval.addIntervall(blk, blk+count);
2327 case KeyInfo::isSectioning: {
2328 // Discard spaces before _tokenstart
2330 int val = actual._tokenstart;
2331 for (count = 0; count < actual._tokenstart;) {
2332 val = interval.previousNotIgnored(val-1);
2333 if (interval.par[val] != ' ')
2336 count = actual._tokenstart - val;
2339 if (actual.disabled) {
2340 removeHead(actual, count);
2341 nextKeyIdx = getNextKey();
2343 interval.addIntervall(actual._tokenstart-count, actual._tokenstart);
2344 nextKeyIdx = process(os, actual);
2348 case KeyInfo::isMath: {
2349 // Same as regex, use the content unchanged
2350 nextKeyIdx = getNextKey();
2353 case KeyInfo::isRegex: {
2354 // DO NOT SPLIT ON REGEX
2356 nextKeyIdx = getNextKey();
2359 case KeyInfo::isIgnored: {
2360 // Treat like a character for now
2361 nextKeyIdx = getNextKey();
2364 case KeyInfo::isMain: {
2365 if (interval.par.substr(actual._dataStart, 2) == "% ")
2366 interval.addIntervall(actual._dataStart, actual._dataStart+2);
2367 if (actual._tokenstart > 0) {
2368 int prev = interval.previousNotIgnored(actual._tokenstart - 1);
2369 if ((prev >= 0) && interval.par[prev] == '%')
2370 interval.addIntervall(prev, prev+1);
2372 if (actual.disabled) {
2374 if ((interval.par.substr(actual._dataStart, 3) == " \\[") ||
2375 (interval.par.substr(actual._dataStart, 8) == " \\begin{")) {
2376 // Discard also the space before math-equation
2377 interval.addIntervall(actual._dataStart, actual._dataStart+1);
2379 nextKeyIdx = getNextKey();
2380 // interval.resetOpenedP(actual._dataStart-1);
2383 if (actual._tokenstart < 26) {
2384 // for the first (and maybe dummy) language
2385 interval.setForDefaultLang(actual);
2387 interval.resetOpenedP(actual._dataStart-1);
2391 case KeyInfo::invalid:
2392 // This cannot happen, already handled
2395 // LYXERR0("Unhandled keytype");
2396 nextKeyIdx = getNextKey();
2403 int LatexInfo::process(ostringstream &os, KeyInfo &actual )
2405 int end = interval.nextNotIgnored(actual._dataEnd);
2406 int oldStart = actual._dataStart;
2407 int nextKeyIdx = getNextKey();
2409 if ((nextKeyIdx < 0) ||
2410 (entries[nextKeyIdx]._tokenstart >= actual._dataEnd) ||
2411 (entries[nextKeyIdx].keytype == KeyInfo::invalid)) {
2412 if (oldStart <= end) {
2413 processRegion(oldStart, end);
2418 KeyInfo &nextKey = getKeyInfo(nextKeyIdx);
2420 if ((nextKey.keytype == KeyInfo::isMain) && !nextKey.disabled) {
2421 (void) dispatch(os, actual._dataStart, nextKey);
2422 end = nextKey._tokenstart;
2425 processRegion(oldStart, nextKey._tokenstart);
2426 nextKeyIdx = dispatch(os, actual._dataStart, nextKey);
2428 oldStart = nextKey._dataEnd+1;
2430 // now nextKey is either invalid or is outside of actual._dataEnd
2431 // output the remaining and discard myself
2432 if (oldStart <= end) {
2433 processRegion(oldStart, end);
2435 if (interval.par[end] == '}') {
2437 // This is the normal case.
2438 // But if using the firstlanguage, the closing may be missing
2440 // get minimum of 'end' and 'actual._dataEnd' in case that the nextKey.keytype was 'KeyInfo::isMain'
2442 if (actual._dataEnd < end)
2443 output_end = interval.nextNotIgnored(actual._dataEnd);
2445 output_end = interval.nextNotIgnored(end);
2446 if ((actual.keytype == KeyInfo::isMain) && actual.disabled) {
2447 interval.addIntervall(actual._tokenstart, actual._tokenstart+actual._tokensize);
2449 // Remove possible empty data
2450 int dstart = interval.nextNotIgnored(actual._dataStart);
2451 while (interval.isOpeningPar(dstart) == 1) {
2452 interval.addIntervall(dstart, dstart+1);
2453 int dend = interval.findclosing(dstart+1, output_end);
2454 interval.addIntervall(dend, dend+1);
2455 dstart = interval.nextNotIgnored(dstart+1);
2457 if (dstart < output_end)
2458 interval.output(os, output_end);
2459 interval.addIntervall(actual._tokenstart, end);
2463 string splitOnKnownMacros(string par, bool isPatternString)
2466 LatexInfo li(par, isPatternString);
2467 // LYXERR0("Berfore split: " << par);
2468 KeyInfo DummyKey = KeyInfo(KeyInfo::KeyType::isMain, 2, true);
2470 DummyKey._tokensize = 0;
2471 DummyKey._dataStart = 0;
2472 DummyKey._dataEnd = par.length();
2473 DummyKey.disabled = true;
2474 int firstkeyIdx = li.getFirstKey();
2476 if (firstkeyIdx >= 0) {
2477 KeyInfo firstKey = li.getKeyInfo(firstkeyIdx);
2478 DummyKey._tokenstart = firstKey._tokenstart;
2480 if ((firstKey.keytype != KeyInfo::isMain) || firstKey.disabled) {
2481 // Use dummy firstKey
2482 firstKey = DummyKey;
2483 (void) li.setNextKey(firstkeyIdx);
2486 if (par.substr(firstKey._dataStart, 2) == "% ")
2487 li.addIntervall(firstKey._dataStart, firstKey._dataStart+2);
2489 nextkeyIdx = li.process(os, firstKey);
2490 while (nextkeyIdx >= 0) {
2491 // Check for a possible gap between the last
2492 // entry and this one
2493 int datastart = li.nextNotIgnored(firstKey._dataStart);
2494 KeyInfo &nextKey = li.getKeyInfo(nextkeyIdx);
2495 if ((nextKey._tokenstart > datastart)) {
2497 firstKey._dataStart = datastart;
2498 firstKey._dataEnd = par.length();
2499 (void) li.setNextKey(nextkeyIdx);
2500 // Fake the last opened parenthesis
2501 li.setForDefaultLang(firstKey);
2502 nextkeyIdx = li.process(os, firstKey);
2505 if (nextKey.keytype != KeyInfo::isMain) {
2506 firstKey._dataStart = datastart;
2507 firstKey._dataEnd = nextKey._dataEnd+1;
2508 (void) li.setNextKey(nextkeyIdx);
2509 li.setForDefaultLang(firstKey);
2510 nextkeyIdx = li.process(os, firstKey);
2513 nextkeyIdx = li.process(os, nextKey);
2517 // Handle the remaining
2518 firstKey._dataStart = li.nextNotIgnored(firstKey._dataStart);
2519 firstKey._dataEnd = par.length();
2521 if ((firstKey._dataStart < firstKey._dataEnd) &&
2522 (par[firstKey._dataStart] != '}')) {
2523 li.setForDefaultLang(firstKey);
2524 (void) li.process(os, firstKey);
2528 // return string definitelly impossible to match
2529 s = "\\foreignlanguage{ignore}{ }";
2533 s = par; /* no known macros found */
2534 // LYXERR0("After split: " << s);
2539 * Try to unify the language specs in the latexified text.
2540 * Resulting modified string is set to "", if
2541 * the searched tex does not contain all the features in the search pattern
2543 static string correctlanguagesetting(string par, bool isPatternString, bool withformat)
2545 static Features regex_f;
2546 static int missed = 0;
2547 static bool regex_with_format = false;
2549 int parlen = par.length();
2551 while ((parlen > 0) && (par[parlen-1] == '\n')) {
2554 if (isPatternString && (parlen > 0) && (par[parlen-1] == '~')) {
2555 // Happens to be there in case of description or labeling environment
2560 // Split the latex input into pieces which
2561 // can be digested by our search engine
2562 LYXERR(Debug::FIND, "input: \"" << par << "\"");
2563 result = splitOnKnownMacros(par.substr(0,parlen), isPatternString);
2564 LYXERR(Debug::FIND, "After split: \"" << result << "\"");
2567 result = par.substr(0, parlen);
2568 if (isPatternString) {
2571 regex_f = identifyFeatures(result);
2572 string features = "";
2573 for (auto it = regex_f.cbegin(); it != regex_f.cend(); ++it) {
2574 string a = it->first;
2575 regex_with_format = true;
2576 features += " " + a;
2577 // LYXERR0("Identified regex format:" << a);
2579 LYXERR(Debug::FIND, "Identified Features" << features);
2582 } else if (regex_with_format) {
2583 Features info = identifyFeatures(result);
2584 for (auto it = regex_f.cbegin(); it != regex_f.cend(); ++it) {
2585 string a = it->first;
2586 bool b = it->second;
2587 if (b && ! info[a]) {
2589 LYXERR(Debug::FIND, "Missed(" << missed << " " << a <<", srclen = " << parlen );
2595 // LYXERR0("No regex formats");
2601 // Remove trailing closure of math, macros and environments, so to catch parts of them.
2602 static int identifyClosing(string & t)
2604 int open_braces = 0;
2606 LYXERR(Debug::FIND, "identifyClosing(): t now is '" << t << "'");
2607 if (regex_replace(t, t, "(.*[^\\\\])\\$" REGEX_EOS, "$1"))
2609 if (regex_replace(t, t, "(.*[^\\\\]) \\\\\\]" REGEX_EOS, "$1"))
2611 if (regex_replace(t, t, "(.*[^\\\\]) \\\\end\\{[a-zA-Z_]*\\*?\\}" REGEX_EOS, "$1"))
2613 if (regex_replace(t, t, "(.*[^\\\\])\\}" REGEX_EOS, "$1")) {
2623 MatchStringAdv::MatchStringAdv(lyx::Buffer & buf, FindAndReplaceOptions const & opt)
2624 : p_buf(&buf), p_first_buf(&buf), opt(opt)
2626 Buffer & find_buf = *theBufferList().getBuffer(FileName(to_utf8(opt.find_buf_name)), true);
2627 docstring const & ds = stringifySearchBuffer(find_buf, opt);
2628 use_regexp = lyx::to_utf8(ds).find("\\regexp{") != std::string::npos;
2629 // When using regexp, braces are hacked already by escape_for_regex()
2630 par_as_string = normalize(ds, !use_regexp);
2632 close_wildcards = 0;
2634 size_t lead_size = 0;
2635 // correct the language settings
2636 par_as_string = correctlanguagesetting(par_as_string, true, !opt.ignoreformat);
2637 if (opt.ignoreformat) {
2639 // if par_as_string_nolead were emty,
2640 // the following call to findAux will always *find* the string
2641 // in the checked data, and thus always using the slow
2642 // examining of the current text part.
2643 par_as_string_nolead = par_as_string;
2646 lead_size = identifyLeading(par_as_string);
2647 LYXERR(Debug::FIND, "Lead_size: " << lead_size);
2648 lead_as_string = par_as_string.substr(0, lead_size);
2649 par_as_string_nolead = par_as_string.substr(lead_size, par_as_string.size() - lead_size);
2653 open_braces = identifyClosing(par_as_string);
2654 identifyClosing(par_as_string_nolead);
2655 LYXERR(Debug::FIND, "Open braces: " << open_braces);
2656 LYXERR(Debug::FIND, "Built MatchStringAdv object: par_as_string = '" << par_as_string << "'");
2658 string lead_as_regexp;
2659 if (lead_size > 0) {
2660 // @todo No need to search for \regexp{} insets in leading material
2661 lead_as_regexp = escape_for_regex(par_as_string.substr(0, lead_size), !opt.ignoreformat);
2662 par_as_string = par_as_string_nolead;
2663 LYXERR(Debug::FIND, "lead_as_regexp is '" << lead_as_regexp << "'");
2664 LYXERR(Debug::FIND, "par_as_string now is '" << par_as_string << "'");
2666 par_as_string = escape_for_regex(par_as_string, !opt.ignoreformat);
2667 // Insert (.*?) before trailing closure of math, macros and environments, so to catch parts of them.
2668 LYXERR(Debug::FIND, "par_as_string now is '" << par_as_string << "'");
2670 // Insert .* before trailing '\$' ('$' has been escaped by escape_for_regex)
2671 regex_replace(par_as_string, par_as_string, "(.*[^\\\\])(\\\\\\$)\\'", "$1(.*?)$2")
2672 // Insert .* before trailing '\\\]' ('\]' has been escaped by escape_for_regex)
2673 || regex_replace(par_as_string, par_as_string, "(.*[^\\\\])( \\\\\\\\\\\\\\])\\'", "$1(.*?)$2")
2674 // Insert .* before trailing '\\end\{...}' ('\end{...}' has been escaped by escape_for_regex)
2675 || regex_replace(par_as_string, par_as_string,
2676 "(.*[^\\\\])( \\\\\\\\end\\\\\\{[a-zA-Z_]*)(\\\\\\*)?(\\\\\\})\\'", "$1(.*?)$2$3$4")
2677 // Insert .* before trailing '\}' ('}' has been escaped by escape_for_regex)
2678 || regex_replace(par_as_string, par_as_string, "(.*[^\\\\])(\\\\\\})\\'", "$1(.*?)$2")
2682 if (!opt.ignoreformat) {
2683 // Remove extra '\}' at end if not part of \{\.\}
2684 size_t lng = par_as_string.size();
2686 if (par_as_string.substr(lng-2, 2).compare("\\}") == 0) {
2688 if (par_as_string.substr(lng-6,3).compare("\\{\\") == 0)
2697 if (lng < par_as_string.size())
2698 par_as_string = par_as_string.substr(0,lng);
2701 regex_replace(par_as_string, par_as_string, "\\\\\\.", "_xxbdotxx_");
2702 // handle '.' -> '[^]', replace later as '[^\}\{\\]'
2703 regex_replace(par_as_string, par_as_string, "\\.", "[^]");
2704 // replace '[^...]' with '[^...\}\{\\]'
2705 regex_replace(par_as_string, par_as_string, "\\[\\^([^\\\\\\]]*)\\]", "_xxbrlxx_$1\\}\\{\\\\_xxbrrxx_");
2706 regex_replace(par_as_string, par_as_string, "_xxbrlxx_", "[^");
2707 regex_replace(par_as_string, par_as_string, "_xxbrrxx_", "]");
2709 regex_replace(par_as_string, par_as_string, "_xxbdotxx_", "\\.");
2712 LYXERR(Debug::FIND, "par_as_string now is '" << par_as_string << "'");
2713 LYXERR(Debug::FIND, "Open braces: " << open_braces);
2714 LYXERR(Debug::FIND, "Close .*? : " << close_wildcards);
2715 LYXERR(Debug::FIND, "Replaced text (to be used as regex): " << par_as_string);
2717 // If entered regexp must match at begin of searched string buffer
2718 // Kornel: Added parentheses to use $1 for size of the leading string
2722 // TODO: Adapt '\[12345678]' in par_as_string to acount for the first '()
2723 // Unfortunately is '\1', '\2', etc not working for strings with extra format
2724 // so the convert has no effect in that case
2725 for (int i = 8; i > 0; --i) {
2726 string orig = "\\\\" + std::to_string(i);
2727 string dest = "\\" + std::to_string(i+1);
2728 while (regex_replace(par_as_string, par_as_string, orig, dest));
2730 regexp_str = "(" + lead_as_regexp + ")" + par_as_string;
2731 regexp2_str = "(" + lead_as_regexp + ").*?" + par_as_string;
2733 LYXERR(Debug::FIND, "Setting regexp to : '" << regexp_str << "'");
2734 regexp = lyx::regex(regexp_str);
2736 LYXERR(Debug::FIND, "Setting regexp2 to: '" << regexp2_str << "'");
2737 regexp2 = lyx::regex(regexp2_str);
2742 // Count number of characters in string
2746 // \\[a-zA-Z]+ ==> 1
2747 static int computeSize(string s, int len)
2753 for (int i = 0; i < len; i += skip, count++) {
2756 if (isalpha(s[i+1])) {
2757 for (int j = 2; i+j < len; j++) {
2758 if (! isalpha(s[i+j])) {
2761 else if ((s[i+j] == '{') && s[i+j+1] == '}')
2763 else if ((s[i+j] == '{') && (i + j + 1 >= len))
2771 else if (s[i] == '{') {
2777 else if (s[i] == '-') {
2778 if (s[i+1] == '-') {
2794 MatchResult MatchStringAdv::findAux(DocIterator const & cur, int len, bool at_begin) const
2799 (opt.restr == FindAndReplaceOptions::R_ONLY_MATHS && !cur.inMathed()) )
2802 docstring docstr = stringifyFromForSearch(opt, cur, len);
2803 string str = normalize(docstr, true);
2804 if (!opt.ignoreformat) {
2805 str = correctlanguagesetting(str, false, !opt.ignoreformat);
2808 mres.match_len = -1;
2811 LYXERR(Debug::FIND, "Matching against '" << lyx::to_utf8(docstr) << "'");
2812 LYXERR(Debug::FIND, "After normalization: '" << str << "'");
2815 LYXERR(Debug::FIND, "Searching in regexp mode: at_begin=" << at_begin);
2816 regex const *p_regexp;
2817 regex_constants::match_flag_type flags;
2819 flags = regex_constants::match_continuous;
2822 flags = regex_constants::match_default;
2823 p_regexp = ®exp2;
2825 sregex_iterator re_it(str.begin(), str.end(), *p_regexp, flags);
2826 if (re_it == sregex_iterator())
2828 match_results<string::const_iterator> const & m = *re_it;
2830 if (0) { // Kornel Benko: DO NOT CHECKK
2831 // Check braces on the segment that matched the entire regexp expression,
2832 // plus the last subexpression, if a (.*?) was inserted in the constructor.
2833 if (!braces_match(m[0].first, m[0].second, open_braces))
2837 // Check braces on segments that matched all (.*?) subexpressions,
2838 // except the last "padding" one inserted by lyx.
2839 for (size_t i = 1; i < m.size() - 1; ++i)
2840 if (!braces_match(m[i].first, m[i].second, open_braces))
2843 // Exclude from the returned match length any length
2844 // due to close wildcards added at end of regexp
2845 // and also the length of the leading (e.g. '\emph{')
2847 // Whole found string, including the leading: m[0].second - m[0].first
2848 // Size of the leading string: m[1].second - m[1].first
2849 int leadingsize = 0;
2851 leadingsize = m[1].second - m[1].first;
2853 for (size_t i = 0; i < m.size(); i++) {
2854 LYXERR(Debug::FIND, "Match " << i << " is " << m[i].second - m[i].first << " long");
2856 if (close_wildcards == 0)
2857 result = m[0].second - m[0].first;
2860 result = m[m.size() - close_wildcards].first - m[0].first;
2862 size_t pos = m.position(size_t(0));
2863 // Ignore last closing characters
2864 while (result > 0) {
2865 if (str[pos+result-1] == '}')
2870 if (result > leadingsize)
2871 result -= leadingsize;
2874 mres.match_len = computeSize(str.substr(pos+leadingsize,result), result);
2875 mres.match2end = str.size() - pos - leadingsize;
2876 mres.pos = pos+leadingsize;
2880 // else !use_regexp: but all code paths above return
2881 LYXERR(Debug::FIND, "Searching in normal mode: par_as_string='"
2882 << par_as_string << "', str='" << str << "'");
2883 LYXERR(Debug::FIND, "Searching in normal mode: lead_as_string='"
2884 << lead_as_string << "', par_as_string_nolead='"
2885 << par_as_string_nolead << "'");
2888 LYXERR(Debug::FIND, "size=" << par_as_string.size()
2889 << ", substr='" << str.substr(0, par_as_string.size()) << "'");
2890 if (str.substr(0, par_as_string.size()) == par_as_string) {
2891 mres.match_len = par_as_string.size();
2892 mres.match2end = str.size();
2897 size_t pos = str.find(par_as_string_nolead);
2898 if (pos != string::npos) {
2899 mres.match_len = par_as_string.size();
2900 mres.match2end = str.size() - pos;
2909 MatchResult MatchStringAdv::operator()(DocIterator const & cur, int len, bool at_begin) const
2911 MatchResult mres = findAux(cur, len, at_begin);
2912 int res = mres.match_len;
2914 "res=" << res << ", at_begin=" << at_begin
2915 << ", matchword=" << opt.matchword
2916 << ", inTexted=" << cur.inTexted());
2917 if (res == 0 || !at_begin || !opt.matchword || !cur.inTexted())
2919 if ((len > 0) && (res < len)) {
2923 Paragraph const & par = cur.paragraph();
2924 bool ws_left = (cur.pos() > 0)
2925 ? par.isWordSeparator(cur.pos() - 1)
2927 bool ws_right = (cur.pos() + len < par.size())
2928 ? par.isWordSeparator(cur.pos() + len)
2931 "cur.pos()=" << cur.pos() << ", res=" << res
2932 << ", separ: " << ws_left << ", " << ws_right
2935 if (ws_left && ws_right) {
2936 // Check for word separators inside the found 'word'
2937 for (int i = 0; i < len; i++) {
2938 if (par.isWordSeparator(cur.pos() + i)) {
2950 string MatchStringAdv::normalize(docstring const & s, bool hack_braces) const
2953 if (! opt.casesensitive)
2954 t = lyx::to_utf8(lowercase(s));
2956 t = lyx::to_utf8(s);
2957 // Remove \n at begin
2958 while (!t.empty() && t[0] == '\n')
2961 while (!t.empty() && t[t.size() - 1] == '\n')
2962 t = t.substr(0, t.size() - 1);
2964 // Handle all other '\n'
2965 while ((pos = t.find("\n")) != string::npos) {
2966 if (pos > 1 && t[pos-1] == '\\' && t[pos-2] == '\\' ) {
2968 if (isAlnumASCII(t[pos+1])) {
2969 t.replace(pos-2, 3, " ");
2972 t.replace(pos-2, 3, "");
2975 else if (!isAlnumASCII(t[pos+1]) || !isAlnumASCII(t[pos-1])) {
2976 // '\n' adjacent to non-alpha-numerics, discard
2977 t.replace(pos, 1, "");
2980 // Replace all other \n with spaces
2981 t.replace(pos, 1, " ");
2984 // Remove stale empty \emph{}, \textbf{} and similar blocks from latexify
2985 // Kornel: Added textsl, textsf, textit, texttt and noun
2986 // + allow to seach for colored text too
2987 LYXERR(Debug::FIND, "Removing stale empty \\emph{}, \\textbf{}, \\*section{} macros from: " << t);
2988 while (regex_replace(t, t, "\\\\(emph|noun|text(bf|sl|sf|it|tt)|(u|uu)line|(s|x)out|uwave)(\\{(\\{\\})?\\})+", ""))
2989 LYXERR(Debug::FIND, " further removing stale empty \\emph{}, \\textbf{} macros from: " << t);
2990 while (regex_replace(t, t, "\\\\((sub)?(((sub)?section)|paragraph)|part)\\*?(\\{(\\{\\})?\\})+", ""))
2991 LYXERR(Debug::FIND, " further removing stale empty \\emph{}, \\textbf{} macros from: " << t);
2993 while (regex_replace(t, t, "\\\\(foreignlanguage|textcolor|item)\\{[a-z]+\\}(\\{(\\{\\})?\\})+", ""));
2994 // FIXME - check what preceeds the brace
2996 if (opt.ignoreformat)
2997 while (regex_replace(t, t, "\\{", "_x_<")
2998 || regex_replace(t, t, "\\}", "_x_>"))
2999 LYXERR(Debug::FIND, "After {} replacement: '" << t << "'");
3001 while (regex_replace(t, t, "\\\\\\{", "_x_<")
3002 || regex_replace(t, t, "\\\\\\}", "_x_>"))
3003 LYXERR(Debug::FIND, "After {} replacement: '" << t << "'");
3010 docstring stringifyFromCursor(DocIterator const & cur, int len)
3012 LYXERR(Debug::FIND, "Stringifying with len=" << len << " from cursor at pos: " << cur);
3013 if (cur.inTexted()) {
3014 Paragraph const & par = cur.paragraph();
3015 // TODO what about searching beyond/across paragraph breaks ?
3016 // TODO Try adding a AS_STR_INSERTS as last arg
3017 pos_type end = ( len == -1 || cur.pos() + len > int(par.size()) ) ?
3018 int(par.size()) : cur.pos() + len;
3019 // OutputParams runparams(&cur.buffer()->params().encoding());
3020 OutputParams runparams(encodings.fromLyXName("utf8"));
3021 runparams.nice = true;
3022 runparams.flavor = OutputParams::XETEX;
3023 runparams.linelen = 10000; //lyxrc.plaintext_linelen;
3024 // No side effect of file copying and image conversion
3025 runparams.dryrun = true;
3026 runparams.for_search = true;
3027 LYXERR(Debug::FIND, "Stringifying with cur: "
3028 << cur << ", from pos: " << cur.pos() << ", end: " << end);
3029 return par.asString(cur.pos(), end,
3030 AS_STR_INSETS | AS_STR_SKIPDELETE | AS_STR_PLAINTEXT,
3032 } else if (cur.inMathed()) {
3033 CursorSlice cs = cur.top();
3034 MathData md = cs.cell();
3035 MathData::const_iterator it_end =
3036 (( len == -1 || cs.pos() + len > int(md.size()))
3038 : md.begin() + cs.pos() + len );
3040 for (MathData::const_iterator it = md.begin() + cs.pos();
3043 docstring s = asString(md2);
3044 LYXERR(Debug::FIND, "Stringified math: '" << s << "'");
3047 LYXERR(Debug::FIND, "Don't know how to stringify from here: " << cur);
3052 /** Computes the LaTeX export of buf starting from cur and ending len positions
3053 * after cur, if len is positive, or at the paragraph or innermost inset end
3056 docstring latexifyFromCursor(DocIterator const & cur, int len)
3058 LYXERR(Debug::FIND, "Latexifying with len=" << len << " from cursor at pos: " << cur);
3059 LYXERR(Debug::FIND, " with cur.lastpost=" << cur.lastpos() << ", cur.lastrow="
3060 << cur.lastrow() << ", cur.lastcol=" << cur.lastcol());
3061 Buffer const & buf = *cur.buffer();
3063 odocstringstream ods;
3065 //OutputParams runparams(&buf.params().encoding());
3066 OutputParams runparams(encodings.fromLyXName("utf8"));
3067 runparams.nice = false;
3068 runparams.flavor = OutputParams::XETEX;
3069 runparams.linelen = 8000; //lyxrc.plaintext_linelen;
3070 // No side effect of file copying and image conversion
3071 runparams.dryrun = true;
3072 runparams.for_search = true;
3074 if (cur.inTexted()) {
3075 // @TODO what about searching beyond/across paragraph breaks ?
3076 pos_type endpos = cur.paragraph().size();
3077 if (len != -1 && endpos > cur.pos() + len)
3078 endpos = cur.pos() + len;
3079 TeXOnePar(buf, *cur.innerText(), cur.pit(), os, runparams,
3080 string(), cur.pos(), endpos);
3081 string s = lyx::to_utf8(ods.str());
3082 LYXERR(Debug::FIND, "Latexified +modified text: '" << s << "'");
3083 return(lyx::from_utf8(s));
3084 } else if (cur.inMathed()) {
3085 // Retrieve the math environment type, and add '$' or '$[' or others (\begin{equation}) accordingly
3086 for (int s = cur.depth() - 1; s >= 0; --s) {
3087 CursorSlice const & cs = cur[s];
3088 if (cs.asInsetMath() && cs.asInsetMath()->asHullInset()) {
3090 cs.asInsetMath()->asHullInset()->header_write(ws);
3095 CursorSlice const & cs = cur.top();
3096 MathData md = cs.cell();
3097 MathData::const_iterator it_end =
3098 ((len == -1 || cs.pos() + len > int(md.size()))
3100 : md.begin() + cs.pos() + len);
3102 for (MathData::const_iterator it = md.begin() + cs.pos();
3106 ods << asString(md2);
3107 // Retrieve the math environment type, and add '$' or '$]'
3108 // or others (\end{equation}) accordingly
3109 for (int s = cur.depth() - 1; s >= 0; --s) {
3110 CursorSlice const & cs2 = cur[s];
3111 InsetMath * inset = cs2.asInsetMath();
3112 if (inset && inset->asHullInset()) {
3114 inset->asHullInset()->footer_write(ws);
3118 LYXERR(Debug::FIND, "Latexified math: '" << lyx::to_utf8(ods.str()) << "'");
3120 LYXERR(Debug::FIND, "Don't know how to stringify from here: " << cur);
3126 /** Finalize an advanced find operation, advancing the cursor to the innermost
3127 ** position that matches, plus computing the length of the matching text to
3130 int findAdvFinalize(DocIterator & cur, MatchStringAdv const & match)
3132 // Search the foremost position that matches (avoids find of entire math
3133 // inset when match at start of it)
3135 DocIterator old_cur(cur.buffer());
3137 LYXERR(Debug::FIND, "Forwarding one step (searching for innermost match)");
3141 } while (cur && cur.depth() > d && match(cur).match_len > 0);
3143 int max_match = match(cur).match_len; /* match valid only if not searching whole words */
3144 if (max_match <= 0) return 0;
3145 LYXERR(Debug::FIND, "Ok");
3147 // Compute the match length
3149 if (cur.pos() + len > cur.lastpos())
3151 if (match.opt.matchword) {
3152 LYXERR(Debug::FIND, "verifying unmatch with len = " << len);
3153 while (cur.pos() + len <= cur.lastpos() && match(cur, len).match_len <= 0) {
3155 LYXERR(Debug::FIND, "verifying unmatch with len = " << len);
3157 // Length of matched text (different from len param)
3158 int old_match = match(cur, len).match_len;
3162 // Greedy behaviour while matching regexps
3163 while ((new_match = match(cur, len + 1).match_len) > old_match) {
3165 old_match = new_match;
3166 LYXERR(Debug::FIND, "verifying match with len = " << len);
3173 int maxl = cur.lastpos() - cur.pos();
3174 // Greedy behaviour while matching regexps
3175 while (maxl > minl) {
3176 int actual_match = match(cur, len).match_len;
3177 if (actual_match >= max_match) {
3178 // actual_match > max_match _can_ happen,
3179 // if the search area splits
3180 // some following word so that the regex
3181 // (e.g. 'r.*r\b' matches 'r' from the middle of the
3183 // This means, the len value is too big
3185 len = (int)((maxl + minl)/2);
3188 // (actual_match < max_match)
3190 len = (int)((maxl + minl)/2);
3194 // Search for real start of matched characters
3199 } while (cur.depth() > old_cur.depth()); /* Skip inner insets */
3200 if (cur.depth() < old_cur.depth()) {
3202 LYXERR0("cur.depth() < old_cur.depth(), this should never happen");
3205 if (cur.pos() != old_cur.pos()) {
3206 // OK, forwarded 1 pos in actual inset
3207 actual_match = match(cur, len-1).match_len;
3208 if (actual_match == max_match) {
3209 // Ha, got it! The shorter selection has the same match length
3214 // OK, the shorter selection matches less chars, revert to previous value
3220 LYXERR0("cur.pos() == old_cur.pos(), this should never happen");
3221 actual_match = match(cur, len).match_len;
3222 if (actual_match == max_match)
3232 int findForwardAdv(DocIterator & cur, MatchStringAdv & match)
3236 while (!theApp()->longOperationCancelled() && cur) {
3237 LYXERR(Debug::FIND, "findForwardAdv() cur: " << cur);
3238 MatchResult mres = match(cur, -1, false);
3239 int match_len = mres.match_len;
3240 LYXERR(Debug::FIND, "match_len: " << match_len);
3241 if ((mres.pos > 100000) || (mres.match2end > 100000) || (match_len > 100000)) {
3242 LYXERR0("BIG LENGTHS: " << mres.pos << ", " << match_len << ", " << mres.match2end);
3245 if (match_len > 0) {
3246 // Try to find the begin of searched string
3247 int increment = mres.pos/2;
3248 while (mres.pos > 5 && (increment > 5)) {
3249 DocIterator old_cur = cur;
3250 for (int i = 0; i < increment && cur; cur.forwardPos(), i++) {
3252 if (! cur || (cur.pit() > old_cur.pit())) {
3253 // Are we outside of the paragraph?
3254 // This can happen if moving past some UTF8-encoded chars
3259 MatchResult mres2 = match(cur, -1, false);
3260 if ((mres2.match2end < mres.match2end) ||
3261 (mres2.match_len < mres.match_len)) {
3268 if (increment > mres.pos/2)
3269 increment = mres.pos/2;
3273 int match_len_zero_count = 0;
3274 for (int i = 0; !theApp()->longOperationCancelled() && cur; cur.forwardPos()) {
3276 int remaining_len = match(cur, -1, false).match_len;
3277 if (remaining_len <= 0) {
3278 // Apparently the searched string is not in the remaining part
3285 LYXERR(Debug::FIND, "Advancing cur: " << cur);
3286 int match_len3 = match(cur, 1).match_len;
3289 int match_len2 = match(cur).match_len;
3290 LYXERR(Debug::FIND, "match_len2: " << match_len2);
3291 if (match_len2 > 0) {
3292 // Sometimes in finalize we understand it wasn't a match
3293 // and we need to continue the outest loop
3294 int len = findAdvFinalize(cur, match);
3299 if (match_len2 >= 0) {
3300 if (match_len2 == 0)
3301 match_len_zero_count++;
3303 match_len_zero_count = 0;
3306 if (++match_len_zero_count > 3) {
3307 LYXERR(Debug::FIND, "match_len2_zero_count: " << match_len_zero_count << ", match_len was " << match_len);
3308 match_len_zero_count = 0;
3316 if (match_len >= 0 && cur.pit() < cur.lastpit()) {
3317 LYXERR(Debug::FIND, "Advancing par: cur=" << cur);
3320 // This should exit nested insets, if any, or otherwise undefine the currsor.
3321 cur.pos() = cur.lastpos();
3322 LYXERR(Debug::FIND, "Advancing pos: cur=" << cur);
3330 /// Find the most backward consecutive match within same paragraph while searching backwards.
3331 int findMostBackwards(DocIterator & cur, MatchStringAdv const & match)
3333 DocIterator cur_begin = doc_iterator_begin(cur.buffer());
3334 DocIterator tmp_cur = cur;
3335 int len = findAdvFinalize(tmp_cur, match);
3336 Inset & inset = cur.inset();
3337 for (; cur != cur_begin; cur.backwardPos()) {
3338 LYXERR(Debug::FIND, "findMostBackwards(): cur=" << cur);
3339 DocIterator new_cur = cur;
3340 new_cur.backwardPos();
3341 if (new_cur == cur || &new_cur.inset() != &inset || !match(new_cur).match_len)
3343 int new_len = findAdvFinalize(new_cur, match);
3348 LYXERR(Debug::FIND, "findMostBackwards(): exiting with cur=" << cur);
3354 int findBackwardsAdv(DocIterator & cur, MatchStringAdv & match)
3358 // Backup of original position
3359 DocIterator cur_begin = doc_iterator_begin(cur.buffer());
3360 if (cur == cur_begin)
3363 DocIterator cur_orig(cur);
3364 bool pit_changed = false;
3367 bool found_match = (match(cur, -1, false).match_len > 0);
3371 cur.pos() = cur.lastpos();
3373 cur.pos() = cur_orig.pos();
3374 LYXERR(Debug::FIND, "findBackAdv2: cur: " << cur);
3375 DocIterator cur_prev_iter;
3377 found_match = (match(cur).match_len > 0);
3378 LYXERR(Debug::FIND, "findBackAdv3: found_match="
3379 << found_match << ", cur: " << cur);
3381 return findMostBackwards(cur, match);
3383 // Stop if begin of document reached
3384 if (cur == cur_begin)
3386 cur_prev_iter = cur;
3390 if (cur == cur_begin)
3397 } while (!theApp()->longOperationCancelled());
3405 docstring stringifyFromForSearch(FindAndReplaceOptions const & opt,
3406 DocIterator const & cur, int len)
3408 if (cur.pos() < 0 || cur.pos() > cur.lastpos())
3410 if (!opt.ignoreformat)
3411 return latexifyFromCursor(cur, len);
3413 return stringifyFromCursor(cur, len);
3417 FindAndReplaceOptions::FindAndReplaceOptions(
3418 docstring const & find_buf_name, bool casesensitive,
3419 bool matchword, bool forward, bool expandmacros, bool ignoreformat,
3420 docstring const & repl_buf_name, bool keep_case,
3421 SearchScope scope, SearchRestriction restr)
3422 : find_buf_name(find_buf_name), casesensitive(casesensitive), matchword(matchword),
3423 forward(forward), expandmacros(expandmacros), ignoreformat(ignoreformat),
3424 repl_buf_name(repl_buf_name), keep_case(keep_case), scope(scope), restr(restr)
3432 /** Check if 'len' letters following cursor are all non-lowercase */
3433 static bool allNonLowercase(Cursor const & cur, int len)
3435 pos_type beg_pos = cur.selectionBegin().pos();
3436 pos_type end_pos = cur.selectionBegin().pos() + len;
3437 if (len > cur.lastpos() + 1 - beg_pos) {
3438 LYXERR(Debug::FIND, "This should not happen, more debug needed");
3439 len = cur.lastpos() + 1 - beg_pos;
3440 end_pos = beg_pos + len;
3442 for (pos_type pos = beg_pos; pos != end_pos; ++pos)
3443 if (isLowerCase(cur.paragraph().getChar(pos)))
3449 /** Check if first letter is upper case and second one is lower case */
3450 static bool firstUppercase(Cursor const & cur)
3453 pos_type pos = cur.selectionBegin().pos();
3454 if (pos >= cur.lastpos() - 1) {
3455 LYXERR(Debug::FIND, "No upper-case at cur: " << cur);
3458 ch1 = cur.paragraph().getChar(pos);
3459 ch2 = cur.paragraph().getChar(pos + 1);
3460 bool result = isUpperCase(ch1) && isLowerCase(ch2);
3461 LYXERR(Debug::FIND, "firstUppercase(): "
3462 << "ch1=" << ch1 << "(" << char(ch1) << "), ch2="
3463 << ch2 << "(" << char(ch2) << ")"
3464 << ", result=" << result << ", cur=" << cur);
3469 /** Make first letter of supplied buffer upper-case, and the rest lower-case.
3471 ** \fixme What to do with possible further paragraphs in replace buffer ?
3473 static void changeFirstCase(Buffer & buffer, TextCase first_case, TextCase others_case)
3475 ParagraphList::iterator pit = buffer.paragraphs().begin();
3476 LASSERT(pit->size() >= 1, /**/);
3477 pos_type right = pos_type(1);
3478 pit->changeCase(buffer.params(), pos_type(0), right, first_case);
3479 right = pit->size();
3480 pit->changeCase(buffer.params(), pos_type(1), right, others_case);
3486 static void findAdvReplace(BufferView * bv, FindAndReplaceOptions const & opt, MatchStringAdv & matchAdv)
3488 Cursor & cur = bv->cursor();
3489 if (opt.repl_buf_name == docstring()
3490 || theBufferList().getBuffer(FileName(to_utf8(opt.repl_buf_name)), true) == 0
3491 || theBufferList().getBuffer(FileName(to_utf8(opt.find_buf_name)), true) == 0)
3494 DocIterator sel_beg = cur.selectionBegin();
3495 DocIterator sel_end = cur.selectionEnd();
3496 if (&sel_beg.inset() != &sel_end.inset()
3497 || sel_beg.pit() != sel_end.pit()
3498 || sel_beg.idx() != sel_end.idx())
3500 int sel_len = sel_end.pos() - sel_beg.pos();
3501 LYXERR(Debug::FIND, "sel_beg: " << sel_beg << ", sel_end: " << sel_end
3502 << ", sel_len: " << sel_len << endl);
3505 LASSERT(sel_len > 0, return);
3507 if (!matchAdv(sel_beg, sel_len).match_len)
3510 // Build a copy of the replace buffer, adapted to the KeepCase option
3511 Buffer & repl_buffer_orig = *theBufferList().getBuffer(FileName(to_utf8(opt.repl_buf_name)), true);
3513 repl_buffer_orig.write(oss);
3514 string lyx = oss.str();
3515 Buffer repl_buffer("", false);
3516 repl_buffer.setUnnamed(true);
3517 LASSERT(repl_buffer.readString(lyx), return);
3518 if (opt.keep_case && sel_len >= 2) {
3519 LYXERR(Debug::FIND, "keep_case true: cur.pos()=" << cur.pos() << ", sel_len=" << sel_len);
3520 if (cur.inTexted()) {
3521 if (firstUppercase(cur))
3522 changeFirstCase(repl_buffer, text_uppercase, text_lowercase);
3523 else if (allNonLowercase(cur, sel_len))
3524 changeFirstCase(repl_buffer, text_uppercase, text_uppercase);
3527 cap::cutSelection(cur, false);
3528 if (cur.inTexted()) {
3529 repl_buffer.changeLanguage(
3530 repl_buffer.language(),
3531 cur.getFont().language());
3532 LYXERR(Debug::FIND, "Replacing by pasteParagraphList()ing repl_buffer");
3533 LYXERR(Debug::FIND, "Before pasteParagraphList() cur=" << cur << endl);
3534 cap::pasteParagraphList(cur, repl_buffer.paragraphs(),
3535 repl_buffer.params().documentClassPtr(),
3536 bv->buffer().errorList("Paste"));
3537 LYXERR(Debug::FIND, "After pasteParagraphList() cur=" << cur << endl);
3538 sel_len = repl_buffer.paragraphs().begin()->size();
3539 } else if (cur.inMathed()) {
3540 odocstringstream ods;
3542 // OutputParams runparams(&repl_buffer.params().encoding());
3543 OutputParams runparams(encodings.fromLyXName("utf8"));
3544 runparams.nice = false;
3545 runparams.flavor = OutputParams::XETEX;
3546 runparams.linelen = 8000; //lyxrc.plaintext_linelen;
3547 runparams.dryrun = true;
3548 TeXOnePar(repl_buffer, repl_buffer.text(), 0, os, runparams);
3549 //repl_buffer.getSourceCode(ods, 0, repl_buffer.paragraphs().size(), false);
3550 docstring repl_latex = ods.str();
3551 LYXERR(Debug::FIND, "Latexified replace_buffer: '" << repl_latex << "'");
3553 (void)regex_replace(to_utf8(repl_latex), s, "\\$(.*)\\$", "$1");
3554 (void)regex_replace(s, s, "\\\\\\[(.*)\\\\\\]", "$1");
3555 repl_latex = from_utf8(s);
3556 LYXERR(Debug::FIND, "Replacing by insert()ing latex: '" << repl_latex << "' cur=" << cur << " with depth=" << cur.depth());
3557 MathData ar(cur.buffer());
3558 asArray(repl_latex, ar, Parse::NORMAL);
3560 sel_len = ar.size();
3561 LYXERR(Debug::FIND, "After insert() cur=" << cur << " with depth: " << cur.depth() << " and len: " << sel_len);
3563 if (cur.pos() >= sel_len)
3564 cur.pos() -= sel_len;
3567 LYXERR(Debug::FIND, "After pos adj cur=" << cur << " with depth: " << cur.depth() << " and len: " << sel_len);
3568 bv->putSelectionAt(DocIterator(cur), sel_len, !opt.forward);
3569 bv->processUpdateFlags(Update::Force);
3573 /// Perform a FindAdv operation.
3574 bool findAdv(BufferView * bv, FindAndReplaceOptions const & opt)
3579 // e.g., when invoking word-findadv from mini-buffer wither with
3580 // wrong options syntax or before ever opening advanced F&R pane
3581 if (theBufferList().getBuffer(FileName(to_utf8(opt.find_buf_name)), true) == 0)
3585 MatchStringAdv matchAdv(bv->buffer(), opt);
3586 int length = bv->cursor().selectionEnd().pos() - bv->cursor().selectionBegin().pos();
3588 bv->putSelectionAt(bv->cursor().selectionBegin(), length, !opt.forward);
3589 findAdvReplace(bv, opt, matchAdv);
3592 match_len = findForwardAdv(cur, matchAdv);
3594 match_len = findBackwardsAdv(cur, matchAdv);
3596 // This may only be raised by lyx::regex()
3597 bv->message(_("Invalid regular expression!"));
3601 if (match_len == 0) {
3602 bv->message(_("Match not found!"));
3606 bv->message(_("Match found!"));
3608 LYXERR(Debug::FIND, "Putting selection at cur=" << cur << " with len: " << match_len);
3609 bv->putSelectionAt(cur, match_len, !opt.forward);
3615 ostringstream & operator<<(ostringstream & os, FindAndReplaceOptions const & opt)
3617 os << to_utf8(opt.find_buf_name) << "\nEOSS\n"
3618 << opt.casesensitive << ' '
3619 << opt.matchword << ' '
3620 << opt.forward << ' '
3621 << opt.expandmacros << ' '
3622 << opt.ignoreformat << ' '
3623 << to_utf8(opt.repl_buf_name) << "\nEOSS\n"
3624 << opt.keep_case << ' '
3625 << int(opt.scope) << ' '
3628 LYXERR(Debug::FIND, "built: " << os.str());
3634 istringstream & operator>>(istringstream & is, FindAndReplaceOptions & opt)
3636 LYXERR(Debug::FIND, "parsing");
3640 while (line != "EOSS") {
3644 if (is.eof()) // Tolerate malformed request
3648 LYXERR(Debug::FIND, "file_buf_name: '" << s << "'");
3649 opt.find_buf_name = from_utf8(s);
3650 is >> opt.casesensitive >> opt.matchword >> opt.forward >> opt.expandmacros >> opt.ignoreformat;
3651 is.get(); // Waste space before replace string
3654 while (line != "EOSS") {
3658 if (is.eof()) // Tolerate malformed request
3662 LYXERR(Debug::FIND, "repl_buf_name: '" << s << "'");
3663 opt.repl_buf_name = from_utf8(s);
3664 is >> opt.keep_case;
3667 opt.scope = FindAndReplaceOptions::SearchScope(i);
3669 opt.restr = FindAndReplaceOptions::SearchRestriction(i);
3671 LYXERR(Debug::FIND, "parsed: " << opt.casesensitive << ' ' << opt.matchword << ' ' << opt.forward << ' '
3672 << opt.expandmacros << ' ' << opt.ignoreformat << ' ' << opt.keep_case << ' '
3673 << opt.scope << ' ' << opt.restr);