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 "BufferParams.h"
22 #include "BufferView.h"
25 #include "CutAndPaste.h"
26 #include "FuncRequest.h"
27 #include "OutputParams.h"
28 #include "output_latex.h"
29 #include "Paragraph.h"
30 #include "ParIterator.h"
33 #include "FuncRequest.h"
36 #include "mathed/InsetMath.h"
37 #include "mathed/InsetMathGrid.h"
38 #include "mathed/InsetMathHull.h"
39 #include "mathed/MathStream.h"
41 #include "frontends/alert.h"
43 #include "support/convert.h"
44 #include "support/debug.h"
45 #include "support/docstream.h"
46 #include "support/gettext.h"
47 #include "support/lstrings.h"
48 #include "support/lassert.h"
50 #include <boost/regex.hpp>
51 #include <boost/next_prior.hpp>
54 using namespace lyx::support;
60 bool parse_bool(docstring & howto)
65 howto = split(howto, var, ' ');
70 class MatchString : public binary_function<Paragraph, pos_type, bool>
73 MatchString(docstring const & str, bool cs, bool mw)
74 : str(str), cs(cs), mw(mw)
77 // returns true if the specified string is at the specified position
78 // del specifies whether deleted strings in ct mode will be considered
79 bool operator()(Paragraph const & par, pos_type pos, bool del = true) const
81 return par.find(str, cs, mw, pos, del);
89 // match whole words only
94 bool findForward(DocIterator & cur, MatchString const & match,
97 for (; cur; cur.forwardChar())
99 match(cur.paragraph(), cur.pos(), find_del))
105 bool findBackwards(DocIterator & cur, MatchString const & match,
106 bool find_del = true)
110 if (cur.inTexted() &&
111 match(cur.paragraph(), cur.pos(), find_del))
118 bool findChange(DocIterator & cur, bool next)
122 for (; cur; next ? cur.forwardPos() : cur.backwardPos())
123 if (cur.inTexted() && cur.paragraph().isChanged(cur.pos())) {
125 // if we search backwards, take a step forward
126 // to correctly set the anchor
135 bool searchAllowed(BufferView * /*bv*/, docstring const & str)
138 frontend::Alert::error(_("Search error"), _("Search string is empty"));
145 bool find(BufferView * bv, docstring const & searchstr,
146 bool cs, bool mw, bool fw, bool find_del = true)
148 if (!searchAllowed(bv, searchstr))
151 DocIterator cur = bv->cursor();
153 MatchString const match(searchstr, cs, mw);
155 bool found = fw ? findForward(cur, match, find_del) :
156 findBackwards(cur, match, find_del);
159 bv->putSelectionAt(cur, searchstr.length(), !fw);
165 int replaceAll(BufferView * bv,
166 docstring const & searchstr, docstring const & replacestr,
169 Buffer & buf = bv->buffer();
171 if (!searchAllowed(bv, searchstr) || buf.isReadonly())
174 MatchString const match(searchstr, cs, mw);
177 int const rsize = replacestr.size();
178 int const ssize = searchstr.size();
181 cur.setCursor(doc_iterator_begin(&buf));
182 while (findForward(cur, match, false)) {
183 // Backup current cursor position and font.
184 pos_type const pos = cur.pos();
185 Font const font = cur.paragraph().getFontSettings(buf.params(), pos);
187 int striked = ssize - cur.paragraph().eraseChars(pos, pos + ssize,
188 buf.params().trackChanges);
189 cur.paragraph().insert(pos, replacestr, font,
190 Change(buf.params().trackChanges ?
191 Change::INSERTED : Change::UNCHANGED));
192 for (int i = 0; i < rsize + striked; ++i)
198 bv->putSelectionAt(doc_iterator_begin(&buf), 0, false);
205 bool stringSelected(BufferView * bv, docstring & searchstr,
206 bool cs, bool mw, bool fw)
208 // if nothing selected and searched string is empty, this
209 // means that we want to search current word at cursor position.
210 if (!bv->cursor().selection() && searchstr.empty()) {
211 bv->cursor().innerText()->selectWord(bv->cursor(), WHOLE_WORD);
212 searchstr = bv->cursor().selectionAsString(false);
216 // if nothing selected or selection does not equal search
217 // string search and select next occurance and return
218 docstring const & str1 = searchstr;
219 docstring const str2 = bv->cursor().selectionAsString(false);
220 if ((cs && str1 != str2) || compare_no_case(str1, str2) != 0) {
221 find(bv, searchstr, cs, mw, fw);
229 int replace(BufferView * bv, docstring & searchstr,
230 docstring const & replacestr, bool cs, bool mw, bool fw)
232 if (!stringSelected(bv, searchstr, cs, mw, fw))
235 if (!searchAllowed(bv, searchstr) || bv->buffer().isReadonly())
238 Cursor & cur = bv->cursor();
239 cap::replaceSelectionWithString(cur, replacestr, fw);
240 bv->buffer().markDirty();
241 find(bv, searchstr, cs, mw, fw, false);
242 bv->buffer().updateMacros();
243 bv->processUpdateFlags(Update::Force | Update::FitCursor);
251 docstring const find2string(docstring const & search,
252 bool casesensitive, bool matchword, bool forward)
256 << int(casesensitive) << ' '
257 << int(matchword) << ' '
263 docstring const replace2string(docstring const & replace,
264 docstring const & search, bool casesensitive, bool matchword,
265 bool all, bool forward)
268 ss << replace << '\n'
270 << int(casesensitive) << ' '
271 << int(matchword) << ' '
278 bool find(BufferView * bv, FuncRequest const & ev)
280 if (!bv || ev.action != LFUN_WORD_FIND)
283 //lyxerr << "find called, cmd: " << ev << endl;
285 // data is of the form
287 // <casesensitive> <matchword> <forward>"
289 docstring howto = split(ev.argument(), search, '\n');
291 bool casesensitive = parse_bool(howto);
292 bool matchword = parse_bool(howto);
293 bool forward = parse_bool(howto);
295 return find(bv, search, casesensitive, matchword, forward);
299 void replace(BufferView * bv, FuncRequest const & ev, bool has_deleted)
301 if (!bv || ev.action != LFUN_WORD_REPLACE)
304 // data is of the form
307 // <casesensitive> <matchword> <all> <forward>"
310 docstring howto = split(ev.argument(), rplc, '\n');
311 howto = split(howto, search, '\n');
313 bool casesensitive = parse_bool(howto);
314 bool matchword = parse_bool(howto);
315 bool all = parse_bool(howto);
316 bool forward = parse_bool(howto);
319 int const replace_count = all
320 ? replaceAll(bv, search, rplc, casesensitive, matchword)
321 : replace(bv, search, rplc, casesensitive, matchword, forward);
323 Buffer & buf = bv->buffer();
324 if (replace_count == 0) {
325 // emit message signal.
326 buf.message(_("String not found!"));
328 if (replace_count == 1) {
329 // emit message signal.
330 buf.message(_("String has been replaced."));
332 docstring str = convert<docstring>(replace_count);
333 str += _(" strings have been replaced.");
334 // emit message signal.
339 // if we have deleted characters, we do not replace at all, but
340 // rather search for the next occurence
341 if (find(bv, search, casesensitive, matchword, forward))
344 bv->message(_("String not found!"));
349 bool findNextChange(BufferView * bv)
351 return findChange(bv, true);
355 bool findPreviousChange(BufferView * bv)
357 return findChange(bv, false);
361 bool findChange(BufferView * bv, bool next)
363 if (bv->cursor().selection()) {
364 // set the cursor at the beginning or at the end of the selection
365 // before searching. Otherwise, the current change will be found.
366 if (next != (bv->cursor().top() > bv->cursor().anchor()))
367 bv->cursor().setCursorToAnchor();
370 DocIterator cur = bv->cursor();
372 // Are we within a change ? Then first search forward (backward),
373 // clear the selection and search the other way around (see the end
374 // of this function). This will avoid changes to be selected half.
375 bool search_both_sides = false;
377 Change change_next_pos
378 = cur.paragraph().lookupChange(cur.pos());
379 Change change_prev_pos
380 = cur.paragraph().lookupChange(cur.pos() - 1);
381 if (change_next_pos.isSimilarTo(change_prev_pos))
382 search_both_sides = true;
385 if (!findChange(cur, next))
388 bv->cursor().setCursor(cur);
389 bv->cursor().resetAnchor();
392 // take a step into the change
395 Change orig_change = cur.paragraph().lookupChange(cur.pos());
397 CursorSlice & tip = cur.top();
399 for (; !tip.at_end(); tip.forwardPos()) {
400 Change change = tip.paragraph().lookupChange(tip.pos());
401 if (change != orig_change)
405 for (; !tip.at_begin();) {
407 Change change = tip.paragraph().lookupChange(tip.pos());
408 if (change != orig_change) {
409 // take a step forward to correctly set the selection
416 // Now put cursor to end of selection:
417 bv->cursor().setCursor(cur);
418 bv->cursor().setSelection();
420 if (search_both_sides) {
421 bv->cursor().setSelection(false);
422 findChange(bv, !next);
430 typedef vector<pair<string, string> > Escapes;
432 /// A map of symbols and their escaped equivalent needed within a regex.
433 Escapes const & get_regexp_escapes()
435 static Escapes escape_map;
436 if (escape_map.empty()) {
437 escape_map.push_back(pair<string, string>("\\", "\\\\"));
438 escape_map.push_back(pair<string, string>("^", "\\^"));
439 escape_map.push_back(pair<string, string>("$", "\\$"));
440 escape_map.push_back(pair<string, string>("{", "\\{"));
441 escape_map.push_back(pair<string, string>("}", "\\}"));
442 escape_map.push_back(pair<string, string>("[", "\\["));
443 escape_map.push_back(pair<string, string>("]", "\\]"));
444 escape_map.push_back(pair<string, string>("(", "\\("));
445 escape_map.push_back(pair<string, string>(")", "\\)"));
446 escape_map.push_back(pair<string, string>("+", "\\+"));
447 escape_map.push_back(pair<string, string>("*", "\\*"));
448 escape_map.push_back(pair<string, string>(".", "\\."));
453 /// A map of lyx escaped strings and their unescaped equivalent.
454 Escapes const & get_lyx_unescapes() {
455 static Escapes escape_map;
456 if (escape_map.empty()) {
457 escape_map.push_back(pair<string, string>("{*}", "*"));
458 escape_map.push_back(pair<string, string>("{[}", "["));
459 escape_map.push_back(pair<string, string>("\\$", "$"));
460 escape_map.push_back(pair<string, string>("\\backslash{}", "\\"));
461 escape_map.push_back(pair<string, string>("\\backslash", "\\"));
462 escape_map.push_back(pair<string, string>("\\sim ", "~"));
463 escape_map.push_back(pair<string, string>("\\^", "^"));
468 /** @todo Probably the maps need to be migrated to regexps, in order to distinguish if
469 ** the found occurrence were escaped.
471 string apply_escapes(string s, Escapes const & escape_map)
473 LYXERR(Debug::DEBUG, "Escaping: '" << s << "'");
474 Escapes::const_iterator it;
475 for (it = escape_map.begin(); it != escape_map.end(); ++it) {
476 // LYXERR(Debug::DEBUG, "Escaping " << it->first << " as " << it->second);
477 unsigned int pos = 0;
478 while (pos < s.length() && (pos = s.find(it->first, pos)) < s.length()) {
479 s.replace(pos, it->first.length(), it->second);
480 // LYXERR(Debug::DEBUG, "After escape: " << s);
481 pos += it->second.length();
482 // LYXERR(Debug::DEBUG, "pos: " << pos);
485 LYXERR(Debug::DEBUG, "Escaped : '" << s << "'");
489 /** Return the position of the closing brace matching the open one at s[pos],
490 ** or s.size() if not found.
492 size_t find_matching_brace(string const & s, size_t pos)
494 LASSERT(s[pos] == '{', /* */);
496 for (++pos; pos < s.size(); ++pos) {
499 else if (s[pos] == '{')
501 else if (s[pos] == '}') {
503 if (open_braces == 0)
510 /// Within \regex{} apply get_regex_escapes(), while outside apply get_lyx_unescapes().
511 string escape_for_regex(string s)
514 while (pos < s.size()) {
515 size_t new_pos = s.find("\\regexp{", pos);
516 if (new_pos == string::npos)
518 LYXERR(Debug::DEBUG, "new_pos: " << new_pos);
519 string t = apply_escapes(s.substr(pos, new_pos - pos), get_lyx_unescapes());
520 LYXERR(Debug::DEBUG, "t : " << t);
521 t = apply_escapes(t, get_regexp_escapes());
522 s.replace(pos, new_pos - pos, t);
523 new_pos = pos + t.size();
524 LYXERR(Debug::DEBUG, "Regexp after escaping: " << s);
525 LYXERR(Debug::DEBUG, "new_pos: " << new_pos);
526 if (new_pos == s.size())
528 size_t end_pos = find_matching_brace(s, new_pos + 7);
529 LYXERR(Debug::DEBUG, "end_pos: " << end_pos);
530 t = apply_escapes(s.substr(new_pos + 8, end_pos - (new_pos + 8)), get_lyx_unescapes());
531 LYXERR(Debug::DEBUG, "t : " << t);
532 if (end_pos == s.size()) {
533 s.replace(new_pos, end_pos - new_pos, t);
535 LYXERR(Debug::DEBUG, "Regexp after \\regexp{} removal: " << s);
538 s.replace(new_pos, end_pos + 1 - new_pos, t);
539 LYXERR(Debug::DEBUG, "Regexp after \\regexp{} removal: " << s);
540 pos = new_pos + t.size();
541 LYXERR(Debug::DEBUG, "pos: " << pos);
546 /// Wrapper for boost::regex_replace with simpler interface
547 bool regex_replace(string const & s, string & t, string const & searchstr,
548 string const & replacestr)
550 boost::regex e(searchstr);
552 ostream_iterator<char, char> it(oss);
553 boost::regex_replace(it, s.begin(), s.end(), e, replacestr);
554 // tolerate t and s be references to the same variable
555 bool rv = (s != oss.str());
560 /** Checks if supplied string segment is well-formed from the standpoint of matching open-closed braces.
562 ** Verify that closed braces exactly match open braces. This avoids that, for example,
563 ** \frac{.*}{x} matches \frac{x+\frac{y}{x}}{z} with .* being 'x+\frac{y'.
566 ** Number of open braces that must remain open at the end for the verification to succeed.
568 bool braces_match(string::const_iterator const & beg,
569 string::const_iterator const & end, int unmatched = 0)
572 string::const_iterator it = beg;
573 LYXERR(Debug::DEBUG, "Checking " << unmatched << " unmatched braces in '" << string(beg, end) << "'");
574 for (; it != end; ++it) {
575 // Skip escaped braces in the count
580 } else if (*it == '{') {
582 } else if (*it == '}') {
583 if (open_pars == 0) {
584 LYXERR(Debug::DEBUG, "Found unmatched closed brace");
590 if (open_pars != unmatched) {
591 LYXERR(Debug::DEBUG, "Found " << open_pars << " instead of " << unmatched << " unmatched open braces at the end of count");
594 LYXERR(Debug::DEBUG, "Braces match as expected");
598 /** The class performing a match between a position in the document and the FindAdvOptions.
600 ** @todo The user-entered regexp expression(s) should be enclosed within something like \regexp{},
601 ** to be written by a dedicated Inset, so to avoid escaping it in escape_for_regex().
603 class MatchStringAdv {
605 MatchStringAdv(lyx::Buffer const & buf, FindAndReplaceOptions const & opt);
607 /** Tests if text starting at the supplied position matches with the one provided to the MatchStringAdv
608 ** constructor as opt.search, under the opt.* options settings.
611 ** If set, then match is searched only against beginning of text starting at cur.
612 ** If unset, then match is searched anywhere in text starting at cur.
615 ** The length of the matching text, or zero if no match was found.
617 int operator()(DocIterator const & cur, int len = -1, bool at_begin = true) const;
621 lyx::Buffer const & buf;
623 FindAndReplaceOptions const & opt;
626 /** Normalize a stringified or latexified LyX paragraph.
630 ** <li>if search is not casesensitive, then lowercase the string;
631 ** <li>remove any newline at begin or end of the string;
632 ** <li>replace any newline in the middle of the string with a simple space;
633 ** <li>remove stale empty styles and environments, like \emph{} and \textbf{}.
636 ** @todo Normalization should also expand macros, if the corresponding
637 ** search option was checked.
639 string normalize(docstring const & s) const;
640 // normalized string to search
641 string par_as_string;
642 // regular expression to use for searching
644 // same as regexp, but prefixed with a ".*"
645 boost::regex regexp2;
646 // unmatched open braces in the search string/regexp
648 // number of (.*?) subexpressions added at end of search regexp for closing
649 // environments, math mode, styles, etc...
654 MatchStringAdv::MatchStringAdv(lyx::Buffer const & buf, FindAndReplaceOptions const & opt)
657 par_as_string = normalize(opt.search);
662 // Remove trailing closure of math, macros and environments, so to catch parts of them.
664 LYXERR(Debug::DEBUG, "par_as_string now is '" << par_as_string << "'");
665 if (regex_replace(par_as_string, par_as_string, "(.*)[[:blank:]]\\'", "$1"))
667 if (regex_replace(par_as_string, par_as_string, "(.*[^\\\\]) ?\\$\\'", "$1"))
669 // @todo need to account for open square braces as well ?
670 if (regex_replace(par_as_string, par_as_string, "(.*[^\\\\]) ?\\\\\\]\\'", "$1"))
672 if (regex_replace(par_as_string, par_as_string, "(.*[^\\\\]) ?\\\\end\\{[a-zA-Z_]*\\}\\'", "$1"))
674 if (regex_replace(par_as_string, par_as_string, "(.*[^\\\\]) ?\\}\\'", "$1")) {
680 LYXERR(Debug::DEBUG, "Open braces: " << open_braces);
681 LASSERT(braces_match(par_as_string.begin(), par_as_string.end(), open_braces), /* */);
682 LYXERR(Debug::DEBUG, "Built MatchStringAdv object: par_as_string = '" << par_as_string << "'");
684 par_as_string = escape_for_regex(par_as_string);
685 // Insert (.*?) before trailing closure of math, macros and environments, so to catch parts of them.
686 LYXERR(Debug::DEBUG, "par_as_string now is '" << par_as_string << "'");
688 // Insert .* before trailing '\$' ('$' has been escaped by escape_for_regex)
689 regex_replace(par_as_string, par_as_string, "(.*[^\\\\])(\\\\\\$)\\'", "$1(.*?)$2")
690 // Insert .* before trailing '\\\]' ('\]' has been escaped by escape_for_regex)
691 || regex_replace(par_as_string, par_as_string, "(.*[^\\\\])(\\\\\\\\\\\\\\])\\'", "$1(.*?)$2")
692 // Insert .* before trailing '\\end\{...}' ('\end{...}' has been escaped by escape_for_regex)
693 || regex_replace(par_as_string, par_as_string, "(.*[^\\\\])(\\\\\\\\end\\\\\\{[a-zA-Z_]*\\\\\\})\\'", "$1(.*?)$2")
694 // Insert .* before trailing '\}' ('}' has been escaped by escape_for_regex)
695 || regex_replace(par_as_string, par_as_string, "(.*[^\\\\])(\\\\\\})\\'", "$1(.*?)$2")
699 LYXERR(Debug::DEBUG, "par_as_string now is '" << par_as_string << "'");
700 LYXERR(Debug::DEBUG, "Open braces: " << open_braces);
701 LYXERR(Debug::DEBUG, "Close .*? : " << close_wildcards);
702 LASSERT(braces_match(par_as_string.begin(), par_as_string.end(), open_braces), /* */);
703 // Entered regexp must match at begin of searched string buffer
704 par_as_string = string("\\`") + par_as_string;
705 LYXERR(Debug::DEBUG, "Replaced text (to be used as regex): " << par_as_string);
706 regexp = boost::regex(par_as_string);
707 regexp2 = boost::regex(string(".*") + par_as_string);
712 int MatchStringAdv::operator()(DocIterator const & cur, int len, bool at_begin) const
714 docstring docstr = stringifyFromForSearch(opt, cur, len);
715 LYXERR(Debug::DEBUG, "Matching against '" << lyx::to_utf8(docstr) << "'");
716 string str = normalize(docstr);
717 LYXERR(Debug::DEBUG, "After normalization: '" << str << "'");
720 if (str.substr(0, par_as_string.size()) == par_as_string)
721 return par_as_string.size();
723 size_t pos = str.find(par_as_string);
724 if (pos != string::npos)
725 return par_as_string.size();
728 // Try all possible regexp matches, until one that verifies the braces match test is found
729 boost::regex const *p_regexp = at_begin ? ®exp : ®exp2;
730 boost::sregex_iterator re_it(str.begin(), str.end(), *p_regexp);
731 boost::sregex_iterator re_it_end;
732 for (; re_it != re_it_end; ++re_it) {
733 boost::match_results<string::const_iterator> const & m = *re_it;
734 // Check braces on the segment that matched the entire regexp expression,
735 // plus the last subexpression, if a (.*?) was inserted in the constructor.
736 if (! braces_match(m[0].first, m[0].second, open_braces))
738 // Check braces on segments that matched all (.*?) subexpressions.
739 for (size_t i = 1; i < m.size(); ++i)
740 if (! braces_match(m[i].first, m[i].second))
742 // Exclude from the returned match length any length due to close wildcards added at end of regexp
743 if (close_wildcards == 0)
744 return m[0].second - m[0].first;
746 return m[m.size() - close_wildcards].first - m[0].first;
753 string MatchStringAdv::normalize(docstring const & s) const
756 if (! opt.casesensitive)
757 t = lyx::to_utf8(lowercase(s));
760 // Remove \n at begin
761 while (t.size() > 0 && t[0] == '\n')
764 while (t.size() > 0 && t[t.size() - 1] == '\n')
765 t = t.substr(0, t.size() - 1);
767 // Replace all other \n with spaces
768 while ((pos = t.find("\n")) != string::npos)
769 t.replace(pos, 1, " ");
770 // Remove stale empty \emph{}, \textbf{} and similar blocks from latexify
771 while (regex_replace(t, t, "\\\\[a-zA-Z_]+(\\{\\})+", ""))
777 docstring stringifyFromCursor(DocIterator const & cur, int len)
779 LYXERR(Debug::DEBUG, "Stringifying with len=" << len << " from cursor at pos: " << cur);
780 if (cur.inTexted()) {
781 Paragraph const & par = cur.paragraph();
782 // TODO what about searching beyond/across paragraph breaks ?
783 // TODO Try adding a AS_STR_INSERTS as last arg
784 pos_type end = ( len == -1 || cur.pos() + len > int(par.size()) ) ? int(par.size()) : cur.pos() + len;
785 OutputParams runparams(&cur.buffer()->params().encoding());
787 runparams.nice = true;
788 runparams.flavor = OutputParams::LATEX;
789 runparams.linelen = 100000; //lyxrc.plaintext_linelen;
790 // No side effect of file copying and image conversion
791 runparams.dryrun = true;
792 LYXERR(Debug::DEBUG, "Stringifying with cur: " << cur << ", from pos: " << cur.pos() << ", end: " << end);
793 return par.stringify(cur.pos(), end, AS_STR_INSETS, runparams);
794 } else if (cur.inMathed()) {
796 CursorSlice cs = cur.top();
797 MathData md = cs.cell();
798 MathData::const_iterator it_end = ( ( len == -1 || cs.pos() + len > int(md.size()) ) ? md.end() : md.begin() + cs.pos() + len );
799 for (MathData::const_iterator it = md.begin() + cs.pos(); it != it_end; ++it)
803 LYXERR(Debug::DEBUG, "Don't know how to stringify from here: " << cur);
807 /** Computes the LaTeX export of buf starting from cur and ending len positions
808 * after cur, if len is positive, or at the paragraph or innermost inset end
812 docstring latexifyFromCursor(DocIterator const & cur, int len)
814 LYXERR(Debug::DEBUG, "Latexifying with len=" << len << " from cursor at pos: " << cur);
815 LYXERR(Debug::DEBUG, " with cur.lastpost=" << cur.lastpos() << ", cur.lastrow="
816 << cur.lastrow() << ", cur.lastcol=" << cur.lastcol());
817 Buffer const & buf = *cur.buffer();
818 LASSERT(buf.isLatex(), /* */);
821 odocstringstream ods;
822 OutputParams runparams(&buf.params().encoding());
823 runparams.nice = false;
824 runparams.flavor = OutputParams::LATEX;
825 runparams.linelen = 8000; //lyxrc.plaintext_linelen;
826 // No side effect of file copying and image conversion
827 runparams.dryrun = true;
829 if (cur.inTexted()) {
830 // @TODO what about searching beyond/across paragraph breaks ?
831 ParagraphList::const_iterator pit = cur.innerText()->paragraphs().begin();
832 for (int i = 0; i < cur.pit(); ++i)
834 // ParagraphList::const_iterator pit_end = pit;
836 // lyx::latexParagraphs(buf, cur.innerText()->paragraphs(), ods, texrow, runparams, string(), pit, pit_end);
837 pos_type const endpos = (len == -1 || cur.pos() + len > int(pit->size()))
838 ? pit->size() : cur.pos() + len;
839 TeXOnePar(buf, *cur.innerText(), pit, ods, texrow, runparams, string(),
841 LYXERR(Debug::DEBUG, "Latexified text: '" << lyx::to_utf8(ods.str()) << "'");
842 } else if (cur.inMathed()) {
843 // Retrieve the math environment type, and add '$' or '$[' or others (\begin{equation}) accordingly
844 for (int s = cur.depth() - 1; s >= 0; --s) {
845 CursorSlice const & cs = cur[s];
846 if (cs.asInsetMath() && cs.asInsetMath() && cs.asInsetMath()->asHullInset()) {
848 cs.asInsetMath()->asHullInset()->header_write(ws);
853 CursorSlice const & cs = cur.top();
854 MathData md = cs.cell();
855 MathData::const_iterator it_end = ( ( len == -1 || cs.pos() + len > int(md.size()) )
856 ? md.end() : md.begin() + cs.pos() + len );
857 for (MathData::const_iterator it = md.begin() + cs.pos(); it != it_end; ++it)
860 // MathData md = cur.cell();
861 // MathData::const_iterator it_end = ( ( len == -1 || cur.pos() + len > int(md.size()) ) ? md.end() : md.begin() + cur.pos() + len );
862 // for (MathData::const_iterator it = md.begin() + cur.pos(); it != it_end; ++it) {
863 // MathAtom const & ma = *it;
864 // ma.nucleus()->latex(buf, ods, runparams);
867 // Retrieve the math environment type, and add '$' or '$]'
868 // or others (\end{equation}) accordingly
869 for (int s = cur.depth() - 1; s >= 0; --s) {
870 CursorSlice const & cs = cur[s];
871 InsetMath * inset = cs.asInsetMath();
872 if (inset && inset->asHullInset()) {
874 inset->asHullInset()->footer_write(ws);
878 LYXERR(Debug::DEBUG, "Latexified math: '" << lyx::to_utf8(ods.str()) << "'");
880 LYXERR(Debug::DEBUG, "Don't know how to stringify from here: " << cur);
885 /** Finalize an advanced find operation, advancing the cursor to the innermost
886 ** position that matches, plus computing the length of the matching text to
889 int findAdvFinalize(DocIterator & cur, MatchStringAdv const & match)
891 // Search the foremost position that matches (avoids find of entire math
892 // inset when match at start of it)
894 DocIterator old_cur(cur.buffer());
896 LYXERR(Debug::DEBUG, "Forwarding one step (searching for innermost match)");
900 } while (cur && cur.depth() > d && match(cur) > 0);
902 LASSERT(match(cur) > 0, /* */);
903 LYXERR(Debug::DEBUG, "Ok");
905 // Compute the match length
907 LYXERR(Debug::DEBUG, "verifying unmatch with len = " << len);
908 while (cur.pos() + len <= cur.lastpos() && match(cur, len) == 0) {
910 LYXERR(Debug::DEBUG, "verifying unmatch with len = " << len);
912 // Length of matched text (different from len param)
913 int old_len = match(cur, len);
915 // Greedy behaviour while matching regexps
916 while ((new_len = match(cur, len + 1)) > old_len) {
919 LYXERR(Debug::DEBUG, "verifying match with len = " << len);
926 int findForwardAdv(DocIterator & cur, MatchStringAdv const & match)
932 while (cur && !match(cur, -1, false)) {
933 if (cur.pit() < cur.lastpit())
939 for (; cur; cur.forwardPos()) {
941 return findAdvFinalize(cur, match);
943 wrap_answer = frontend::Alert::prompt(
945 _("End of document reached while searching forward\n"
947 "Continue searching from beginning ?"),
948 0, 1, _("&Yes"), _("&No"));
950 cur.push_back(CursorSlice(match.buf.inset()));
951 } while (wrap_answer == 0);
957 int findBackwardsAdv(DocIterator & cur, MatchStringAdv const & match) {
958 // if (cur.pos() > 0 || cur.depth() > 0)
959 // cur.backwardPos();
960 DocIterator cur_orig(cur);
962 findAdvFinalize(cur_orig, match);
963 // int total = cur.bottom().pit() + 1;
966 // TODO No ! così non va.
967 bool pit_changed = false;
968 while (cur && !match(cur, -1, false)) {
978 if (cur && pit_changed)
979 cur.pos() = cur.lastpos();
980 for (; cur; cur.backwardPos()) {
982 // Find the most backward consecutive match within same paragraph while searching backwards.
986 int len = findAdvFinalize(cur, match);
991 LYXERR(Debug::DEBUG, "old_cur: " << old_cur << ", old_len=" << len << ", cur: " << cur);
992 } while (cur && cur.pit() == pit && match(cur)
993 && (len = findAdvFinalize(cur, match)) > old_len);
996 LYXERR(Debug::DEBUG, "cur_orig : " << cur_orig);
997 LYXERR(Debug::DEBUG, "cur : " << cur);
1002 wrap_answer = frontend::Alert::prompt(
1004 _("Beginning of document reached while searching backwards\n"
1006 "Continue searching from end ?"),
1007 0, 1, _("&Yes"), _("&No"));
1008 cur = doc_iterator_end(&match.buf);
1010 } while (wrap_answer == 0);
1014 } // anonym namespace
1017 docstring stringifyFromForSearch(FindAndReplaceOptions const & opt,
1018 DocIterator const & cur, int len)
1020 if (!opt.ignoreformat)
1021 return latexifyFromCursor(cur, len);
1023 return stringifyFromCursor(cur, len);
1027 lyx::FindAndReplaceOptions::FindAndReplaceOptions(docstring const & search, bool casesensitive,
1028 bool matchword, bool forward, bool expandmacros, bool ignoreformat,
1029 bool regexp, docstring const & replace)
1030 : search(search), casesensitive(casesensitive), matchword(matchword),
1031 forward(forward), expandmacros(expandmacros), ignoreformat(ignoreformat),
1032 regexp(regexp), replace(replace)
1036 /// Perform a FindAdv operation.
1037 bool findAdv(BufferView * bv, FindAndReplaceOptions const & opt)
1039 DocIterator cur = bv->cursor();
1042 if (opt.search.empty()) {
1043 bv->message(_("Search text is empty!"));
1046 // if (! bv->buffer()) {
1047 // bv->message(_("No open document !"));
1052 MatchStringAdv const matchAdv(bv->buffer(), opt);
1054 match_len = findForwardAdv(cur, matchAdv);
1056 match_len = findBackwardsAdv(cur, matchAdv);
1058 // This may only be raised by boost::regex()
1059 bv->message(_("Invalid regular expression!"));
1063 if (match_len == 0) {
1064 bv->message(_("Match not found!"));
1068 LYXERR(Debug::DEBUG, "Putting selection at " << cur << " with len: " << match_len);
1069 bv->putSelectionAt(cur, match_len, ! opt.forward);
1070 bv->message(_("Match found!"));
1071 if (opt.replace != docstring(from_utf8(LYX_FR_NULL_STRING))) {
1072 dispatch(FuncRequest(LFUN_SELF_INSERT, opt.replace));
1079 void findAdv(BufferView * bv, FuncRequest const & ev)
1081 if (!bv || ev.action != LFUN_WORD_FINDADV)
1084 FindAndReplaceOptions opt;
1085 istringstream iss(to_utf8(ev.argument()));
1091 ostringstream & operator<<(ostringstream & os, lyx::FindAndReplaceOptions const & opt)
1093 os << to_utf8(opt.search) << "\nEOSS\n"
1094 << opt.casesensitive << ' '
1095 << opt.matchword << ' '
1096 << opt.forward << ' '
1097 << opt.expandmacros << ' '
1098 << opt.ignoreformat << ' '
1099 << opt.regexp << ' '
1100 << to_utf8(opt.replace) << "\nEOSS\n";
1102 LYXERR(Debug::DEBUG, "built: " << os.str());
1107 istringstream & operator>>(istringstream & is, lyx::FindAndReplaceOptions & opt)
1109 LYXERR(Debug::DEBUG, "parsing");
1113 while (line != "EOSS") {
1117 if (is.eof()) // Tolerate malformed request
1121 LYXERR(Debug::DEBUG, "searching for: '" << s << "'");
1122 opt.search = from_utf8(s);
1123 is >> opt.casesensitive >> opt.matchword >> opt.forward >> opt.expandmacros >> opt.ignoreformat >> opt.regexp;
1124 is.get(); // Waste space before replace string
1127 while (line != "EOSS") {
1131 if (is.eof()) // Tolerate malformed request
1135 LYXERR(Debug::DEBUG, "parsed: " << opt.casesensitive << ' ' << opt.matchword << ' ' << opt.forward << ' '
1136 << opt.expandmacros << ' ' << opt.ignoreformat << ' ' << opt.regexp);
1137 LYXERR(Debug::DEBUG, "replacing with: '" << s << "'");
1138 opt.replace = from_utf8(s);