3 * This file is part of LyX, the document processor.
4 * License details can be found in the file COPYING.
6 * \author Lars Gullik Bjønnes
9 * \author Alfredo Braunstein
10 * \author Tommaso Cucinotta
12 * Full author contact details are available in file CREDITS.
20 #include "buffer_funcs.h"
21 #include "BufferList.h"
22 #include "BufferParams.h"
23 #include "BufferView.h"
26 #include "CutAndPaste.h"
27 #include "FuncRequest.h"
29 #include "output_latex.h"
30 #include "OutputParams.h"
31 #include "Paragraph.h"
32 #include "ParIterator.h"
36 #include "frontends/Application.h"
37 #include "frontends/alert.h"
39 #include "mathed/InsetMath.h"
40 #include "mathed/InsetMathGrid.h"
41 #include "mathed/InsetMathHull.h"
42 #include "mathed/MathData.h"
43 #include "mathed/MathStream.h"
44 #include "mathed/MathSupport.h"
46 #include "support/convert.h"
47 #include "support/debug.h"
48 #include "support/docstream.h"
49 #include "support/FileName.h"
50 #include "support/gettext.h"
51 #include "support/lassert.h"
52 #include "support/lstrings.h"
54 #include "support/regex.h"
58 using namespace lyx::support;
64 bool parse_bool(docstring & howto)
69 howto = split(howto, var, ' ');
74 class MatchString : public binary_function<Paragraph, pos_type, int>
77 MatchString(docstring const & str, bool cs, bool mw)
78 : str(str), case_sens(cs), whole_words(mw)
81 // returns true if the specified string is at the specified position
82 // del specifies whether deleted strings in ct mode will be considered
83 int operator()(Paragraph const & par, pos_type pos, bool del = true) const
85 return par.find(str, case_sens, whole_words, pos, del);
93 // match whole words only
98 int findForward(DocIterator & cur, MatchString const & match,
101 for (; cur; cur.forwardChar())
102 if (cur.inTexted()) {
103 int len = match(cur.paragraph(), cur.pos(), find_del);
111 int findBackwards(DocIterator & cur, MatchString const & match,
112 bool find_del = true)
116 if (cur.inTexted()) {
117 int len = match(cur.paragraph(), cur.pos(), find_del);
126 bool searchAllowed(docstring const & str)
129 frontend::Alert::error(_("Search error"), _("Search string is empty"));
136 bool findOne(BufferView * bv, docstring const & searchstr,
137 bool case_sens, bool whole, bool forward,
138 bool find_del = true, bool check_wrap = false)
140 if (!searchAllowed(searchstr))
143 DocIterator cur = forward
144 ? bv->cursor().selectionEnd()
145 : bv->cursor().selectionBegin();
147 MatchString const match(searchstr, case_sens, whole);
149 int match_len = forward
150 ? findForward(cur, match, find_del)
151 : findBackwards(cur, match, find_del);
154 bv->putSelectionAt(cur, match_len, !forward);
155 else if (check_wrap) {
156 DocIterator cur_orig(bv->cursor());
159 q = _("End of file reached while searching forward.\n"
160 "Continue searching from the beginning?");
162 q = _("Beginning of file reached while searching backward.\n"
163 "Continue searching from the end?");
164 int wrap_answer = frontend::Alert::prompt(_("Wrap search?"),
165 q, 0, 1, _("&Yes"), _("&No"));
166 if (wrap_answer == 0) {
168 bv->cursor().clear();
169 bv->cursor().push_back(CursorSlice(bv->buffer().inset()));
171 bv->cursor().setCursor(doc_iterator_end(&bv->buffer()));
172 bv->cursor().backwardPos();
174 bv->clearSelection();
175 if (findOne(bv, searchstr, case_sens, whole, forward, find_del, false))
178 bv->cursor().setCursor(cur_orig);
182 return match_len > 0;
186 int replaceAll(BufferView * bv,
187 docstring const & searchstr, docstring const & replacestr,
188 bool case_sens, bool whole)
190 Buffer & buf = bv->buffer();
192 if (!searchAllowed(searchstr) || buf.isReadonly())
195 DocIterator cur_orig(bv->cursor());
197 MatchString const match(searchstr, case_sens, whole);
200 int const rsize = replacestr.size();
201 int const ssize = searchstr.size();
204 cur.setCursor(doc_iterator_begin(&buf));
205 int match_len = findForward(cur, match, false);
206 while (match_len > 0) {
207 // Backup current cursor position and font.
208 pos_type const pos = cur.pos();
209 Font const font = cur.paragraph().getFontSettings(buf.params(), pos);
211 int striked = ssize -
212 cur.paragraph().eraseChars(pos, pos + match_len,
213 buf.params().track_changes);
214 cur.paragraph().insert(pos, replacestr, font,
215 Change(buf.params().track_changes
217 : Change::UNCHANGED));
218 for (int i = 0; i < rsize + striked; ++i)
221 match_len = findForward(cur, match, false);
224 bv->putSelectionAt(doc_iterator_begin(&buf), 0, false);
226 cur_orig.fixIfBroken();
227 bv->setCursor(cur_orig);
233 // the idea here is that we are going to replace the string that
234 // is selected IF it is the search string.
235 // if there is a selection, but it is not the search string, then
236 // we basically ignore it. (FIXME We ought to replace only within
238 // if there is no selection, then:
239 // (i) if some search string has been provided, then we find it.
240 // (think of how the dialog works when you hit "replace" the
242 // (ii) if no search string has been provided, then we treat the
243 // word the cursor is in as the search string. (why? i have no
244 // idea.) but this only works in text?
246 // returns the number of replacements made (one, if any) and
247 // whether anything at all was done.
248 pair<bool, int> replaceOne(BufferView * bv, docstring searchstr,
249 docstring const & replacestr, bool case_sens,
250 bool whole, bool forward, bool findnext)
252 Cursor & cur = bv->cursor();
254 if (!cur.selection()) {
255 // no selection, non-empty search string: find it
256 if (!searchstr.empty()) {
257 found = findOne(bv, searchstr, case_sens, whole, forward, true, findnext);
258 return make_pair(found, 0);
260 // empty search string
263 return make_pair(false, 0);
264 // select current word and treat it as the search string.
265 // This causes a minor bug as undo will restore this selection,
266 // which the user did not create (#8986).
267 cur.innerText()->selectWord(cur, WHOLE_WORD);
268 searchstr = cur.selectionAsString(false);
271 // if we still don't have a search string, report the error
273 if (!searchAllowed(searchstr))
274 return make_pair(false, 0);
276 bool have_selection = cur.selection();
277 docstring const selected = cur.selectionAsString(false);
280 ? searchstr == selected
281 : compare_no_case(searchstr, selected) == 0;
283 // no selection or current selection is not search word:
284 // just find the search word
285 if (!have_selection || !match) {
286 found = findOne(bv, searchstr, case_sens, whole, forward, true, findnext);
287 return make_pair(found, 0);
290 // we're now actually ready to replace. if the buffer is
291 // read-only, we can't, though.
292 if (bv->buffer().isReadonly())
293 return make_pair(false, 0);
295 cap::replaceSelectionWithString(cur, replacestr);
297 cur.pos() += replacestr.length();
298 LASSERT(cur.pos() <= cur.lastpos(),
299 cur.pos() = cur.lastpos());
302 findOne(bv, searchstr, case_sens, whole, forward, false, findnext);
304 return make_pair(true, 1);
310 docstring const find2string(docstring const & search,
311 bool casesensitive, bool matchword, bool forward)
315 << int(casesensitive) << ' '
316 << int(matchword) << ' '
322 docstring const replace2string(docstring const & replace,
323 docstring const & search,
324 bool casesensitive, bool matchword,
325 bool all, bool forward, bool findnext)
328 ss << replace << '\n'
330 << int(casesensitive) << ' '
331 << int(matchword) << ' '
333 << int(forward) << ' '
339 bool lyxfind(BufferView * bv, FuncRequest const & ev)
341 if (!bv || ev.action() != LFUN_WORD_FIND)
344 //lyxerr << "find called, cmd: " << ev << endl;
346 // data is of the form
348 // <casesensitive> <matchword> <forward>"
350 docstring howto = split(ev.argument(), search, '\n');
352 bool casesensitive = parse_bool(howto);
353 bool matchword = parse_bool(howto);
354 bool forward = parse_bool(howto);
356 return findOne(bv, search, casesensitive, matchword, forward, true, true);
360 bool lyxreplace(BufferView * bv,
361 FuncRequest const & ev, bool has_deleted)
363 if (!bv || ev.action() != LFUN_WORD_REPLACE)
366 // data is of the form
369 // <casesensitive> <matchword> <all> <forward> <findnext>"
372 docstring howto = split(ev.argument(), rplc, '\n');
373 howto = split(howto, search, '\n');
375 bool casesensitive = parse_bool(howto);
376 bool matchword = parse_bool(howto);
377 bool all = parse_bool(howto);
378 bool forward = parse_bool(howto);
379 bool findnext = howto.empty() ? true : parse_bool(howto);
384 int replace_count = 0;
386 replace_count = replaceAll(bv, search, rplc, casesensitive, matchword);
387 update = replace_count > 0;
390 replaceOne(bv, search, rplc, casesensitive, matchword, forward, findnext);
392 replace_count = rv.second;
395 Buffer const & buf = bv->buffer();
397 // emit message signal.
398 buf.message(_("String not found."));
400 if (replace_count == 0) {
401 buf.message(_("String found."));
402 } else if (replace_count == 1) {
403 buf.message(_("String has been replaced."));
405 docstring const str =
406 bformat(_("%1$d strings have been replaced."), replace_count);
410 } else if (findnext) {
411 // if we have deleted characters, we do not replace at all, but
412 // rather search for the next occurence
413 if (findOne(bv, search, casesensitive, matchword, forward, true, findnext))
416 bv->message(_("String not found."));
422 bool findNextChange(BufferView * bv, Cursor & cur, bool const check_wrap)
424 for (; cur; cur.forwardPos())
425 if (cur.inTexted() && cur.paragraph().isChanged(cur.pos()))
429 DocIterator cur_orig(bv->cursor());
430 docstring q = _("End of file reached while searching forward.\n"
431 "Continue searching from the beginning?");
432 int wrap_answer = frontend::Alert::prompt(_("Wrap search?"),
433 q, 0, 1, _("&Yes"), _("&No"));
434 if (wrap_answer == 0) {
435 bv->cursor().clear();
436 bv->cursor().push_back(CursorSlice(bv->buffer().inset()));
437 bv->clearSelection();
438 cur.setCursor(bv->cursor().selectionBegin());
439 if (findNextChange(bv, cur, false))
442 bv->cursor().setCursor(cur_orig);
449 bool findPreviousChange(BufferView * bv, Cursor & cur, bool const check_wrap)
451 for (cur.backwardPos(); cur; cur.backwardPos()) {
452 if (cur.inTexted() && cur.paragraph().isChanged(cur.pos()))
457 DocIterator cur_orig(bv->cursor());
458 docstring q = _("Beginning of file reached while searching backward.\n"
459 "Continue searching from the end?");
460 int wrap_answer = frontend::Alert::prompt(_("Wrap search?"),
461 q, 0, 1, _("&Yes"), _("&No"));
462 if (wrap_answer == 0) {
463 bv->cursor().setCursor(doc_iterator_end(&bv->buffer()));
464 bv->cursor().backwardPos();
465 bv->clearSelection();
466 cur.setCursor(bv->cursor().selectionBegin());
467 if (findPreviousChange(bv, cur, false))
470 bv->cursor().setCursor(cur_orig);
477 bool selectChange(Cursor & cur, bool forward)
479 if (!cur.inTexted() || !cur.paragraph().isChanged(cur.pos()))
481 Change ch = cur.paragraph().lookupChange(cur.pos());
483 CursorSlice tip1 = cur.top();
484 for (; tip1.pit() < tip1.lastpit() || tip1.pos() < tip1.lastpos(); tip1.forwardPos()) {
485 Change ch2 = tip1.paragraph().lookupChange(tip1.pos());
486 if (!ch2.isSimilarTo(ch))
489 CursorSlice tip2 = cur.top();
490 for (; tip2.pit() > 0 || tip2.pos() > 0;) {
492 Change ch2 = tip2.paragraph().lookupChange(tip2.pos());
493 if (!ch2.isSimilarTo(ch)) {
494 // take a step forward to correctly set the selection
502 cur.bv().mouseSetCursor(cur, false);
504 cur.bv().mouseSetCursor(cur, true);
512 bool findChange(BufferView * bv, bool forward)
515 cur.setCursor(forward ? bv->cursor().selectionEnd()
516 : bv->cursor().selectionBegin());
517 forward ? findNextChange(bv, cur, true) : findPreviousChange(bv, cur, true);
518 return selectChange(cur, forward);
523 bool findNextChange(BufferView * bv)
525 return findChange(bv, true);
529 bool findPreviousChange(BufferView * bv)
531 return findChange(bv, false);
538 typedef vector<pair<string, string> > Escapes;
540 /// A map of symbols and their escaped equivalent needed within a regex.
541 /// @note Beware of order
542 Escapes const & get_regexp_escapes()
544 typedef std::pair<std::string, std::string> P;
546 static Escapes escape_map;
547 if (escape_map.empty()) {
548 escape_map.push_back(P("$", "_x_$"));
549 escape_map.push_back(P("{", "_x_{"));
550 escape_map.push_back(P("}", "_x_}"));
551 escape_map.push_back(P("[", "_x_["));
552 escape_map.push_back(P("]", "_x_]"));
553 escape_map.push_back(P("(", "_x_("));
554 escape_map.push_back(P(")", "_x_)"));
555 escape_map.push_back(P("+", "_x_+"));
556 escape_map.push_back(P("*", "_x_*"));
557 escape_map.push_back(P(".", "_x_."));
558 escape_map.push_back(P("\\", "(?:\\\\|\\\\backslash)"));
559 escape_map.push_back(P("~", "(?:\\\\textasciitilde|\\\\sim)"));
560 escape_map.push_back(P("^", "(?:\\^|\\\\textasciicircum\\{\\}|\\\\textasciicircum|\\\\mathcircumflex)"));
561 escape_map.push_back(P("_x_", "\\"));
566 /// A map of lyx escaped strings and their unescaped equivalent.
567 Escapes const & get_lyx_unescapes()
569 typedef std::pair<std::string, std::string> P;
571 static Escapes escape_map;
572 if (escape_map.empty()) {
573 escape_map.push_back(P("\\%", "%"));
574 escape_map.push_back(P("\\mathcircumflex ", "^"));
575 escape_map.push_back(P("\\mathcircumflex", "^"));
576 escape_map.push_back(P("\\backslash ", "\\"));
577 escape_map.push_back(P("\\backslash", "\\"));
578 escape_map.push_back(P("\\\\{", "_x_<"));
579 escape_map.push_back(P("\\\\}", "_x_>"));
580 escape_map.push_back(P("\\sim ", "~"));
581 escape_map.push_back(P("\\sim", "~"));
586 /// A map of escapes turning a regexp matching text to one matching latex.
587 Escapes const & get_regexp_latex_escapes()
589 typedef std::pair<std::string, std::string> P;
591 static Escapes escape_map;
592 if (escape_map.empty()) {
593 escape_map.push_back(P("\\\\", "(?:\\\\\\\\|\\\\backslash|\\\\textbackslash\\{\\}|\\\\textbackslash)"));
594 escape_map.push_back(P("(<?!\\\\\\\\textbackslash)\\{", "\\\\\\{"));
595 escape_map.push_back(P("(<?!\\\\\\\\textbackslash\\\\\\{)\\}", "\\\\\\}"));
596 escape_map.push_back(P("\\[", "\\{\\[\\}"));
597 escape_map.push_back(P("\\]", "\\{\\]\\}"));
598 escape_map.push_back(P("\\^", "(?:\\^|\\\\textasciicircum\\{\\}|\\\\textasciicircum|\\\\mathcircumflex)"));
599 escape_map.push_back(P("%", "\\\\\\%"));
604 /** @todo Probably the maps need to be migrated to regexps, in order to distinguish if
605 ** the found occurrence were escaped.
607 string apply_escapes(string s, Escapes const & escape_map)
609 LYXERR(Debug::FIND, "Escaping: '" << s << "'");
610 Escapes::const_iterator it;
611 for (it = escape_map.begin(); it != escape_map.end(); ++it) {
612 // LYXERR(Debug::FIND, "Escaping " << it->first << " as " << it->second);
613 unsigned int pos = 0;
614 while (pos < s.length() && (pos = s.find(it->first, pos)) < s.length()) {
615 s.replace(pos, it->first.length(), it->second);
616 LYXERR(Debug::FIND, "After escape: " << s);
617 pos += it->second.length();
618 // LYXERR(Debug::FIND, "pos: " << pos);
621 LYXERR(Debug::FIND, "Escaped : '" << s << "'");
626 /// Within \regexp{} apply get_lyx_unescapes() only (i.e., preserve regexp semantics of the string),
627 /// while outside apply get_lyx_unescapes()+get_regexp_escapes().
628 /// If match_latex is true, then apply regexp_latex_escapes() to \regexp{} contents as well.
629 string escape_for_regex(string s, bool match_latex)
632 while (pos < s.size()) {
633 size_t new_pos = s.find("\\regexp{", pos);
634 if (new_pos == string::npos)
636 LYXERR(Debug::FIND, "new_pos: " << new_pos);
637 string t = apply_escapes(s.substr(pos, new_pos - pos), get_lyx_unescapes());
638 LYXERR(Debug::FIND, "t [lyx]: " << t);
639 t = apply_escapes(t, get_regexp_escapes());
640 LYXERR(Debug::FIND, "t [rxp]: " << t);
641 s.replace(pos, new_pos - pos, t);
642 new_pos = pos + t.size();
643 LYXERR(Debug::FIND, "Regexp after escaping: " << s);
644 LYXERR(Debug::FIND, "new_pos: " << new_pos);
645 if (new_pos == s.size())
647 // Might fail if \\endregexp{} is preceeded by unexpected stuff (weird escapes)
648 size_t end_pos = s.find("\\endregexp{}}", new_pos + 8);
649 LYXERR(Debug::FIND, "end_pos: " << end_pos);
650 t = s.substr(new_pos + 8, end_pos - (new_pos + 8));
651 LYXERR(Debug::FIND, "t in regexp : " << t);
652 t = apply_escapes(t, get_lyx_unescapes());
653 LYXERR(Debug::FIND, "t in regexp [lyx]: " << t);
655 t = apply_escapes(t, get_regexp_latex_escapes());
656 LYXERR(Debug::FIND, "t in regexp [ltx]: " << t);
658 if (end_pos == s.size()) {
659 s.replace(new_pos, end_pos - new_pos, t);
660 LYXERR(Debug::FIND, "Regexp after \\regexp{} removal: " << s);
663 s.replace(new_pos, end_pos + 13 - new_pos, t);
664 LYXERR(Debug::FIND, "Regexp after \\regexp{...\\endregexp{}} removal: " << s);
665 pos = new_pos + t.size();
666 LYXERR(Debug::FIND, "pos: " << pos);
672 /// Wrapper for lyx::regex_replace with simpler interface
673 bool regex_replace(string const & s, string & t, string const & searchstr,
674 string const & replacestr)
676 lyx::regex e(searchstr, regex_constants::ECMAScript);
678 ostream_iterator<char, char> it(oss);
679 lyx::regex_replace(it, s.begin(), s.end(), e, replacestr);
680 // tolerate t and s be references to the same variable
681 bool rv = (s != oss.str());
687 /** Checks if supplied string segment is well-formed from the standpoint of matching open-closed braces.
689 ** Verify that closed braces exactly match open braces. This avoids that, for example,
690 ** \frac{.*}{x} matches \frac{x+\frac{y}{x}}{z} with .* being 'x+\frac{y'.
693 ** Number of open braces that must remain open at the end for the verification to succeed.
695 bool braces_match(string::const_iterator const & beg,
696 string::const_iterator const & end,
700 string::const_iterator it = beg;
701 LYXERR(Debug::FIND, "Checking " << unmatched << " unmatched braces in '" << string(beg, end) << "'");
702 for (; it != end; ++it) {
703 // Skip escaped braces in the count
708 } else if (*it == '{') {
710 } else if (*it == '}') {
711 if (open_pars == 0) {
712 LYXERR(Debug::FIND, "Found unmatched closed brace");
718 if (open_pars != unmatched) {
719 LYXERR(Debug::FIND, "Found " << open_pars
720 << " instead of " << unmatched
721 << " unmatched open braces at the end of count");
724 LYXERR(Debug::FIND, "Braces match as expected");
729 /** The class performing a match between a position in the document and the FindAdvOptions.
731 class MatchStringAdv {
733 MatchStringAdv(lyx::Buffer & buf, FindAndReplaceOptions const & opt);
735 /** Tests if text starting at the supplied position matches with the one provided to the MatchStringAdv
736 ** constructor as opt.search, under the opt.* options settings.
739 ** If set, then match is searched only against beginning of text starting at cur.
740 ** If unset, then match is searched anywhere in text starting at cur.
743 ** The length of the matching text, or zero if no match was found.
745 int operator()(DocIterator const & cur, int len = -1, bool at_begin = true) const;
750 /// first buffer on which search was started
751 lyx::Buffer * const p_first_buf;
753 FindAndReplaceOptions const & opt;
756 /// Auxiliary find method (does not account for opt.matchword)
757 int findAux(DocIterator const & cur, int len = -1, bool at_begin = true) const;
759 /** Normalize a stringified or latexified LyX paragraph.
763 ** <li>if search is not casesensitive, then lowercase the string;
764 ** <li>remove any newline at begin or end of the string;
765 ** <li>replace any newline in the middle of the string with a simple space;
766 ** <li>remove stale empty styles and environments, like \emph{} and \textbf{}.
769 ** @todo Normalization should also expand macros, if the corresponding
770 ** search option was checked.
772 string normalize(docstring const & s, bool hack_braces) const;
773 // normalized string to search
774 string par_as_string;
775 // regular expression to use for searching
777 // same as regexp, but prefixed with a ".*"
779 // leading format material as string
780 string lead_as_string;
781 // par_as_string after removal of lead_as_string
782 string par_as_string_nolead;
783 // unmatched open braces in the search string/regexp
785 // number of (.*?) subexpressions added at end of search regexp for closing
786 // environments, math mode, styles, etc...
788 // Are we searching with regular expressions ?
793 static docstring buffer_to_latex(Buffer & buffer)
795 OutputParams runparams(&buffer.params().encoding());
796 odocstringstream ods;
798 runparams.nice = true;
799 runparams.flavor = OutputParams::LATEX;
800 runparams.linelen = 80; //lyxrc.plaintext_linelen;
801 // No side effect of file copying and image conversion
802 runparams.dryrun = true;
803 runparams.for_search = true;
804 pit_type const endpit = buffer.paragraphs().size();
805 for (pit_type pit = 0; pit != endpit; ++pit) {
806 TeXOnePar(buffer, buffer.text(), pit, os, runparams);
807 LYXERR(Debug::FIND, "searchString up to here: " << ods.str());
813 static docstring stringifySearchBuffer(Buffer & buffer, FindAndReplaceOptions const & opt)
816 if (!opt.ignoreformat) {
817 str = buffer_to_latex(buffer);
819 OutputParams runparams(&buffer.params().encoding());
820 runparams.nice = true;
821 runparams.flavor = OutputParams::LATEX;
822 runparams.linelen = 100000; //lyxrc.plaintext_linelen;
823 runparams.dryrun = true;
824 runparams.for_search = true;
825 for (pos_type pit = pos_type(0); pit < (pos_type)buffer.paragraphs().size(); ++pit) {
826 Paragraph const & par = buffer.paragraphs().at(pit);
827 LYXERR(Debug::FIND, "Adding to search string: '"
828 << par.asString(pos_type(0), par.size(),
829 AS_STR_INSETS | AS_STR_SKIPDELETE | AS_STR_PLAINTEXT,
832 str += par.asString(pos_type(0), par.size(),
833 AS_STR_INSETS | AS_STR_SKIPDELETE | AS_STR_PLAINTEXT,
841 /// Return separation pos between the leading material and the rest
842 static size_t identifyLeading(string const & s)
845 // @TODO Support \item[text]
846 // Kornel: Added textsl, textsf, textit, texttt and noun
847 // + allow to seach for colored text too
848 while (regex_replace(t, t, REGEX_BOS "\\\\(((emph|noun|text(bf|sl|sf|it|tt))|((textcolor|foreignlanguage)\\{[a-z]+\\})|(u|uu)line|(s|x)out|uwave)|((sub)?(((sub)?section)|paragraph)|part)\\*?)\\{", "")
849 || regex_replace(t, t, REGEX_BOS "\\$", "")
850 || regex_replace(t, t, REGEX_BOS "\\\\\\[ ", "")
851 || regex_replace(t, t, REGEX_BOS "\\\\item ", "")
852 || regex_replace(t, t, REGEX_BOS "\\\\begin\\{[a-zA-Z_]*\\*?\\} ", ""))
854 LYXERR(Debug::FIND, " after removing leading $, \\[ , \\emph{, \\textbf{, etc.: '" << t << "'");
859 * Given a latexified string, retrieve some handled features
860 * The features of the regex will later be compared with the features
861 * of the searched text. If the regex features are not a
862 * subset of the analized, then, in not format ignoring search
863 * we can early stop the search in the relevant inset.
865 typedef map<string, bool> Features;
867 static Features identifyFeatures(string const & s)
869 static regex const feature("\\\\(([a-z]+(\\{([a-z]+)\\}|\\*)?))\\{");
870 static regex const valid("^(((emph|noun|text(bf|sl|sf|it|tt)|(textcolor|foreignlanguage)\\{[a-z]+\\})|item |(u|uu)line|(s|x)out|uwave)|((sub)?(((sub)?section)|paragraph)|part)\\*?)$");
875 for (sregex_iterator it(s.begin(), s.end(), feature), end; it != end; ++it) {
878 if (sub.str(1).compare("regexp") == 0) {
882 string token = sub.str(1);
884 if (regex_match(token, sub2, valid)) {
892 if (sub.str(1).compare("endregexp") == 0) {
902 * Faster search for the related closing parenthesis
904 static int findclosing(string p, int start, int end)
908 int lastunclosed = start-1;
909 for (int i = start; i < end; i += 1 + skip) {
913 if (c == '\\') skip = 1;
919 if (depth == 0) return(i);
923 return(0 - lastunclosed);
927 * Discard any info for char sizes for now.
929 static string removefontinfo(string par)
931 // Remove fontsizes, inputencoding
934 static regex const sizescodings("(\\\\(footnotesize|tiny|scriptsize|small|large|Large|LARGE|huge|Huge|inputencoding\\{[^\\}]*})(\b|(\\{(\\{\\})?\\})?(%\\n)?))");
935 for (sregex_iterator it(par.begin(), par.end(), sizescodings), end; it != end; ++it) {
937 string token = sub.str(1);
938 fpars.push_back(token);
940 for (list<string>::const_iterator li = fpars.begin(); li != fpars.end(); ++li) {
944 int ic; // Position of closing part e.g. '}'
945 while ((f = par.find(token, firstpos)) >= 0) {
946 size_t ssize = token.length();
947 int parcount = 0; // how many '{}' can be removed
954 // here '{' preceedes
955 ic = findclosing(par, f + ssize, par.length());
958 else if ((f == 2) && (par[f-2] == '{')) {
959 if ((ic < 0) || (par[ic+1] == '}'))
963 } else while (f > parcount + 1) {
964 if (par[f-2-parcount] != '{')
967 if ((ic > 0) && (par[ic+parcount] != '}'))
975 ic = par.length() - parcount;
976 par = par.substr(0, f-parcount) + par.substr(f+ssize, ic+parcount-f-ssize) + par.substr(ic+parcount);
992 /*LangInfo(LangInfo &orig) :
994 maxoffset(orig.maxoffset),
995 search(orig.search) {valid = Invalid;}
997 LangInfo(string par, string search1 = "", int start = 0, int end = -1)
1005 _tokenstart = start;
1006 if (end > int(par.length())) {
1007 maxoffset = par.length();
1012 maxoffset = par.length();
1013 if (!search1.empty())
1015 regexPossible = false;
1016 size_t tmpreg = par.find("\\regexp{", _tokenstart);
1017 if (tmpreg != string::npos) {
1018 if (tmpreg < maxoffset)
1019 regexPossible = true;
1022 bool nextInfo(); // of the same type, from the last start in the same reagion
1023 bool firstInfo(string search, int datastart);
1024 void setDataEnd(int value);
1025 void setDataStart(int value);
1026 int getDataStart() { return _dataStart;};
1027 string name() { return _search;};
1028 string lasttoken() { if (valid == Valid) return _foundtoken; else return "";};
1029 int getStart() { return _tokenstart;};
1030 int getTokenEnd() { return _tokenend;};
1031 int getEnd() { return _dataEnd;};
1032 bool isValid() { return (valid == Valid); };
1033 void process(ostringstream &os);
1034 void output(ostringstream &os, int);
1035 void addIntervall(int upper);
1036 void addIntervall(int low, int upper); /* if explicit */
1037 void handleParentheses(int lastpos);
1038 string show(int lastpos);
1039 bool discardParethesizedInBlock(int start);
1052 int actualdeptindex;
1053 int ignoreIntervalls[10][2];
1056 void adaptIgnoringParts(bool useOld = false);
1057 int nextNotIgored(int start);
1058 bool discarSuperfluousParentheses(int start);
1061 void LangInfo::setDataEnd(int dataend)
1063 if (dataend < _tokenend) {
1064 _dataEnd = _tokenend;
1065 // cout << "Wrong data start, too low\n";
1067 else if (size_t(dataend) > par.length()) {
1068 // cout << "Wrong data start, too high\n";
1069 _dataEnd = par.length();
1076 * Try to reuse the ignoring parts from parent
1079 void LangInfo::adaptIgnoringParts(bool useOld)
1081 if (useOld && (ignoreidx >= 0)) {
1083 for (idx = 0; idx <= ignoreidx; idx++) {
1084 if (ignoreIntervalls[idx][1] >= _dataStart) {
1085 if (ignoreIntervalls[idx][0] < _dataStart)
1086 ignoreIntervalls[idx][0] = _dataStart;
1091 for (int i = 0; i <= ignoreidx - idx; i++) {
1092 ignoreIntervalls[i][0] = ignoreIntervalls[idx+i][0];
1093 ignoreIntervalls[i][1] = ignoreIntervalls[idx+i][1];
1100 ignoreIntervalls[ignoreidx][0] = _dataStart;
1101 if ((par[_dataStart] == '{') && (par[_dataStart+1] == '}')) {
1102 // First candidates to be ignored
1103 ignoreIntervalls[ignoreidx][1] = _dataStart+2;
1106 ignoreIntervalls[ignoreidx][1] = _dataStart;
1110 void LangInfo::setDataStart(int datastart)
1112 bool reUse = true; /* Reuse previous ignoring intervalls */
1113 if (datastart < _tokenend) {
1114 _dataStart = _tokenend;
1115 // cout << "Wrong data start, too low\n";
1118 else if (size_t(datastart) > par.length()) {
1119 // cout << "Wrong data start, too high\n";
1120 _dataStart = par.length();
1124 _dataStart = datastart;
1125 //cout << "found entry at " << _tokenstart << "\n";
1126 actualdeptindex = 1; /* == Number of open brases */
1127 depts[0] = _dataStart;
1129 depts[1] = _dataStart;
1130 adaptIgnoringParts(reUse);
1134 * Keep the list of actual opened parentheses actual
1135 * (e.g. depth == 4 means there are 4 '{' not processed yet)
1137 void LangInfo::handleParentheses(int lastpos)
1140 for (int i = depts[actualdeptindex]; i < lastpos; i+= 1 + skip) {
1144 if (c == '\\') skip = 1;
1145 else if (c == '{') {
1147 depts[actualdeptindex] = i+1;
1148 closes[actualdeptindex] = -1;
1150 else if (c == '}') {
1151 if (actualdeptindex <= 0) {
1152 LYXERR(Debug::FIND, "ERROR ERROR ERROR"); /* should never happen! */
1155 closes[actualdeptindex] = i+1;
1163 * Expand the region of ignored parts of the input latex string
1164 * The region is only relevant in output()
1166 void LangInfo::addIntervall(int low, int upper)
1169 if (low == upper) return;
1170 for (idx = ignoreidx+1; idx > 0; --idx) {
1171 if (low > ignoreIntervalls[idx-1][1]) {
1175 if (idx > ignoreidx) {
1176 ignoreIntervalls[idx][0] = low;
1177 ignoreIntervalls[idx][1] = upper;
1180 // Expand only if one of the new bounds is inside the interwall
1182 if (((low <= ignoreIntervalls[idx][1]) && (upper >= ignoreIntervalls[idx][1])) ||
1183 ((low <= ignoreIntervalls[idx][0]) && (upper >= ignoreIntervalls[idx][0]))) {
1184 if (low < ignoreIntervalls[idx][0])
1185 ignoreIntervalls[idx][0] = low;
1186 if (upper > ignoreIntervalls[idx][1])
1187 ignoreIntervalls[idx][1] = upper;
1190 ignoreidx = idx; /* because upper is in all cases bigger */
1193 void LangInfo::addIntervall(int upper)
1196 if (actualdeptindex >= 0)
1197 low = depts[actualdeptindex]; /* the position of last unclosed '{' */
1199 LYXERR(Debug::FIND, "ERROR ERROR ERROR2");
1202 addIntervall(low, upper);
1205 string LangInfo::show(int lastpos)
1209 os << par.substr(_tokenstart, _tokenend - _tokenstart);
1211 for (int i = _dataStart; i < lastpos;) {
1212 if (i <= ignoreIntervalls[idx][0]) {
1213 os << par.substr(i, ignoreIntervalls[idx][0] - i);
1214 i = ignoreIntervalls[idx][1];
1217 if (idx > ignoreidx) {
1218 os << par.substr(i, lastpos-i);
1222 for (int i = actualdeptindex; i > 0; --i)
1227 int LangInfo::nextNotIgored(int start)
1229 int idx = 0; /* int intervalls */
1230 for (idx = 0; idx <= ignoreidx; idx++) {
1231 if (start < ignoreIntervalls[idx][0])
1233 if (start < ignoreIntervalls[idx][1])
1234 start = ignoreIntervalls[idx][1];
1239 void LangInfo::output(ostringstream &os, int lastpos)
1241 // get number of chars to output
1242 int idx = 0; /* int intervalls */
1244 for (int i = _dataStart; i < lastpos;) {
1245 if (i <= ignoreIntervalls[idx][0]) {
1246 count += ignoreIntervalls[idx][0] - i;
1247 i = ignoreIntervalls[idx][1];
1250 if (idx > ignoreidx) {
1255 //cout << "Number of output chars would be " << count + actualdeptindex << "\n";
1257 // Now the acual data
1258 os << par.substr(_tokenstart, _tokenend - _tokenstart);
1260 for (int i = _dataStart; i < lastpos;) {
1261 if (i <= ignoreIntervalls[idx][0]) {
1262 os << par.substr(i, ignoreIntervalls[idx][0] - i);
1263 handleParentheses(ignoreIntervalls[idx][0]);
1264 i = ignoreIntervalls[idx][1];
1267 if (idx > ignoreidx) {
1269 os << par.substr(i, lastpos-i);
1274 for (int i = actualdeptindex; i > 0; --i)
1277 handleParentheses(lastpos);
1280 bool LangInfo::nextInfo()
1282 int start = _tokenstart;
1284 // cout << par << "\n";
1285 if (valid == Invalid)
1286 _dataEnd = _tokenstart;
1287 else if (valid == LastValid)
1289 // cout << "Start search at " << _tokenclose << " for \"" << _search << "\n";
1290 size_t foundstart = par.find(_search, _dataEnd);
1291 if (foundstart == string::npos) {
1294 return false; // not found
1296 if (foundstart >= maxoffset)
1299 int closelang = findclosing(par, start + _search.length(), maxoffset);
1302 if (size_t(closelang) >= maxoffset)
1304 if (par[closelang] != '}')
1307 _foundtoken = par.substr(start, closelang - start + 2);
1308 _tokenstart = start;
1309 _tokenend = closelang+2;
1310 setDataStart(_tokenend);
1311 closelang = findclosing(par, _dataStart, maxoffset);
1312 if (closelang < 0) {
1313 _dataEnd = maxoffset;
1317 _dataEnd = closelang;
1323 bool LangInfo::firstInfo(string search1, int datastart)
1325 if (!search1.empty()) {
1326 if (_search.compare(search1) != 0) {
1327 _tokenstart = datastart;
1333 _tokenstart = datastart;
1340 bool LangInfo::discardParethesizedInBlock(int start)
1344 bool isempty = true;
1346 size_t regex_start, regex_end;
1347 if (regexPossible) {
1348 regex_start = par.find("\\regexp{", start);
1349 if (regex_start == string::npos)
1350 regexPossible = false;
1351 else if (regex_start >= size_t(_dataEnd))
1352 regexPossible = false;
1354 regex_end = par.find("\\endregexp{}}", regex_start + 8);
1355 if (regex_end == string::npos)
1356 regexPossible = false;
1357 else if (regex_end > size_t(_dataEnd))
1358 regexPossible = false;
1361 if (!regexPossible) {
1362 regex_start = _dataEnd;
1363 regex_end = _dataEnd;
1365 for (int i = start; i < _dataEnd; i += 1+skip) {
1369 if (size_t(i) == regex_start) {
1370 // 12 is correct, even if the length of "\\endregexp{}}" is 13
1371 skip = regex_end + 12 - i;
1377 else if (c == '{') {
1379 addIntervall(i, i+1);
1380 // cout << "discard '{' at " << i << "\n";
1386 else if (c == '}') {
1388 addIntervall(i, i+1);
1389 // cout << "discard '}' at " << i << "\n";
1401 bool LangInfo::discarSuperfluousParentheses(int start)
1403 start = nextNotIgored(start);
1404 while ((par[start] == '{') && (start < _dataEnd)) {
1405 discardParethesizedInBlock(start);
1406 start = nextNotIgored(start+1);
1408 // It is empty if (par[start] == '}')
1409 return ((start >= _dataEnd) || (par[start] == '}'));
1412 void LangInfo::process(ostringstream &os)
1414 LangInfo color(*this);
1415 (void) color.firstInfo("\\textcolor{", _dataStart);
1416 while (color.isValid() && (color.getStart() < _dataEnd)) {
1417 bool isEmpty = discarSuperfluousParentheses(color.getDataStart());
1419 // it is empty, so ignore and go to next color
1420 addIntervall(color.getStart(), color.getEnd()+1);
1421 int start = color.getEnd()+1;
1422 discarSuperfluousParentheses(start);
1425 if (par[color.getStart()-1] != '{') {
1426 // We are not at start
1427 output(os, color.getStart());
1428 addIntervall(color.getStart());
1430 // Check if color empty
1431 output(os, color.getEnd()+1);
1432 addIntervall(color.getEnd()+1);
1433 discarSuperfluousParentheses(color.getEnd()+1);
1438 if (color.valid == LastValid)
1439 start = color.getEnd()+1;
1441 // Apparently nothing output so far
1444 discarSuperfluousParentheses(start);
1445 output(os, _dataEnd);
1449 * Called only if the par starts with lang spec
1452 string splitForColors(string par) {
1454 LangInfo firstLanguage(par, "\\foreignlanguage{");
1455 if (firstLanguage.firstInfo("\\foreignlanguage{", 0)) {
1456 LangInfo nextLanguage(firstLanguage);
1457 if (nextLanguage.firstInfo("\\foreignlanguage{", firstLanguage.getTokenEnd())) {
1458 firstLanguage.setDataEnd(nextLanguage.getStart());
1461 int oldend = firstLanguage.getEnd();
1462 firstLanguage.setDataEnd(par.length());
1463 // discard old closing
1464 firstLanguage.addIntervall(oldend, oldend+1);
1465 for (int i = 1; i < firstLanguage.getEnd(); i++) {
1467 firstLanguage.discardParethesizedInBlock(i);
1472 firstLanguage.process(os);
1473 // For the case, that the first language ends unexpected
1474 int lastgapstart = firstLanguage.getEnd()+1;
1475 while (nextLanguage.isValid()) {
1476 nextLanguage.process(os);
1477 // To handle the gap, we need the end of last languuage to start of next
1478 int gapstart = nextLanguage.getEnd()+1;
1479 if (gapstart > lastgapstart)
1480 lastgapstart = gapstart;
1482 nextLanguage.nextInfo();
1483 if (nextLanguage.isValid())
1484 gapend = nextLanguage.getStart();
1486 gapend = par.length();
1487 // Now handle the gap, if there is one
1488 if (gapend > gapstart) {
1489 // cout << "Gap found, size = " << gapend - gapstart << "\n";
1490 firstLanguage.setDataEnd(gapend);
1491 firstLanguage.setDataStart(gapstart);
1492 firstLanguage.process(os);
1493 lastgapstart = gapend+1;
1496 if (size_t(lastgapstart) < par.length()) {
1497 int lastgapend = par.length();
1498 // cout << "Found last gap, size = " << lastgapend - lastgapstart << "\n";
1499 firstLanguage.setDataEnd(lastgapend);
1500 firstLanguage.setDataStart(lastgapstart);
1501 firstLanguage.process(os);
1504 string s = os.str();
1509 * Try to unify the language specs in the latexified text.
1510 * Resulting modified string is set to "", if
1511 * the searched tex does not contain all the features in the search pattern
1513 static string correctlanguagesetting(string par, bool from_regex, bool withformat)
1515 static Features regex_f;
1516 static int missed = 0;
1517 static bool regex_with_format = false;
1519 int parlen = par.length();
1521 while ((parlen > 0) && (par[parlen-1] == '\n')) {
1524 string result = removefontinfo(par.substr(0, parlen));
1525 LYXERR(Debug::FIND, "input: \"" << result, << "\n");
1526 result = splitForColors(result);
1527 LYXERR(Debug::FIND, "After split: \"" << result << "\"");
1528 bool handle_colors = false;
1532 regex_f = identifyFeatures(result);
1533 string features = "";
1534 for (auto it = regex_f.cbegin(); it != regex_f.cend(); ++it) {
1535 string a = it->first;
1536 regex_with_format = true;
1537 if (a.compare(0,10,"textcolor{") == 0)
1538 handle_colors = true;
1539 features += " " + a;
1540 // LYXERR0("Identified regex format:" << a);
1542 LYXERR(Debug::FIND, "Identified Features" << features);
1545 } else if (regex_with_format) {
1546 Features info = identifyFeatures(result);
1547 for (auto it = regex_f.cbegin(); it != regex_f.cend(); ++it) {
1548 string a = it->first;
1549 bool b = it->second;
1550 if (b && ! info[a]) {
1552 LYXERR(Debug::FIND, "Missed(" << missed << " " << a <<", srclen = " << parlen );
1555 else if (a.compare(0,10,"textcolor{") == 0)
1556 handle_colors = true;
1560 // LYXERR0("No regex formats");
1562 // remove possible disturbing macros
1563 while (regex_replace(result, result, "\\\\(noindent )", ""))
1565 // Either not found language spec,or is single and closed spec or empty
1568 static regex const parreg("((\\n)?\\\\[a-z]+par)\\{");
1572 for (sregex_iterator it(result.begin(), result.end(), parreg), end; it != end; ++it) {
1574 string token = sub.str(1);
1575 pars.push_back(token);
1577 for (list<string>::const_iterator li = pars.begin(); li != pars.end(); ++li) {
1579 int ti = result.find(token);
1580 int tokensize = token.size() + 1;
1582 int tc = findclosing(result, ti + tokensize, result.size());
1584 result = result.substr(0, ti) + result.substr(ti + tokensize, tc - ti -tokensize) + result.substr(tc+1);
1588 if (handle_colors) {
1589 while (regex_replace(result, result, "(\\{\\\\textcolor\\{[a-z]+\\}\\{)\\s*\\{\\}\\s*", "$1"));
1590 while (regex_replace(result, result, "\\{\\\\textcolor\\{[a-z]+\\}\\{\\s*\\}\\s*\\}", ""));
1596 // Remove trailing closure of math, macros and environments, so to catch parts of them.
1597 static int identifyClosing(string & t)
1599 int open_braces = 0;
1601 LYXERR(Debug::FIND, "identifyClosing(): t now is '" << t << "'");
1602 if (regex_replace(t, t, "(.*[^\\\\])\\$" REGEX_EOS, "$1"))
1604 if (regex_replace(t, t, "(.*[^\\\\]) \\\\\\]" REGEX_EOS, "$1"))
1606 if (regex_replace(t, t, "(.*[^\\\\]) \\\\end\\{[a-zA-Z_]*\\*?\\}" REGEX_EOS, "$1"))
1608 if (regex_replace(t, t, "(.*[^\\\\])\\}" REGEX_EOS, "$1")) {
1618 MatchStringAdv::MatchStringAdv(lyx::Buffer & buf, FindAndReplaceOptions const & opt)
1619 : p_buf(&buf), p_first_buf(&buf), opt(opt)
1621 Buffer & find_buf = *theBufferList().getBuffer(FileName(to_utf8(opt.find_buf_name)), true);
1622 docstring const & ds = stringifySearchBuffer(find_buf, opt);
1623 use_regexp = lyx::to_utf8(ds).find("\\regexp{") != std::string::npos;
1624 // When using regexp, braces are hacked already by escape_for_regex()
1625 par_as_string = normalize(ds, !use_regexp);
1627 close_wildcards = 0;
1629 size_t lead_size = 0;
1630 // correct the language settings
1631 par_as_string = correctlanguagesetting(par_as_string, true, !opt.ignoreformat);
1632 if (opt.ignoreformat) {
1634 // if par_as_string_nolead were emty,
1635 // the following call to findAux will always *find* the string
1636 // in the checked data, and thus always using the slow
1637 // examining of the current text part.
1638 par_as_string_nolead = par_as_string;
1641 lead_size = identifyLeading(par_as_string);
1642 LYXERR(Debug::FIND, "Lead_size: " << lead_size);
1643 lead_as_string = par_as_string.substr(0, lead_size);
1644 par_as_string_nolead = par_as_string.substr(lead_size, par_as_string.size() - lead_size);
1648 open_braces = identifyClosing(par_as_string);
1649 identifyClosing(par_as_string_nolead);
1650 LYXERR(Debug::FIND, "Open braces: " << open_braces);
1651 LYXERR(Debug::FIND, "Built MatchStringAdv object: par_as_string = '" << par_as_string << "'");
1653 string lead_as_regexp;
1654 if (lead_size > 0) {
1655 // @todo No need to search for \regexp{} insets in leading material
1656 lead_as_regexp = escape_for_regex(par_as_string.substr(0, lead_size), !opt.ignoreformat);
1657 par_as_string = par_as_string_nolead;
1658 LYXERR(Debug::FIND, "lead_as_regexp is '" << lead_as_regexp << "'");
1659 LYXERR(Debug::FIND, "par_as_string now is '" << par_as_string << "'");
1661 par_as_string = escape_for_regex(par_as_string, !opt.ignoreformat);
1662 // Insert (.*?) before trailing closure of math, macros and environments, so to catch parts of them.
1663 LYXERR(Debug::FIND, "par_as_string now is '" << par_as_string << "'");
1665 // Insert .* before trailing '\$' ('$' has been escaped by escape_for_regex)
1666 regex_replace(par_as_string, par_as_string, "(.*[^\\\\])(\\\\\\$)\\'", "$1(.*?)$2")
1667 // Insert .* before trailing '\\\]' ('\]' has been escaped by escape_for_regex)
1668 || regex_replace(par_as_string, par_as_string, "(.*[^\\\\])( \\\\\\\\\\\\\\])\\'", "$1(.*?)$2")
1669 // Insert .* before trailing '\\end\{...}' ('\end{...}' has been escaped by escape_for_regex)
1670 || regex_replace(par_as_string, par_as_string,
1671 "(.*[^\\\\])( \\\\\\\\end\\\\\\{[a-zA-Z_]*)(\\\\\\*)?(\\\\\\})\\'", "$1(.*?)$2$3$4")
1672 // Insert .* before trailing '\}' ('}' has been escaped by escape_for_regex)
1673 || regex_replace(par_as_string, par_as_string, "(.*[^\\\\])(\\\\\\})\\'", "$1(.*?)$2")
1677 if (!opt.ignoreformat) {
1678 // Remove extra '\}' at end
1679 while ( regex_replace(par_as_string, par_as_string, "(.*)\\\\}$", "$1")) {
1683 regex_replace(par_as_string, par_as_string, "\\\\\\.", "_xxbdotxx_");
1684 // handle '.' -> '[^]', replace later as '[^\}\{\\]'
1685 regex_replace(par_as_string, par_as_string, "\\.", "[^]");
1686 // replace '[^...]' with '[^...\}\{\\]'
1687 regex_replace(par_as_string, par_as_string, "\\[\\^([^\\\\\\]]*)\\]", "_xxbrlxx_$1\\}\\{\\\\_xxbrrxx_");
1688 regex_replace(par_as_string, par_as_string, "_xxbrlxx_", "[^");
1689 regex_replace(par_as_string, par_as_string, "_xxbrrxx_", "]");
1691 regex_replace(par_as_string, par_as_string, "_xxbdotxx_", "\\.");
1693 LYXERR(Debug::FIND, "par_as_string now is '" << par_as_string << "'");
1694 LYXERR(Debug::FIND, "Open braces: " << open_braces);
1695 LYXERR(Debug::FIND, "Close .*? : " << close_wildcards);
1696 LYXERR(Debug::FIND, "Replaced text (to be used as regex): " << par_as_string);
1698 // If entered regexp must match at begin of searched string buffer
1699 // Kornel: Added parentheses to use $1 for size of the leading string
1703 // TODO: Adapt '\[12345678]' in par_as_string to acount for the first '()
1704 // Unfortunately is '\1', '\2', etc not working for strings with extra format
1705 // so the convert has no effect in that case
1706 for (int i = 8; i > 0; --i) {
1707 string orig = "\\\\" + std::to_string(i);
1708 string dest = "\\" + std::to_string(i+1);
1709 while (regex_replace(par_as_string, par_as_string, orig, dest));
1711 regexp_str = "(" + lead_as_regexp + ")" + par_as_string;
1712 regexp2_str = "(" + lead_as_regexp + ").*" + par_as_string;
1714 LYXERR(Debug::FIND, "Setting regexp to : '" << regexp_str << "'");
1715 regexp = lyx::regex(regexp_str);
1717 LYXERR(Debug::FIND, "Setting regexp2 to: '" << regexp2_str << "'");
1718 regexp2 = lyx::regex(regexp2_str);
1723 int MatchStringAdv::findAux(DocIterator const & cur, int len, bool at_begin) const
1726 (opt.restr == FindAndReplaceOptions::R_ONLY_MATHS && !cur.inMathed()) )
1729 docstring docstr = stringifyFromForSearch(opt, cur, len);
1730 string str = normalize(docstr, true);
1731 if (str.empty()) return(-1);
1732 LYXERR(Debug::FIND, "Matching against '" << lyx::to_utf8(docstr) << "'");
1733 LYXERR(Debug::FIND, "After normalization: '" << str << "'");
1736 LYXERR(Debug::FIND, "Searching in regexp mode: at_begin=" << at_begin);
1737 regex const *p_regexp;
1738 regex_constants::match_flag_type flags;
1740 flags = regex_constants::match_continuous;
1743 flags = regex_constants::match_default;
1744 p_regexp = ®exp2;
1746 sregex_iterator re_it(str.begin(), str.end(), *p_regexp, flags);
1747 if (re_it == sregex_iterator())
1749 match_results<string::const_iterator> const & m = *re_it;
1751 if (0) { // Kornel Benko: DO NOT CHECKK
1752 // Check braces on the segment that matched the entire regexp expression,
1753 // plus the last subexpression, if a (.*?) was inserted in the constructor.
1754 if (!braces_match(m[0].first, m[0].second, open_braces))
1758 // Check braces on segments that matched all (.*?) subexpressions,
1759 // except the last "padding" one inserted by lyx.
1760 for (size_t i = 1; i < m.size() - 1; ++i)
1761 if (!braces_match(m[i].first, m[i].second, open_braces))
1764 // Exclude from the returned match length any length
1765 // due to close wildcards added at end of regexp
1766 // and also the length of the leading (e.g. '\emph{')
1768 // Whole found string, including the leading: m[0].second - m[0].first
1769 // Size of the leading string: m[1].second - m[1].first
1770 int leadingsize = 0;
1772 leadingsize = m[1].second - m[1].first;
1774 for (size_t i = 0; i < m.size(); i++) {
1775 LYXERR(Debug::FIND, "Match " << i << " is " << m[i].second - m[i].first << " long");
1777 if (close_wildcards == 0)
1778 result = m[0].second - m[0].first;
1781 result = m[m.size() - close_wildcards].first - m[0].first;
1783 if (result > leadingsize)
1784 result -= leadingsize;
1790 // else !use_regexp: but all code paths above return
1791 LYXERR(Debug::FIND, "Searching in normal mode: par_as_string='"
1792 << par_as_string << "', str='" << str << "'");
1793 LYXERR(Debug::FIND, "Searching in normal mode: lead_as_string='"
1794 << lead_as_string << "', par_as_string_nolead='"
1795 << par_as_string_nolead << "'");
1798 LYXERR(Debug::FIND, "size=" << par_as_string.size()
1799 << ", substr='" << str.substr(0, par_as_string.size()) << "'");
1800 if (str.substr(0, par_as_string.size()) == par_as_string)
1801 return par_as_string.size();
1803 size_t pos = str.find(par_as_string_nolead);
1804 if (pos != string::npos)
1805 return par_as_string.size();
1811 int MatchStringAdv::operator()(DocIterator const & cur, int len, bool at_begin) const
1813 int res = findAux(cur, len, at_begin);
1815 "res=" << res << ", at_begin=" << at_begin
1816 << ", matchword=" << opt.matchword
1817 << ", inTexted=" << cur.inTexted());
1818 if (res == 0 || !at_begin || !opt.matchword || !cur.inTexted())
1820 Paragraph const & par = cur.paragraph();
1821 bool ws_left = (cur.pos() > 0)
1822 ? par.isWordSeparator(cur.pos() - 1)
1824 bool ws_right = (cur.pos() + res < par.size())
1825 ? par.isWordSeparator(cur.pos() + res)
1828 "cur.pos()=" << cur.pos() << ", res=" << res
1829 << ", separ: " << ws_left << ", " << ws_right
1831 if (ws_left && ws_right)
1837 string MatchStringAdv::normalize(docstring const & s, bool hack_braces) const
1840 if (! opt.casesensitive)
1841 t = lyx::to_utf8(lowercase(s));
1843 t = lyx::to_utf8(s);
1844 // Remove \n at begin
1845 while (!t.empty() && t[0] == '\n')
1848 while (!t.empty() && t[t.size() - 1] == '\n')
1849 t = t.substr(0, t.size() - 1);
1851 // Replace all other \n with spaces
1852 while ((pos = t.find("\n")) != string::npos)
1853 t.replace(pos, 1, " ");
1854 // Remove stale empty \emph{}, \textbf{} and similar blocks from latexify
1855 // Kornel: Added textsl, textsf, textit, texttt and noun
1856 // + allow to seach for colored text too
1857 LYXERR(Debug::FIND, "Removing stale empty \\emph{}, \\textbf{}, \\*section{} macros from: " << t);
1858 while (regex_replace(t, t, "\\\\(emph|noun|text(bf|sl|sf|it|tt)|(u|uu)line|(s|x)out|uwave)(\\{(\\{\\})?\\})+", ""))
1859 LYXERR(Debug::FIND, " further removing stale empty \\emph{}, \\textbf{} macros from: " << t);
1860 while (regex_replace(t, t, "\\\\((sub)?(((sub)?section)|paragraph)|part)\\*?(\\{(\\{\\})?\\})+", ""))
1861 LYXERR(Debug::FIND, " further removing stale empty \\emph{}, \\textbf{} macros from: " << t);
1863 while (regex_replace(t, t, "\\\\(foreignlanguage|textcolor)\\{[a-z]+\\}(\\{(\\\\item |\\{\\})?\\})+", ""));
1864 // FIXME - check what preceeds the brace
1866 if (opt.ignoreformat)
1867 while (regex_replace(t, t, "\\{", "_x_<")
1868 || regex_replace(t, t, "\\}", "_x_>"))
1869 LYXERR(Debug::FIND, "After {} replacement: '" << t << "'");
1871 while (regex_replace(t, t, "\\\\\\{", "_x_<")
1872 || regex_replace(t, t, "\\\\\\}", "_x_>"))
1873 LYXERR(Debug::FIND, "After {} replacement: '" << t << "'");
1880 docstring stringifyFromCursor(DocIterator const & cur, int len)
1882 LYXERR(Debug::FIND, "Stringifying with len=" << len << " from cursor at pos: " << cur);
1883 if (cur.inTexted()) {
1884 Paragraph const & par = cur.paragraph();
1885 // TODO what about searching beyond/across paragraph breaks ?
1886 // TODO Try adding a AS_STR_INSERTS as last arg
1887 pos_type end = ( len == -1 || cur.pos() + len > int(par.size()) ) ?
1888 int(par.size()) : cur.pos() + len;
1889 OutputParams runparams(&cur.buffer()->params().encoding());
1890 runparams.nice = true;
1891 runparams.flavor = OutputParams::LATEX;
1892 runparams.linelen = 100000; //lyxrc.plaintext_linelen;
1893 // No side effect of file copying and image conversion
1894 runparams.dryrun = true;
1895 LYXERR(Debug::FIND, "Stringifying with cur: "
1896 << cur << ", from pos: " << cur.pos() << ", end: " << end);
1897 return par.asString(cur.pos(), end,
1898 AS_STR_INSETS | AS_STR_SKIPDELETE | AS_STR_PLAINTEXT,
1900 } else if (cur.inMathed()) {
1902 CursorSlice cs = cur.top();
1903 MathData md = cs.cell();
1904 MathData::const_iterator it_end =
1905 (( len == -1 || cs.pos() + len > int(md.size()))
1907 : md.begin() + cs.pos() + len );
1908 for (MathData::const_iterator it = md.begin() + cs.pos();
1910 s = s + asString(*it);
1911 LYXERR(Debug::FIND, "Stringified math: '" << s << "'");
1914 LYXERR(Debug::FIND, "Don't know how to stringify from here: " << cur);
1919 /** Computes the LaTeX export of buf starting from cur and ending len positions
1920 * after cur, if len is positive, or at the paragraph or innermost inset end
1923 docstring latexifyFromCursor(DocIterator const & cur, int len)
1925 LYXERR(Debug::FIND, "Latexifying with len=" << len << " from cursor at pos: " << cur);
1926 LYXERR(Debug::FIND, " with cur.lastpost=" << cur.lastpos() << ", cur.lastrow="
1927 << cur.lastrow() << ", cur.lastcol=" << cur.lastcol());
1928 Buffer const & buf = *cur.buffer();
1930 odocstringstream ods;
1932 OutputParams runparams(&buf.params().encoding());
1933 runparams.nice = false;
1934 runparams.flavor = OutputParams::LATEX;
1935 runparams.linelen = 8000; //lyxrc.plaintext_linelen;
1936 // No side effect of file copying and image conversion
1937 runparams.dryrun = true;
1938 runparams.for_search = true;
1940 if (cur.inTexted()) {
1941 // @TODO what about searching beyond/across paragraph breaks ?
1942 pos_type endpos = cur.paragraph().size();
1943 if (len != -1 && endpos > cur.pos() + len)
1944 endpos = cur.pos() + len;
1945 TeXOnePar(buf, *cur.innerText(), cur.pit(), os, runparams,
1946 string(), cur.pos(), endpos);
1947 string s = correctlanguagesetting(lyx::to_utf8(ods.str()), false, false);
1948 LYXERR(Debug::FIND, "Latexified +modified text: '" << s << "'");
1949 return(lyx::from_utf8(s));
1950 } else if (cur.inMathed()) {
1951 // Retrieve the math environment type, and add '$' or '$[' or others (\begin{equation}) accordingly
1952 for (int s = cur.depth() - 1; s >= 0; --s) {
1953 CursorSlice const & cs = cur[s];
1954 if (cs.asInsetMath() && cs.asInsetMath()->asHullInset()) {
1956 cs.asInsetMath()->asHullInset()->header_write(ws);
1961 CursorSlice const & cs = cur.top();
1962 MathData md = cs.cell();
1963 MathData::const_iterator it_end =
1964 ((len == -1 || cs.pos() + len > int(md.size()))
1966 : md.begin() + cs.pos() + len);
1967 for (MathData::const_iterator it = md.begin() + cs.pos();
1969 ods << asString(*it);
1971 // Retrieve the math environment type, and add '$' or '$]'
1972 // or others (\end{equation}) accordingly
1973 for (int s = cur.depth() - 1; s >= 0; --s) {
1974 CursorSlice const & cs2 = cur[s];
1975 InsetMath * inset = cs2.asInsetMath();
1976 if (inset && inset->asHullInset()) {
1978 inset->asHullInset()->footer_write(ws);
1982 LYXERR(Debug::FIND, "Latexified math: '" << lyx::to_utf8(ods.str()) << "'");
1984 LYXERR(Debug::FIND, "Don't know how to stringify from here: " << cur);
1990 /** Finalize an advanced find operation, advancing the cursor to the innermost
1991 ** position that matches, plus computing the length of the matching text to
1994 int findAdvFinalize(DocIterator & cur, MatchStringAdv const & match)
1996 // Search the foremost position that matches (avoids find of entire math
1997 // inset when match at start of it)
1999 DocIterator old_cur(cur.buffer());
2001 LYXERR(Debug::FIND, "Forwarding one step (searching for innermost match)");
2005 } while (cur && cur.depth() > d && match(cur) > 0);
2007 if (match(cur) <= 0) return 0;
2008 LYXERR(Debug::FIND, "Ok");
2010 // Compute the match length
2012 if (cur.pos() + len > cur.lastpos())
2014 LYXERR(Debug::FIND, "verifying unmatch with len = " << len);
2015 while (cur.pos() + len <= cur.lastpos() && match(cur, len) <= 0) {
2017 LYXERR(Debug::FIND, "verifying unmatch with len = " << len);
2019 // Length of matched text (different from len param)
2020 int old_len = match(cur, len);
2021 if (old_len < 0) old_len = 0;
2023 // Greedy behaviour while matching regexps
2024 while ((new_len = match(cur, len + 1)) > old_len) {
2027 LYXERR(Debug::FIND, "verifying match with len = " << len);
2034 int findForwardAdv(DocIterator & cur, MatchStringAdv & match)
2038 while (!theApp()->longOperationCancelled() && cur) {
2039 LYXERR(Debug::FIND, "findForwardAdv() cur: " << cur);
2040 int match_len = match(cur, -1, false);
2041 LYXERR(Debug::FIND, "match_len: " << match_len);
2042 if (match_len > 0) {
2043 int match_len_zero_count = 0;
2044 for (; !theApp()->longOperationCancelled() && cur; cur.forwardPos()) {
2045 LYXERR(Debug::FIND, "Advancing cur: " << cur);
2046 int match_len2 = match(cur);
2047 LYXERR(Debug::FIND, "match_len2: " << match_len2);
2048 if (match_len2 > 0) {
2049 // Sometimes in finalize we understand it wasn't a match
2050 // and we need to continue the outest loop
2051 int len = findAdvFinalize(cur, match);
2056 if (match_len2 >= 0) {
2057 if (match_len2 == 0)
2058 match_len_zero_count++;
2060 match_len_zero_count = 0;
2063 if (++match_len_zero_count > 3) {
2064 LYXERR(Debug::FIND, "match_len2_zero_count: " << match_len_zero_count << ", match_len was " << match_len);
2065 match_len_zero_count = 0;
2073 if (match_len >= 0 && cur.pit() < cur.lastpit()) {
2074 LYXERR(Debug::FIND, "Advancing par: cur=" << cur);
2077 // This should exit nested insets, if any, or otherwise undefine the currsor.
2078 cur.pos() = cur.lastpos();
2079 LYXERR(Debug::FIND, "Advancing pos: cur=" << cur);
2087 /// Find the most backward consecutive match within same paragraph while searching backwards.
2088 int findMostBackwards(DocIterator & cur, MatchStringAdv const & match)
2090 DocIterator cur_begin = doc_iterator_begin(cur.buffer());
2091 DocIterator tmp_cur = cur;
2092 int len = findAdvFinalize(tmp_cur, match);
2093 Inset & inset = cur.inset();
2094 for (; cur != cur_begin; cur.backwardPos()) {
2095 LYXERR(Debug::FIND, "findMostBackwards(): cur=" << cur);
2096 DocIterator new_cur = cur;
2097 new_cur.backwardPos();
2098 if (new_cur == cur || &new_cur.inset() != &inset || !match(new_cur))
2100 int new_len = findAdvFinalize(new_cur, match);
2105 LYXERR(Debug::FIND, "findMostBackwards(): exiting with cur=" << cur);
2111 int findBackwardsAdv(DocIterator & cur, MatchStringAdv & match)
2115 // Backup of original position
2116 DocIterator cur_begin = doc_iterator_begin(cur.buffer());
2117 if (cur == cur_begin)
2120 DocIterator cur_orig(cur);
2121 bool pit_changed = false;
2124 bool found_match = match(cur, -1, false);
2128 cur.pos() = cur.lastpos();
2130 cur.pos() = cur_orig.pos();
2131 LYXERR(Debug::FIND, "findBackAdv2: cur: " << cur);
2132 DocIterator cur_prev_iter;
2134 found_match = match(cur);
2135 LYXERR(Debug::FIND, "findBackAdv3: found_match="
2136 << found_match << ", cur: " << cur);
2138 return findMostBackwards(cur, match);
2140 // Stop if begin of document reached
2141 if (cur == cur_begin)
2143 cur_prev_iter = cur;
2147 if (cur == cur_begin)
2154 } while (!theApp()->longOperationCancelled());
2162 docstring stringifyFromForSearch(FindAndReplaceOptions const & opt,
2163 DocIterator const & cur, int len)
2165 if (cur.pos() < 0 || cur.pos() > cur.lastpos())
2167 if (!opt.ignoreformat)
2168 return latexifyFromCursor(cur, len);
2170 return stringifyFromCursor(cur, len);
2174 FindAndReplaceOptions::FindAndReplaceOptions(
2175 docstring const & find_buf_name, bool casesensitive,
2176 bool matchword, bool forward, bool expandmacros, bool ignoreformat,
2177 docstring const & repl_buf_name, bool keep_case,
2178 SearchScope scope, SearchRestriction restr)
2179 : find_buf_name(find_buf_name), casesensitive(casesensitive), matchword(matchword),
2180 forward(forward), expandmacros(expandmacros), ignoreformat(ignoreformat),
2181 repl_buf_name(repl_buf_name), keep_case(keep_case), scope(scope), restr(restr)
2189 /** Check if 'len' letters following cursor are all non-lowercase */
2190 static bool allNonLowercase(Cursor const & cur, int len)
2192 pos_type beg_pos = cur.selectionBegin().pos();
2193 pos_type end_pos = cur.selectionBegin().pos() + len;
2194 if (len > cur.lastpos() + 1 - beg_pos) {
2195 LYXERR(Debug::FIND, "This should not happen, more debug needed");
2196 len = cur.lastpos() + 1 - beg_pos;
2197 end_pos = beg_pos + len;
2199 for (pos_type pos = beg_pos; pos != end_pos; ++pos)
2200 if (isLowerCase(cur.paragraph().getChar(pos)))
2206 /** Check if first letter is upper case and second one is lower case */
2207 static bool firstUppercase(Cursor const & cur)
2210 pos_type pos = cur.selectionBegin().pos();
2211 if (pos >= cur.lastpos() - 1) {
2212 LYXERR(Debug::FIND, "No upper-case at cur: " << cur);
2215 ch1 = cur.paragraph().getChar(pos);
2216 ch2 = cur.paragraph().getChar(pos + 1);
2217 bool result = isUpperCase(ch1) && isLowerCase(ch2);
2218 LYXERR(Debug::FIND, "firstUppercase(): "
2219 << "ch1=" << ch1 << "(" << char(ch1) << "), ch2="
2220 << ch2 << "(" << char(ch2) << ")"
2221 << ", result=" << result << ", cur=" << cur);
2226 /** Make first letter of supplied buffer upper-case, and the rest lower-case.
2228 ** \fixme What to do with possible further paragraphs in replace buffer ?
2230 static void changeFirstCase(Buffer & buffer, TextCase first_case, TextCase others_case)
2232 ParagraphList::iterator pit = buffer.paragraphs().begin();
2233 LASSERT(pit->size() >= 1, /**/);
2234 pos_type right = pos_type(1);
2235 pit->changeCase(buffer.params(), pos_type(0), right, first_case);
2236 right = pit->size();
2237 pit->changeCase(buffer.params(), pos_type(1), right, others_case);
2243 static void findAdvReplace(BufferView * bv, FindAndReplaceOptions const & opt, MatchStringAdv & matchAdv)
2245 Cursor & cur = bv->cursor();
2246 if (opt.repl_buf_name == docstring()
2247 || theBufferList().getBuffer(FileName(to_utf8(opt.repl_buf_name)), true) == 0
2248 || theBufferList().getBuffer(FileName(to_utf8(opt.find_buf_name)), true) == 0)
2251 DocIterator sel_beg = cur.selectionBegin();
2252 DocIterator sel_end = cur.selectionEnd();
2253 if (&sel_beg.inset() != &sel_end.inset()
2254 || sel_beg.pit() != sel_end.pit()
2255 || sel_beg.idx() != sel_end.idx())
2257 int sel_len = sel_end.pos() - sel_beg.pos();
2258 LYXERR(Debug::FIND, "sel_beg: " << sel_beg << ", sel_end: " << sel_end
2259 << ", sel_len: " << sel_len << endl);
2262 LASSERT(sel_len > 0, return);
2264 if (!matchAdv(sel_beg, sel_len))
2267 // Build a copy of the replace buffer, adapted to the KeepCase option
2268 Buffer & repl_buffer_orig = *theBufferList().getBuffer(FileName(to_utf8(opt.repl_buf_name)), true);
2270 repl_buffer_orig.write(oss);
2271 string lyx = oss.str();
2272 Buffer repl_buffer("", false);
2273 repl_buffer.setUnnamed(true);
2274 LASSERT(repl_buffer.readString(lyx), return);
2275 if (opt.keep_case && sel_len >= 2) {
2276 LYXERR(Debug::FIND, "keep_case true: cur.pos()=" << cur.pos() << ", sel_len=" << sel_len);
2277 if (cur.inTexted()) {
2278 if (firstUppercase(cur))
2279 changeFirstCase(repl_buffer, text_uppercase, text_lowercase);
2280 else if (allNonLowercase(cur, sel_len))
2281 changeFirstCase(repl_buffer, text_uppercase, text_uppercase);
2284 cap::cutSelection(cur, false);
2285 if (cur.inTexted()) {
2286 repl_buffer.changeLanguage(
2287 repl_buffer.language(),
2288 cur.getFont().language());
2289 LYXERR(Debug::FIND, "Replacing by pasteParagraphList()ing repl_buffer");
2290 LYXERR(Debug::FIND, "Before pasteParagraphList() cur=" << cur << endl);
2291 cap::pasteParagraphList(cur, repl_buffer.paragraphs(),
2292 repl_buffer.params().documentClassPtr(),
2293 bv->buffer().errorList("Paste"));
2294 LYXERR(Debug::FIND, "After pasteParagraphList() cur=" << cur << endl);
2295 sel_len = repl_buffer.paragraphs().begin()->size();
2296 } else if (cur.inMathed()) {
2297 odocstringstream ods;
2299 OutputParams runparams(&repl_buffer.params().encoding());
2300 runparams.nice = false;
2301 runparams.flavor = OutputParams::LATEX;
2302 runparams.linelen = 8000; //lyxrc.plaintext_linelen;
2303 runparams.dryrun = true;
2304 TeXOnePar(repl_buffer, repl_buffer.text(), 0, os, runparams);
2305 //repl_buffer.getSourceCode(ods, 0, repl_buffer.paragraphs().size(), false);
2306 docstring repl_latex = ods.str();
2307 LYXERR(Debug::FIND, "Latexified replace_buffer: '" << repl_latex << "'");
2309 (void)regex_replace(to_utf8(repl_latex), s, "\\$(.*)\\$", "$1");
2310 (void)regex_replace(s, s, "\\\\\\[(.*)\\\\\\]", "$1");
2311 repl_latex = from_utf8(s);
2312 LYXERR(Debug::FIND, "Replacing by insert()ing latex: '" << repl_latex << "' cur=" << cur << " with depth=" << cur.depth());
2313 MathData ar(cur.buffer());
2314 asArray(repl_latex, ar, Parse::NORMAL);
2316 sel_len = ar.size();
2317 LYXERR(Debug::FIND, "After insert() cur=" << cur << " with depth: " << cur.depth() << " and len: " << sel_len);
2319 if (cur.pos() >= sel_len)
2320 cur.pos() -= sel_len;
2323 LYXERR(Debug::FIND, "After pos adj cur=" << cur << " with depth: " << cur.depth() << " and len: " << sel_len);
2324 bv->putSelectionAt(DocIterator(cur), sel_len, !opt.forward);
2325 bv->processUpdateFlags(Update::Force);
2329 /// Perform a FindAdv operation.
2330 bool findAdv(BufferView * bv, FindAndReplaceOptions const & opt)
2335 // e.g., when invoking word-findadv from mini-buffer wither with
2336 // wrong options syntax or before ever opening advanced F&R pane
2337 if (theBufferList().getBuffer(FileName(to_utf8(opt.find_buf_name)), true) == 0)
2341 MatchStringAdv matchAdv(bv->buffer(), opt);
2342 int length = bv->cursor().selectionEnd().pos() - bv->cursor().selectionBegin().pos();
2344 bv->putSelectionAt(bv->cursor().selectionBegin(), length, !opt.forward);
2345 findAdvReplace(bv, opt, matchAdv);
2348 match_len = findForwardAdv(cur, matchAdv);
2350 match_len = findBackwardsAdv(cur, matchAdv);
2352 // This may only be raised by lyx::regex()
2353 bv->message(_("Invalid regular expression!"));
2357 if (match_len == 0) {
2358 bv->message(_("Match not found!"));
2362 bv->message(_("Match found!"));
2364 LYXERR(Debug::FIND, "Putting selection at cur=" << cur << " with len: " << match_len);
2365 bv->putSelectionAt(cur, match_len, !opt.forward);
2371 ostringstream & operator<<(ostringstream & os, FindAndReplaceOptions const & opt)
2373 os << to_utf8(opt.find_buf_name) << "\nEOSS\n"
2374 << opt.casesensitive << ' '
2375 << opt.matchword << ' '
2376 << opt.forward << ' '
2377 << opt.expandmacros << ' '
2378 << opt.ignoreformat << ' '
2379 << to_utf8(opt.repl_buf_name) << "\nEOSS\n"
2380 << opt.keep_case << ' '
2381 << int(opt.scope) << ' '
2384 LYXERR(Debug::FIND, "built: " << os.str());
2390 istringstream & operator>>(istringstream & is, FindAndReplaceOptions & opt)
2392 LYXERR(Debug::FIND, "parsing");
2396 while (line != "EOSS") {
2400 if (is.eof()) // Tolerate malformed request
2404 LYXERR(Debug::FIND, "file_buf_name: '" << s << "'");
2405 opt.find_buf_name = from_utf8(s);
2406 is >> opt.casesensitive >> opt.matchword >> opt.forward >> opt.expandmacros >> opt.ignoreformat;
2407 is.get(); // Waste space before replace string
2410 while (line != "EOSS") {
2414 if (is.eof()) // Tolerate malformed request
2418 LYXERR(Debug::FIND, "repl_buf_name: '" << s << "'");
2419 opt.repl_buf_name = from_utf8(s);
2420 is >> opt.keep_case;
2423 opt.scope = FindAndReplaceOptions::SearchScope(i);
2425 opt.restr = FindAndReplaceOptions::SearchRestriction(i);
2427 LYXERR(Debug::FIND, "parsed: " << opt.casesensitive << ' ' << opt.matchword << ' ' << opt.forward << ' '
2428 << opt.expandmacros << ' ' << opt.ignoreformat << ' ' << opt.keep_case << ' '
2429 << opt.scope << ' ' << opt.restr);