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/MathStream.h"
43 #include "mathed/MathSupport.h"
45 #include "support/convert.h"
46 #include "support/debug.h"
47 #include "support/docstream.h"
48 #include "support/FileName.h"
49 #include "support/gettext.h"
50 #include "support/lassert.h"
51 #include "support/lstrings.h"
53 #include "support/regex.h"
56 using namespace lyx::support;
62 bool parse_bool(docstring & howto)
67 howto = split(howto, var, ' ');
72 class MatchString : public binary_function<Paragraph, pos_type, int>
75 MatchString(docstring const & str, bool cs, bool mw)
76 : str(str), case_sens(cs), whole_words(mw)
79 // returns true if the specified string is at the specified position
80 // del specifies whether deleted strings in ct mode will be considered
81 int operator()(Paragraph const & par, pos_type pos, bool del = true) const
83 return par.find(str, case_sens, whole_words, pos, del);
91 // match whole words only
96 int findForward(DocIterator & cur, MatchString const & match,
99 for (; cur; cur.forwardChar())
100 if (cur.inTexted()) {
101 int len = match(cur.paragraph(), cur.pos(), find_del);
109 int findBackwards(DocIterator & cur, MatchString const & match,
110 bool find_del = true)
114 if (cur.inTexted()) {
115 int len = match(cur.paragraph(), cur.pos(), find_del);
124 bool searchAllowed(docstring const & str)
127 frontend::Alert::error(_("Search error"), _("Search string is empty"));
134 bool findOne(BufferView * bv, docstring const & searchstr,
135 bool case_sens, bool whole, bool forward, bool find_del = true)
137 if (!searchAllowed(searchstr))
140 DocIterator cur = forward
141 ? bv->cursor().selectionEnd()
142 : bv->cursor().selectionBegin();
144 MatchString const match(searchstr, case_sens, whole);
146 int match_len = forward
147 ? findForward(cur, match, find_del)
148 : findBackwards(cur, match, find_del);
151 bv->putSelectionAt(cur, match_len, !forward);
153 return match_len > 0;
157 int replaceAll(BufferView * bv,
158 docstring const & searchstr, docstring const & replacestr,
159 bool case_sens, bool whole)
161 Buffer & buf = bv->buffer();
163 if (!searchAllowed(searchstr) || buf.isReadonly())
166 DocIterator cur_orig(bv->cursor());
168 MatchString const match(searchstr, case_sens, whole);
171 int const rsize = replacestr.size();
172 int const ssize = searchstr.size();
175 cur.setCursor(doc_iterator_begin(&buf));
176 int match_len = findForward(cur, match, false);
177 while (match_len > 0) {
178 // Backup current cursor position and font.
179 pos_type const pos = cur.pos();
180 Font const font = cur.paragraph().getFontSettings(buf.params(), pos);
182 int striked = ssize -
183 cur.paragraph().eraseChars(pos, pos + match_len,
184 buf.params().track_changes);
185 cur.paragraph().insert(pos, replacestr, font,
186 Change(buf.params().track_changes
188 : Change::UNCHANGED));
189 for (int i = 0; i < rsize + striked; ++i)
192 match_len = findForward(cur, match, false);
195 bv->putSelectionAt(doc_iterator_begin(&buf), 0, false);
197 cur_orig.fixIfBroken();
198 bv->setCursor(cur_orig);
204 // the idea here is that we are going to replace the string that
205 // is selected IF it is the search string.
206 // if there is a selection, but it is not the search string, then
207 // we basically ignore it. (FIXME We ought to replace only within
209 // if there is no selection, then:
210 // (i) if some search string has been provided, then we find it.
211 // (think of how the dialog works when you hit "replace" the
213 // (ii) if no search string has been provided, then we treat the
214 // word the cursor is in as the search string. (why? i have no
215 // idea.) but this only works in text?
217 // returns the number of replacements made (one, if any) and
218 // whether anything at all was done.
219 pair<bool, int> replaceOne(BufferView * bv, docstring searchstr,
220 docstring const & replacestr, bool case_sens,
221 bool whole, bool forward, bool findnext)
223 Cursor & cur = bv->cursor();
224 if (!cur.selection()) {
225 // no selection, non-empty search string: find it
226 if (!searchstr.empty()) {
227 findOne(bv, searchstr, case_sens, whole, forward);
228 return make_pair(true, 0);
230 // empty search string
233 return make_pair(false, 0);
234 // select current word and treat it as the search string.
235 // This causes a minor bug as undo will restore this selection,
236 // which the user did not create (#8986).
237 cur.innerText()->selectWord(cur, WHOLE_WORD);
238 searchstr = cur.selectionAsString(false);
241 // if we still don't have a search string, report the error
243 if (!searchAllowed(searchstr))
244 return make_pair(false, 0);
246 bool have_selection = cur.selection();
247 docstring const selected = cur.selectionAsString(false);
250 ? searchstr == selected
251 : compare_no_case(searchstr, selected) == 0;
253 // no selection or current selection is not search word:
254 // just find the search word
255 if (!have_selection || !match) {
256 findOne(bv, searchstr, case_sens, whole, forward);
257 return make_pair(true, 0);
260 // we're now actually ready to replace. if the buffer is
261 // read-only, we can't, though.
262 if (bv->buffer().isReadonly())
263 return make_pair(false, 0);
265 cap::replaceSelectionWithString(cur, replacestr);
267 cur.pos() += replacestr.length();
268 LASSERT(cur.pos() <= cur.lastpos(),
269 cur.pos() = cur.lastpos());
272 findOne(bv, searchstr, case_sens, whole, forward, false);
274 return make_pair(true, 1);
280 docstring const find2string(docstring const & search,
281 bool casesensitive, bool matchword, bool forward)
285 << int(casesensitive) << ' '
286 << int(matchword) << ' '
292 docstring const replace2string(docstring const & replace,
293 docstring const & search,
294 bool casesensitive, bool matchword,
295 bool all, bool forward, bool findnext)
298 ss << replace << '\n'
300 << int(casesensitive) << ' '
301 << int(matchword) << ' '
303 << int(forward) << ' '
309 bool lyxfind(BufferView * bv, FuncRequest const & ev)
311 if (!bv || ev.action() != LFUN_WORD_FIND)
314 //lyxerr << "find called, cmd: " << ev << endl;
316 // data is of the form
318 // <casesensitive> <matchword> <forward>"
320 docstring howto = split(ev.argument(), search, '\n');
322 bool casesensitive = parse_bool(howto);
323 bool matchword = parse_bool(howto);
324 bool forward = parse_bool(howto);
326 return findOne(bv, search, casesensitive, matchword, forward);
330 bool lyxreplace(BufferView * bv,
331 FuncRequest const & ev, bool has_deleted)
333 if (!bv || ev.action() != LFUN_WORD_REPLACE)
336 // data is of the form
339 // <casesensitive> <matchword> <all> <forward> <findnext>"
342 docstring howto = split(ev.argument(), rplc, '\n');
343 howto = split(howto, search, '\n');
345 bool casesensitive = parse_bool(howto);
346 bool matchword = parse_bool(howto);
347 bool all = parse_bool(howto);
348 bool forward = parse_bool(howto);
349 bool findnext = howto.empty() ? true : parse_bool(howto);
354 int replace_count = 0;
356 replace_count = replaceAll(bv, search, rplc, casesensitive, matchword);
357 update = replace_count > 0;
360 replaceOne(bv, search, rplc, casesensitive, matchword, forward, findnext);
362 replace_count = rv.second;
365 Buffer const & buf = bv->buffer();
367 // emit message signal.
368 buf.message(_("String not found."));
370 if (replace_count == 0) {
371 buf.message(_("String found."));
372 } else if (replace_count == 1) {
373 buf.message(_("String has been replaced."));
375 docstring const str =
376 bformat(_("%1$d strings have been replaced."), replace_count);
380 } else if (findnext) {
381 // if we have deleted characters, we do not replace at all, but
382 // rather search for the next occurence
383 if (findOne(bv, search, casesensitive, matchword, forward))
386 bv->message(_("String not found."));
388 bv->buffer().updatePreviews();
393 bool findNextChange(DocIterator & cur)
395 for (; cur; cur.forwardPos())
396 if (cur.inTexted() && cur.paragraph().isChanged(cur.pos()))
402 bool findPreviousChange(DocIterator & cur)
404 for (cur.backwardPos(); cur; cur.backwardPos()) {
405 if (cur.inTexted() && cur.paragraph().isChanged(cur.pos()))
412 bool selectChange(Cursor & cur, bool forward)
414 if (!cur.inTexted() || !cur.paragraph().isChanged(cur.pos()))
416 Change ch = cur.paragraph().lookupChange(cur.pos());
418 CursorSlice tip1 = cur.top();
419 for (; tip1.pit() < tip1.lastpit() || tip1.pos() < tip1.lastpos(); tip1.forwardPos()) {
420 Change ch2 = tip1.paragraph().lookupChange(tip1.pos());
421 if (!ch2.isSimilarTo(ch))
424 CursorSlice tip2 = cur.top();
425 for (; tip2.pit() > 0 || tip2.pos() > 0;) {
427 Change ch2 = tip2.paragraph().lookupChange(tip2.pos());
428 if (!ch2.isSimilarTo(ch)) {
429 // take a step forward to correctly set the selection
437 cur.bv().mouseSetCursor(cur, false);
439 cur.bv().mouseSetCursor(cur, true);
447 bool findChange(BufferView * bv, bool forward)
450 cur.setCursor(forward ? bv->cursor().selectionEnd()
451 : bv->cursor().selectionBegin());
452 forward ? findNextChange(cur) : findPreviousChange(cur);
453 return selectChange(cur, forward);
458 bool findNextChange(BufferView * bv)
460 return findChange(bv, true);
464 bool findPreviousChange(BufferView * bv)
466 return findChange(bv, false);
473 typedef vector<pair<string, string> > Escapes;
475 /// A map of symbols and their escaped equivalent needed within a regex.
476 /// @note Beware of order
477 Escapes const & get_regexp_escapes()
479 typedef std::pair<std::string, std::string> P;
481 static Escapes escape_map;
482 if (escape_map.empty()) {
483 escape_map.push_back(P("$", "_x_$"));
484 escape_map.push_back(P("{", "_x_{"));
485 escape_map.push_back(P("}", "_x_}"));
486 escape_map.push_back(P("[", "_x_["));
487 escape_map.push_back(P("]", "_x_]"));
488 escape_map.push_back(P("(", "_x_("));
489 escape_map.push_back(P(")", "_x_)"));
490 escape_map.push_back(P("+", "_x_+"));
491 escape_map.push_back(P("*", "_x_*"));
492 escape_map.push_back(P(".", "_x_."));
493 escape_map.push_back(P("\\", "(?:\\\\|\\\\backslash)"));
494 escape_map.push_back(P("~", "(?:\\\\textasciitilde|\\\\sim)"));
495 escape_map.push_back(P("^", "(?:\\^|\\\\textasciicircum\\{\\}|\\\\mathcircumflex)"));
496 escape_map.push_back(P("_x_", "\\"));
501 /// A map of lyx escaped strings and their unescaped equivalent.
502 Escapes const & get_lyx_unescapes()
504 typedef std::pair<std::string, std::string> P;
506 static Escapes escape_map;
507 if (escape_map.empty()) {
508 escape_map.push_back(P("\\%", "%"));
509 escape_map.push_back(P("\\mathcircumflex ", "^"));
510 escape_map.push_back(P("\\mathcircumflex", "^"));
511 escape_map.push_back(P("\\backslash ", "\\"));
512 escape_map.push_back(P("\\backslash", "\\"));
513 escape_map.push_back(P("\\\\{", "_x_<"));
514 escape_map.push_back(P("\\\\}", "_x_>"));
515 escape_map.push_back(P("\\sim ", "~"));
516 escape_map.push_back(P("\\sim", "~"));
521 /// A map of escapes turning a regexp matching text to one matching latex.
522 Escapes const & get_regexp_latex_escapes()
524 typedef std::pair<std::string, std::string> P;
526 static Escapes escape_map;
527 if (escape_map.empty()) {
528 escape_map.push_back(P("\\\\", "(?:\\\\\\\\|\\\\backslash|\\\\textbackslash\\{\\})"));
529 escape_map.push_back(P("(<?!\\\\\\\\textbackslash)\\{", "\\\\\\{"));
530 escape_map.push_back(P("(<?!\\\\\\\\textbackslash\\\\\\{)\\}", "\\\\\\}"));
531 escape_map.push_back(P("\\[", "\\{\\[\\}"));
532 escape_map.push_back(P("\\]", "\\{\\]\\}"));
533 escape_map.push_back(P("\\^", "(?:\\^|\\\\textasciicircum\\{\\}|\\\\mathcircumflex)"));
534 escape_map.push_back(P("%", "\\\\\\%"));
539 /** @todo Probably the maps need to be migrated to regexps, in order to distinguish if
540 ** the found occurrence were escaped.
542 string apply_escapes(string s, Escapes const & escape_map)
544 LYXERR(Debug::FIND, "Escaping: '" << s << "'");
545 Escapes::const_iterator it;
546 for (it = escape_map.begin(); it != escape_map.end(); ++it) {
547 // LYXERR(Debug::FIND, "Escaping " << it->first << " as " << it->second);
548 unsigned int pos = 0;
549 while (pos < s.length() && (pos = s.find(it->first, pos)) < s.length()) {
550 s.replace(pos, it->first.length(), it->second);
551 LYXERR(Debug::FIND, "After escape: " << s);
552 pos += it->second.length();
553 // LYXERR(Debug::FIND, "pos: " << pos);
556 LYXERR(Debug::FIND, "Escaped : '" << s << "'");
561 /// Within \regexp{} apply get_lyx_unescapes() only (i.e., preserve regexp semantics of the string),
562 /// while outside apply get_lyx_unescapes()+get_regexp_escapes().
563 /// If match_latex is true, then apply regexp_latex_escapes() to \regexp{} contents as well.
564 string escape_for_regex(string s, bool match_latex)
567 while (pos < s.size()) {
568 size_t new_pos = s.find("\\regexp{", pos);
569 if (new_pos == string::npos)
571 LYXERR(Debug::FIND, "new_pos: " << new_pos);
572 string t = apply_escapes(s.substr(pos, new_pos - pos), get_lyx_unescapes());
573 LYXERR(Debug::FIND, "t [lyx]: " << t);
574 t = apply_escapes(t, get_regexp_escapes());
575 LYXERR(Debug::FIND, "t [rxp]: " << t);
576 s.replace(pos, new_pos - pos, t);
577 new_pos = pos + t.size();
578 LYXERR(Debug::FIND, "Regexp after escaping: " << s);
579 LYXERR(Debug::FIND, "new_pos: " << new_pos);
580 if (new_pos == s.size())
582 // Might fail if \\endregexp{} is preceeded by unexpected stuff (weird escapes)
583 size_t end_pos = s.find("\\endregexp{}}", new_pos + 8);
584 LYXERR(Debug::FIND, "end_pos: " << end_pos);
585 t = s.substr(new_pos + 8, end_pos - (new_pos + 8));
586 LYXERR(Debug::FIND, "t in regexp : " << t);
587 t = apply_escapes(t, get_lyx_unescapes());
588 LYXERR(Debug::FIND, "t in regexp [lyx]: " << t);
590 t = apply_escapes(t, get_regexp_latex_escapes());
591 LYXERR(Debug::FIND, "t in regexp [ltx]: " << t);
593 if (end_pos == s.size()) {
594 s.replace(new_pos, end_pos - new_pos, t);
595 LYXERR(Debug::FIND, "Regexp after \\regexp{} removal: " << s);
598 s.replace(new_pos, end_pos + 13 - new_pos, t);
599 LYXERR(Debug::FIND, "Regexp after \\regexp{...\\endregexp{}} removal: " << s);
600 pos = new_pos + t.size();
601 LYXERR(Debug::FIND, "pos: " << pos);
607 /// Wrapper for lyx::regex_replace with simpler interface
608 bool regex_replace(string const & s, string & t, string const & searchstr,
609 string const & replacestr)
611 lyx::regex e(searchstr);
613 ostream_iterator<char, char> it(oss);
614 lyx::regex_replace(it, s.begin(), s.end(), e, replacestr);
615 // tolerate t and s be references to the same variable
616 bool rv = (s != oss.str());
622 /** Checks if supplied string segment is well-formed from the standpoint of matching open-closed braces.
624 ** Verify that closed braces exactly match open braces. This avoids that, for example,
625 ** \frac{.*}{x} matches \frac{x+\frac{y}{x}}{z} with .* being 'x+\frac{y'.
628 ** Number of open braces that must remain open at the end for the verification to succeed.
630 bool braces_match(string::const_iterator const & beg,
631 string::const_iterator const & end,
635 string::const_iterator it = beg;
636 LYXERR(Debug::FIND, "Checking " << unmatched << " unmatched braces in '" << string(beg, end) << "'");
637 for (; it != end; ++it) {
638 // Skip escaped braces in the count
643 } else if (*it == '{') {
645 } else if (*it == '}') {
646 if (open_pars == 0) {
647 LYXERR(Debug::FIND, "Found unmatched closed brace");
653 if (open_pars != unmatched) {
654 LYXERR(Debug::FIND, "Found " << open_pars
655 << " instead of " << unmatched
656 << " unmatched open braces at the end of count");
659 LYXERR(Debug::FIND, "Braces match as expected");
664 /** The class performing a match between a position in the document and the FindAdvOptions.
666 class MatchStringAdv {
668 MatchStringAdv(lyx::Buffer & buf, FindAndReplaceOptions const & opt);
670 /** Tests if text starting at the supplied position matches with the one provided to the MatchStringAdv
671 ** constructor as opt.search, under the opt.* options settings.
674 ** If set, then match is searched only against beginning of text starting at cur.
675 ** If unset, then match is searched anywhere in text starting at cur.
678 ** The length of the matching text, or zero if no match was found.
680 int operator()(DocIterator const & cur, int len = -1, bool at_begin = true) const;
685 /// first buffer on which search was started
686 lyx::Buffer * const p_first_buf;
688 FindAndReplaceOptions const & opt;
691 /// Auxiliary find method (does not account for opt.matchword)
692 int findAux(DocIterator const & cur, int len = -1, bool at_begin = true) const;
694 /** Normalize a stringified or latexified LyX paragraph.
698 ** <li>if search is not casesensitive, then lowercase the string;
699 ** <li>remove any newline at begin or end of the string;
700 ** <li>replace any newline in the middle of the string with a simple space;
701 ** <li>remove stale empty styles and environments, like \emph{} and \textbf{}.
704 ** @todo Normalization should also expand macros, if the corresponding
705 ** search option was checked.
707 string normalize(docstring const & s, bool hack_braces) const;
708 // normalized string to search
709 string par_as_string;
710 // regular expression to use for searching
712 // same as regexp, but prefixed with a ".*"
714 // leading format material as string
715 string lead_as_string;
716 // par_as_string after removal of lead_as_string
717 string par_as_string_nolead;
718 // unmatched open braces in the search string/regexp
720 // number of (.*?) subexpressions added at end of search regexp for closing
721 // environments, math mode, styles, etc...
723 // Are we searching with regular expressions ?
728 static docstring buffer_to_latex(Buffer & buffer)
730 OutputParams runparams(&buffer.params().encoding());
731 TexRow texrow(false);
732 odocstringstream ods;
733 otexstream os(ods, texrow);
734 runparams.nice = true;
735 runparams.flavor = OutputParams::LATEX;
736 runparams.linelen = 80; //lyxrc.plaintext_linelen;
737 // No side effect of file copying and image conversion
738 runparams.dryrun = true;
739 pit_type const endpit = buffer.paragraphs().size();
740 for (pit_type pit = 0; pit != endpit; ++pit) {
741 TeXOnePar(buffer, buffer.text(), pit, os, runparams);
742 LYXERR(Debug::FIND, "searchString up to here: " << ods.str());
748 static docstring stringifySearchBuffer(Buffer & buffer, FindAndReplaceOptions const & opt)
751 if (!opt.ignoreformat) {
752 str = buffer_to_latex(buffer);
754 OutputParams runparams(&buffer.params().encoding());
755 runparams.nice = true;
756 runparams.flavor = OutputParams::LATEX;
757 runparams.linelen = 100000; //lyxrc.plaintext_linelen;
758 runparams.dryrun = true;
759 runparams.for_search = true;
760 for (pos_type pit = pos_type(0); pit < (pos_type)buffer.paragraphs().size(); ++pit) {
761 Paragraph const & par = buffer.paragraphs().at(pit);
762 LYXERR(Debug::FIND, "Adding to search string: '"
763 << par.asString(pos_type(0), par.size(),
764 AS_STR_INSETS | AS_STR_SKIPDELETE | AS_STR_PLAINTEXT,
767 str += par.asString(pos_type(0), par.size(),
768 AS_STR_INSETS | AS_STR_SKIPDELETE | AS_STR_PLAINTEXT,
776 /// Return separation pos between the leading material and the rest
777 static size_t identifyLeading(string const & s)
780 // @TODO Support \item[text]
781 while (regex_replace(t, t, "^\\\\(emph|textbf|subsubsection|subsection|section|subparagraph|paragraph|part)\\*?\\{", "")
782 || regex_replace(t, t, "^\\$", "")
783 || regex_replace(t, t, "^\\\\\\[ ", "")
784 || regex_replace(t, t, "^\\\\item ", "")
785 || regex_replace(t, t, "^\\\\begin\\{[a-zA-Z_]*\\*?\\} ", ""))
786 LYXERR(Debug::FIND, " after removing leading $, \\[ , \\emph{, \\textbf{, etc.: '" << t << "'");
791 // Remove trailing closure of math, macros and environments, so to catch parts of them.
792 static int identifyClosing(string & t)
796 LYXERR(Debug::FIND, "identifyClosing(): t now is '" << t << "'");
797 if (regex_replace(t, t, "(.*[^\\\\])\\$\\'", "$1"))
799 if (regex_replace(t, t, "(.*[^\\\\]) \\\\\\]\\'", "$1"))
801 if (regex_replace(t, t, "(.*[^\\\\]) \\\\end\\{[a-zA-Z_]*\\*?\\}\\'", "$1"))
803 if (regex_replace(t, t, "(.*[^\\\\])\\}\\'", "$1")) {
813 MatchStringAdv::MatchStringAdv(lyx::Buffer & buf, FindAndReplaceOptions const & opt)
814 : p_buf(&buf), p_first_buf(&buf), opt(opt)
816 Buffer & find_buf = *theBufferList().getBuffer(FileName(to_utf8(opt.find_buf_name)), true);
817 docstring const & ds = stringifySearchBuffer(find_buf, opt);
818 use_regexp = lyx::to_utf8(ds).find("\\regexp{") != std::string::npos;
819 // When using regexp, braces are hacked already by escape_for_regex()
820 par_as_string = normalize(ds, !use_regexp);
824 size_t lead_size = 0;
825 if (opt.ignoreformat) {
827 // if par_as_string_nolead were emty,
828 // the following call to findAux will always *find* the string
829 // in the checked data, and thus always using the slow
830 // examining of the current text part.
831 par_as_string_nolead = par_as_string;
834 lead_size = identifyLeading(par_as_string);
835 lead_as_string = par_as_string.substr(0, lead_size);
836 par_as_string_nolead = par_as_string.substr(lead_size, par_as_string.size() - lead_size);
840 open_braces = identifyClosing(par_as_string);
841 identifyClosing(par_as_string_nolead);
842 LYXERR(Debug::FIND, "Open braces: " << open_braces);
843 LYXERR(Debug::FIND, "Built MatchStringAdv object: par_as_string = '" << par_as_string << "'");
845 string lead_as_regexp;
847 // @todo No need to search for \regexp{} insets in leading material
848 lead_as_regexp = escape_for_regex(par_as_string.substr(0, lead_size), !opt.ignoreformat);
849 par_as_string = par_as_string_nolead;
850 LYXERR(Debug::FIND, "lead_as_regexp is '" << lead_as_regexp << "'");
851 LYXERR(Debug::FIND, "par_as_string now is '" << par_as_string << "'");
853 par_as_string = escape_for_regex(par_as_string, !opt.ignoreformat);
854 // Insert (.*?) before trailing closure of math, macros and environments, so to catch parts of them.
855 LYXERR(Debug::FIND, "par_as_string now is '" << par_as_string << "'");
857 // Insert .* before trailing '\$' ('$' has been escaped by escape_for_regex)
858 regex_replace(par_as_string, par_as_string, "(.*[^\\\\])(\\\\\\$)\\'", "$1(.*?)$2")
859 // Insert .* before trailing '\\\]' ('\]' has been escaped by escape_for_regex)
860 || regex_replace(par_as_string, par_as_string, "(.*[^\\\\])( \\\\\\\\\\\\\\])\\'", "$1(.*?)$2")
861 // Insert .* before trailing '\\end\{...}' ('\end{...}' has been escaped by escape_for_regex)
862 || regex_replace(par_as_string, par_as_string,
863 "(.*[^\\\\])( \\\\\\\\end\\\\\\{[a-zA-Z_]*)(\\\\\\*)?(\\\\\\})\\'", "$1(.*?)$2$3$4")
864 // Insert .* before trailing '\}' ('}' has been escaped by escape_for_regex)
865 || regex_replace(par_as_string, par_as_string, "(.*[^\\\\])(\\\\\\})\\'", "$1(.*?)$2")
869 LYXERR(Debug::FIND, "par_as_string now is '" << par_as_string << "'");
870 LYXERR(Debug::FIND, "Open braces: " << open_braces);
871 LYXERR(Debug::FIND, "Close .*? : " << close_wildcards);
872 LYXERR(Debug::FIND, "Replaced text (to be used as regex): " << par_as_string);
873 // If entered regexp must match at begin of searched string buffer
874 string regexp_str = string("\\`") + lead_as_regexp + par_as_string;
875 LYXERR(Debug::FIND, "Setting regexp to : '" << regexp_str << "'");
876 regexp = lyx::regex(regexp_str);
878 // If entered regexp may match wherever in searched string buffer
879 string regexp2_str = string("\\`.*") + lead_as_regexp + ".*" + par_as_string;
880 LYXERR(Debug::FIND, "Setting regexp2 to: '" << regexp2_str << "'");
881 regexp2 = lyx::regex(regexp2_str);
886 int MatchStringAdv::findAux(DocIterator const & cur, int len, bool at_begin) const
889 (opt.restr == FindAndReplaceOptions::R_ONLY_MATHS && !cur.inMathed()) )
891 docstring docstr = stringifyFromForSearch(opt, cur, len);
892 LYXERR(Debug::FIND, "Matching against '" << lyx::to_utf8(docstr) << "'");
893 string str = normalize(docstr, true);
894 LYXERR(Debug::FIND, "After normalization: '" << str << "'");
896 LYXERR(Debug::FIND, "Searching in normal mode: par_as_string='" << par_as_string << "', str='" << str << "'");
897 LYXERR(Debug::FIND, "Searching in normal mode: lead_as_string='" << lead_as_string << "', par_as_string_nolead='" << par_as_string_nolead << "'");
899 LYXERR(Debug::FIND, "size=" << par_as_string.size() << ", substr='" << str.substr(0, par_as_string.size()) << "'");
900 if (str.substr(0, par_as_string.size()) == par_as_string)
901 return par_as_string.size();
903 size_t pos = str.find(par_as_string_nolead);
904 if (pos != string::npos)
905 return par_as_string.size();
908 LYXERR(Debug::FIND, "Searching in regexp mode: at_begin=" << at_begin);
909 // Try all possible regexp matches,
910 //until one that verifies the braces match test is found
911 regex const *p_regexp = at_begin ? ®exp : ®exp2;
912 sregex_iterator re_it(str.begin(), str.end(), *p_regexp);
913 sregex_iterator re_it_end;
914 for (; re_it != re_it_end; ++re_it) {
915 match_results<string::const_iterator> const & m = *re_it;
916 // Check braces on the segment that matched the entire regexp expression,
917 // plus the last subexpression, if a (.*?) was inserted in the constructor.
918 if (!braces_match(m[0].first, m[0].second, open_braces))
920 // Check braces on segments that matched all (.*?) subexpressions,
921 // except the last "padding" one inserted by lyx.
922 for (size_t i = 1; i < m.size() - 1; ++i)
923 if (!braces_match(m[i].first, m[i].second))
925 // Exclude from the returned match length any length
926 // due to close wildcards added at end of regexp
927 if (close_wildcards == 0)
928 return m[0].second - m[0].first;
930 return m[m.size() - close_wildcards].first - m[0].first;
937 int MatchStringAdv::operator()(DocIterator const & cur, int len, bool at_begin) const
939 int res = findAux(cur, len, at_begin);
941 "res=" << res << ", at_begin=" << at_begin
942 << ", matchword=" << opt.matchword
943 << ", inTexted=" << cur.inTexted());
944 if (res == 0 || !at_begin || !opt.matchword || !cur.inTexted())
946 Paragraph const & par = cur.paragraph();
947 bool ws_left = (cur.pos() > 0)
948 ? par.isWordSeparator(cur.pos() - 1)
950 bool ws_right = (cur.pos() + res < par.size())
951 ? par.isWordSeparator(cur.pos() + res)
954 "cur.pos()=" << cur.pos() << ", res=" << res
955 << ", separ: " << ws_left << ", " << ws_right
957 if (ws_left && ws_right)
963 string MatchStringAdv::normalize(docstring const & s, bool hack_braces) const
966 if (! opt.casesensitive)
967 t = lyx::to_utf8(lowercase(s));
970 // Remove \n at begin
971 while (!t.empty() && t[0] == '\n')
974 while (!t.empty() && t[t.size() - 1] == '\n')
975 t = t.substr(0, t.size() - 1);
977 // Replace all other \n with spaces
978 while ((pos = t.find("\n")) != string::npos)
979 t.replace(pos, 1, " ");
980 // Remove stale empty \emph{}, \textbf{} and similar blocks from latexify
981 LYXERR(Debug::FIND, "Removing stale empty \\emph{}, \\textbf{}, \\*section{} macros from: " << t);
982 while (regex_replace(t, t, "\\\\(emph|textbf|subsubsection|subsection|section|subparagraph|paragraph|part)(\\{\\})+", ""))
983 LYXERR(Debug::FIND, " further removing stale empty \\emph{}, \\textbf{} macros from: " << t);
985 // FIXME - check what preceeds the brace
987 if (opt.ignoreformat)
988 while (regex_replace(t, t, "\\{", "_x_<")
989 || regex_replace(t, t, "\\}", "_x_>"))
990 LYXERR(Debug::FIND, "After {} replacement: '" << t << "'");
992 while (regex_replace(t, t, "\\\\\\{", "_x_<")
993 || regex_replace(t, t, "\\\\\\}", "_x_>"))
994 LYXERR(Debug::FIND, "After {} replacement: '" << t << "'");
1001 docstring stringifyFromCursor(DocIterator const & cur, int len)
1003 LYXERR(Debug::FIND, "Stringifying with len=" << len << " from cursor at pos: " << cur);
1004 if (cur.inTexted()) {
1005 Paragraph const & par = cur.paragraph();
1006 // TODO what about searching beyond/across paragraph breaks ?
1007 // TODO Try adding a AS_STR_INSERTS as last arg
1008 pos_type end = ( len == -1 || cur.pos() + len > int(par.size()) ) ?
1009 int(par.size()) : cur.pos() + len;
1010 OutputParams runparams(&cur.buffer()->params().encoding());
1011 runparams.nice = true;
1012 runparams.flavor = OutputParams::LATEX;
1013 runparams.linelen = 100000; //lyxrc.plaintext_linelen;
1014 // No side effect of file copying and image conversion
1015 runparams.dryrun = true;
1016 LYXERR(Debug::FIND, "Stringifying with cur: "
1017 << cur << ", from pos: " << cur.pos() << ", end: " << end);
1018 return par.asString(cur.pos(), end,
1019 AS_STR_INSETS | AS_STR_SKIPDELETE | AS_STR_PLAINTEXT,
1021 } else if (cur.inMathed()) {
1023 CursorSlice cs = cur.top();
1024 MathData md = cs.cell();
1025 MathData::const_iterator it_end =
1026 (( len == -1 || cs.pos() + len > int(md.size()))
1028 : md.begin() + cs.pos() + len );
1029 for (MathData::const_iterator it = md.begin() + cs.pos();
1031 s = s + asString(*it);
1032 LYXERR(Debug::FIND, "Stringified math: '" << s << "'");
1035 LYXERR(Debug::FIND, "Don't know how to stringify from here: " << cur);
1040 /** Computes the LaTeX export of buf starting from cur and ending len positions
1041 * after cur, if len is positive, or at the paragraph or innermost inset end
1044 docstring latexifyFromCursor(DocIterator const & cur, int len)
1046 LYXERR(Debug::FIND, "Latexifying with len=" << len << " from cursor at pos: " << cur);
1047 LYXERR(Debug::FIND, " with cur.lastpost=" << cur.lastpos() << ", cur.lastrow="
1048 << cur.lastrow() << ", cur.lastcol=" << cur.lastcol());
1049 Buffer const & buf = *cur.buffer();
1050 LBUFERR(buf.params().isLatex());
1052 TexRow texrow(false);
1053 odocstringstream ods;
1054 otexstream os(ods, texrow);
1055 OutputParams runparams(&buf.params().encoding());
1056 runparams.nice = false;
1057 runparams.flavor = OutputParams::LATEX;
1058 runparams.linelen = 8000; //lyxrc.plaintext_linelen;
1059 // No side effect of file copying and image conversion
1060 runparams.dryrun = true;
1062 if (cur.inTexted()) {
1063 // @TODO what about searching beyond/across paragraph breaks ?
1064 pos_type endpos = cur.paragraph().size();
1065 if (len != -1 && endpos > cur.pos() + len)
1066 endpos = cur.pos() + len;
1067 TeXOnePar(buf, *cur.innerText(), cur.pit(), os, runparams,
1068 string(), cur.pos(), endpos);
1069 LYXERR(Debug::FIND, "Latexified text: '" << lyx::to_utf8(ods.str()) << "'");
1070 } else if (cur.inMathed()) {
1071 // Retrieve the math environment type, and add '$' or '$[' or others (\begin{equation}) accordingly
1072 for (int s = cur.depth() - 1; s >= 0; --s) {
1073 CursorSlice const & cs = cur[s];
1074 if (cs.asInsetMath() && cs.asInsetMath()->asHullInset()) {
1076 cs.asInsetMath()->asHullInset()->header_write(ws);
1081 CursorSlice const & cs = cur.top();
1082 MathData md = cs.cell();
1083 MathData::const_iterator it_end =
1084 ((len == -1 || cs.pos() + len > int(md.size()))
1086 : md.begin() + cs.pos() + len);
1087 for (MathData::const_iterator it = md.begin() + cs.pos();
1089 ods << asString(*it);
1091 // Retrieve the math environment type, and add '$' or '$]'
1092 // or others (\end{equation}) accordingly
1093 for (int s = cur.depth() - 1; s >= 0; --s) {
1094 CursorSlice const & cs = cur[s];
1095 InsetMath * inset = cs.asInsetMath();
1096 if (inset && inset->asHullInset()) {
1098 inset->asHullInset()->footer_write(ws);
1102 LYXERR(Debug::FIND, "Latexified math: '" << lyx::to_utf8(ods.str()) << "'");
1104 LYXERR(Debug::FIND, "Don't know how to stringify from here: " << cur);
1110 /** Finalize an advanced find operation, advancing the cursor to the innermost
1111 ** position that matches, plus computing the length of the matching text to
1114 int findAdvFinalize(DocIterator & cur, MatchStringAdv const & match)
1116 // Search the foremost position that matches (avoids find of entire math
1117 // inset when match at start of it)
1119 DocIterator old_cur(cur.buffer());
1121 LYXERR(Debug::FIND, "Forwarding one step (searching for innermost match)");
1125 } while (cur && cur.depth() > d && match(cur) > 0);
1127 LASSERT(match(cur) > 0, return 0);
1128 LYXERR(Debug::FIND, "Ok");
1130 // Compute the match length
1132 if (cur.pos() + len > cur.lastpos())
1134 LYXERR(Debug::FIND, "verifying unmatch with len = " << len);
1135 while (cur.pos() + len <= cur.lastpos() && match(cur, len) == 0) {
1137 LYXERR(Debug::FIND, "verifying unmatch with len = " << len);
1139 // Length of matched text (different from len param)
1140 int old_len = match(cur, len);
1142 // Greedy behaviour while matching regexps
1143 while ((new_len = match(cur, len + 1)) > old_len) {
1146 LYXERR(Debug::FIND, "verifying match with len = " << len);
1153 int findForwardAdv(DocIterator & cur, MatchStringAdv & match)
1157 while (!theApp()->longOperationCancelled() && cur) {
1158 LYXERR(Debug::FIND, "findForwardAdv() cur: " << cur);
1159 int match_len = match(cur, -1, false);
1160 LYXERR(Debug::FIND, "match_len: " << match_len);
1162 for (; !theApp()->longOperationCancelled() && cur; cur.forwardPos()) {
1163 LYXERR(Debug::FIND, "Advancing cur: " << cur);
1164 int match_len = match(cur);
1165 LYXERR(Debug::FIND, "match_len: " << match_len);
1167 // Sometimes in finalize we understand it wasn't a match
1168 // and we need to continue the outest loop
1169 int len = findAdvFinalize(cur, match);
1177 if (cur.pit() < cur.lastpit()) {
1178 LYXERR(Debug::FIND, "Advancing par: cur=" << cur);
1181 // This should exit nested insets, if any, or otherwise undefine the currsor.
1182 cur.pos() = cur.lastpos();
1183 LYXERR(Debug::FIND, "Advancing pos: cur=" << cur);
1191 /// Find the most backward consecutive match within same paragraph while searching backwards.
1192 int findMostBackwards(DocIterator & cur, MatchStringAdv const & match)
1194 DocIterator cur_begin = doc_iterator_begin(cur.buffer());
1195 DocIterator tmp_cur = cur;
1196 int len = findAdvFinalize(tmp_cur, match);
1197 Inset & inset = cur.inset();
1198 for (; cur != cur_begin; cur.backwardPos()) {
1199 LYXERR(Debug::FIND, "findMostBackwards(): cur=" << cur);
1200 DocIterator new_cur = cur;
1201 new_cur.backwardPos();
1202 if (new_cur == cur || &new_cur.inset() != &inset || !match(new_cur))
1204 int new_len = findAdvFinalize(new_cur, match);
1209 LYXERR(Debug::FIND, "findMostBackwards(): exiting with cur=" << cur);
1215 int findBackwardsAdv(DocIterator & cur, MatchStringAdv & match)
1219 // Backup of original position
1220 DocIterator cur_begin = doc_iterator_begin(cur.buffer());
1221 if (cur == cur_begin)
1224 DocIterator cur_orig(cur);
1225 bool pit_changed = false;
1228 bool found_match = match(cur, -1, false);
1232 cur.pos() = cur.lastpos();
1234 cur.pos() = cur_orig.pos();
1235 LYXERR(Debug::FIND, "findBackAdv2: cur: " << cur);
1236 DocIterator cur_prev_iter;
1238 found_match = match(cur);
1239 LYXERR(Debug::FIND, "findBackAdv3: found_match="
1240 << found_match << ", cur: " << cur);
1242 return findMostBackwards(cur, match);
1244 // Stop if begin of document reached
1245 if (cur == cur_begin)
1247 cur_prev_iter = cur;
1251 if (cur == cur_begin)
1258 } while (!theApp()->longOperationCancelled());
1263 } // anonym namespace
1266 docstring stringifyFromForSearch(FindAndReplaceOptions const & opt,
1267 DocIterator const & cur, int len)
1269 LASSERT(cur.pos() >= 0 && cur.pos() <= cur.lastpos(),
1270 return docstring());
1271 if (!opt.ignoreformat)
1272 return latexifyFromCursor(cur, len);
1274 return stringifyFromCursor(cur, len);
1278 FindAndReplaceOptions::FindAndReplaceOptions(
1279 docstring const & find_buf_name, bool casesensitive,
1280 bool matchword, bool forward, bool expandmacros, bool ignoreformat,
1281 docstring const & repl_buf_name, bool keep_case,
1282 SearchScope scope, SearchRestriction restr)
1283 : find_buf_name(find_buf_name), casesensitive(casesensitive), matchword(matchword),
1284 forward(forward), expandmacros(expandmacros), ignoreformat(ignoreformat),
1285 repl_buf_name(repl_buf_name), keep_case(keep_case), scope(scope), restr(restr)
1293 /** Check if 'len' letters following cursor are all non-lowercase */
1294 static bool allNonLowercase(Cursor const & cur, int len)
1296 pos_type beg_pos = cur.selectionBegin().pos();
1297 pos_type end_pos = cur.selectionBegin().pos() + len;
1298 if (len > cur.lastpos() + 1 - beg_pos) {
1299 LYXERR(Debug::FIND, "This should not happen, more debug needed");
1300 len = cur.lastpos() + 1 - beg_pos;
1301 end_pos = beg_pos + len;
1303 for (pos_type pos = beg_pos; pos != end_pos; ++pos)
1304 if (isLowerCase(cur.paragraph().getChar(pos)))
1310 /** Check if first letter is upper case and second one is lower case */
1311 static bool firstUppercase(Cursor const & cur)
1314 pos_type pos = cur.selectionBegin().pos();
1315 if (pos >= cur.lastpos() - 1) {
1316 LYXERR(Debug::FIND, "No upper-case at cur: " << cur);
1319 ch1 = cur.paragraph().getChar(pos);
1320 ch2 = cur.paragraph().getChar(pos + 1);
1321 bool result = isUpperCase(ch1) && isLowerCase(ch2);
1322 LYXERR(Debug::FIND, "firstUppercase(): "
1323 << "ch1=" << ch1 << "(" << char(ch1) << "), ch2="
1324 << ch2 << "(" << char(ch2) << ")"
1325 << ", result=" << result << ", cur=" << cur);
1330 /** Make first letter of supplied buffer upper-case, and the rest lower-case.
1332 ** \fixme What to do with possible further paragraphs in replace buffer ?
1334 static void changeFirstCase(Buffer & buffer, TextCase first_case, TextCase others_case)
1336 ParagraphList::iterator pit = buffer.paragraphs().begin();
1337 LASSERT(pit->size() >= 1, /**/);
1338 pos_type right = pos_type(1);
1339 pit->changeCase(buffer.params(), pos_type(0), right, first_case);
1340 right = pit->size();
1341 pit->changeCase(buffer.params(), pos_type(1), right, others_case);
1347 static void findAdvReplace(BufferView * bv, FindAndReplaceOptions const & opt, MatchStringAdv & matchAdv)
1349 Cursor & cur = bv->cursor();
1350 if (opt.repl_buf_name == docstring())
1353 DocIterator sel_beg = cur.selectionBegin();
1354 DocIterator sel_end = cur.selectionEnd();
1355 if (&sel_beg.inset() != &sel_end.inset()
1356 || sel_beg.pit() != sel_end.pit()
1357 || sel_beg.idx() != sel_end.idx())
1359 int sel_len = sel_end.pos() - sel_beg.pos();
1360 LYXERR(Debug::FIND, "sel_beg: " << sel_beg << ", sel_end: " << sel_end
1361 << ", sel_len: " << sel_len << endl);
1364 LASSERT(sel_len > 0, return);
1366 if (!matchAdv(sel_beg, sel_len))
1369 // Build a copy of the replace buffer, adapted to the KeepCase option
1370 Buffer & repl_buffer_orig = *theBufferList().getBuffer(FileName(to_utf8(opt.repl_buf_name)), true);
1372 repl_buffer_orig.write(oss);
1373 string lyx = oss.str();
1374 Buffer repl_buffer("", false);
1375 repl_buffer.setUnnamed(true);
1376 LASSERT(repl_buffer.readString(lyx), return);
1377 if (opt.keep_case && sel_len >= 2) {
1378 LYXERR(Debug::FIND, "keep_case true: cur.pos()=" << cur.pos() << ", sel_len=" << sel_len);
1379 if (cur.inTexted()) {
1380 if (firstUppercase(cur))
1381 changeFirstCase(repl_buffer, text_uppercase, text_lowercase);
1382 else if (allNonLowercase(cur, sel_len))
1383 changeFirstCase(repl_buffer, text_uppercase, text_uppercase);
1386 cap::cutSelection(cur, false, false);
1387 if (cur.inTexted()) {
1388 repl_buffer.changeLanguage(
1389 repl_buffer.language(),
1390 cur.getFont().language());
1391 LYXERR(Debug::FIND, "Replacing by pasteParagraphList()ing repl_buffer");
1392 LYXERR(Debug::FIND, "Before pasteParagraphList() cur=" << cur << endl);
1393 cap::pasteParagraphList(cur, repl_buffer.paragraphs(),
1394 repl_buffer.params().documentClassPtr(),
1395 bv->buffer().errorList("Paste"));
1396 LYXERR(Debug::FIND, "After pasteParagraphList() cur=" << cur << endl);
1397 sel_len = repl_buffer.paragraphs().begin()->size();
1398 } else if (cur.inMathed()) {
1399 TexRow texrow(false);
1400 odocstringstream ods;
1401 otexstream os(ods, texrow);
1402 OutputParams runparams(&repl_buffer.params().encoding());
1403 runparams.nice = false;
1404 runparams.flavor = OutputParams::LATEX;
1405 runparams.linelen = 8000; //lyxrc.plaintext_linelen;
1406 runparams.dryrun = true;
1407 TeXOnePar(repl_buffer, repl_buffer.text(), 0, os, runparams);
1408 //repl_buffer.getSourceCode(ods, 0, repl_buffer.paragraphs().size(), false);
1409 docstring repl_latex = ods.str();
1410 LYXERR(Debug::FIND, "Latexified replace_buffer: '" << repl_latex << "'");
1412 regex_replace(to_utf8(repl_latex), s, "\\$(.*)\\$", "$1");
1413 regex_replace(s, s, "\\\\\\[(.*)\\\\\\]", "$1");
1414 repl_latex = from_utf8(s);
1415 LYXERR(Debug::FIND, "Replacing by insert()ing latex: '" << repl_latex << "' cur=" << cur << " with depth=" << cur.depth());
1416 MathData ar(cur.buffer());
1417 asArray(repl_latex, ar, Parse::NORMAL);
1419 sel_len = ar.size();
1420 LYXERR(Debug::FIND, "After insert() cur=" << cur << " with depth: " << cur.depth() << " and len: " << sel_len);
1422 if (cur.pos() >= sel_len)
1423 cur.pos() -= sel_len;
1426 LYXERR(Debug::FIND, "After pos adj cur=" << cur << " with depth: " << cur.depth() << " and len: " << sel_len);
1427 bv->putSelectionAt(DocIterator(cur), sel_len, !opt.forward);
1428 bv->processUpdateFlags(Update::Force);
1429 bv->buffer().updatePreviews();
1433 /// Perform a FindAdv operation.
1434 bool findAdv(BufferView * bv, FindAndReplaceOptions const & opt)
1440 MatchStringAdv matchAdv(bv->buffer(), opt);
1441 int length = bv->cursor().selectionEnd().pos() - bv->cursor().selectionBegin().pos();
1443 bv->putSelectionAt(bv->cursor().selectionBegin(), length, !opt.forward);
1444 findAdvReplace(bv, opt, matchAdv);
1447 match_len = findForwardAdv(cur, matchAdv);
1449 match_len = findBackwardsAdv(cur, matchAdv);
1451 // This may only be raised by lyx::regex()
1452 bv->message(_("Invalid regular expression!"));
1456 if (match_len == 0) {
1457 bv->message(_("Match not found!"));
1461 bv->message(_("Match found!"));
1463 LYXERR(Debug::FIND, "Putting selection at cur=" << cur << " with len: " << match_len);
1464 bv->putSelectionAt(cur, match_len, !opt.forward);
1470 ostringstream & operator<<(ostringstream & os, FindAndReplaceOptions const & opt)
1472 os << to_utf8(opt.find_buf_name) << "\nEOSS\n"
1473 << opt.casesensitive << ' '
1474 << opt.matchword << ' '
1475 << opt.forward << ' '
1476 << opt.expandmacros << ' '
1477 << opt.ignoreformat << ' '
1478 << to_utf8(opt.repl_buf_name) << "\nEOSS\n"
1479 << opt.keep_case << ' '
1480 << int(opt.scope) << ' '
1483 LYXERR(Debug::FIND, "built: " << os.str());
1489 istringstream & operator>>(istringstream & is, FindAndReplaceOptions & opt)
1491 LYXERR(Debug::FIND, "parsing");
1495 while (line != "EOSS") {
1499 if (is.eof()) // Tolerate malformed request
1503 LYXERR(Debug::FIND, "file_buf_name: '" << s << "'");
1504 opt.find_buf_name = from_utf8(s);
1505 is >> opt.casesensitive >> opt.matchword >> opt.forward >> opt.expandmacros >> opt.ignoreformat;
1506 is.get(); // Waste space before replace string
1509 while (line != "EOSS") {
1513 if (is.eof()) // Tolerate malformed request
1517 LYXERR(Debug::FIND, "repl_buf_name: '" << s << "'");
1518 opt.repl_buf_name = from_utf8(s);
1519 is >> opt.keep_case;
1522 opt.scope = FindAndReplaceOptions::SearchScope(i);
1524 opt.restr = FindAndReplaceOptions::SearchRestriction(i);
1526 LYXERR(Debug::FIND, "parsed: " << opt.casesensitive << ' ' << opt.matchword << ' ' << opt.forward << ' '
1527 << opt.expandmacros << ' ' << opt.ignoreformat << ' ' << opt.keep_case << ' '
1528 << opt.scope << ' ' << opt.restr);