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().isUnchanged(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 const & searchstr,
206 bool cs, bool mw, bool fw)
208 // if nothing selected or selection does not equal search
209 // string search and select next occurance and return
210 docstring const & str1 = searchstr;
211 docstring const str2 = bv->cursor().selectionAsString(false);
212 if ((cs && str1 != str2) || compare_no_case(str1, str2) != 0) {
213 find(bv, searchstr, cs, mw, fw);
221 int replace(BufferView * bv, docstring const & searchstr,
222 docstring const & replacestr, bool cs, bool mw, bool fw)
224 if (!searchAllowed(bv, searchstr) || bv->buffer().isReadonly())
227 if (!stringSelected(bv, searchstr, cs, mw, fw))
230 Cursor & cur = bv->cursor();
231 cap::replaceSelectionWithString(cur, replacestr, fw);
232 bv->buffer().markDirty();
233 find(bv, searchstr, cs, mw, fw, false);
234 bv->buffer().updateMacros();
235 bv->processUpdateFlags(Update::Force | Update::FitCursor);
243 docstring const find2string(docstring const & search,
244 bool casesensitive, bool matchword, bool forward)
248 << int(casesensitive) << ' '
249 << int(matchword) << ' '
255 docstring const replace2string(docstring const & search, docstring const & replace,
256 bool casesensitive, bool matchword,
257 bool all, bool forward)
262 << int(casesensitive) << ' '
263 << int(matchword) << ' '
270 bool find(BufferView * bv, FuncRequest const & ev)
272 if (!bv || ev.action != LFUN_WORD_FIND)
275 //lyxerr << "find called, cmd: " << ev << endl;
277 // data is of the form
279 // <casesensitive> <matchword> <forward>"
281 docstring howto = split(ev.argument(), search, '\n');
283 bool casesensitive = parse_bool(howto);
284 bool matchword = parse_bool(howto);
285 bool forward = parse_bool(howto);
287 return find(bv, search, casesensitive, matchword, forward);
291 void replace(BufferView * bv, FuncRequest const & ev, bool has_deleted)
293 if (!bv || ev.action != LFUN_WORD_REPLACE)
296 // data is of the form
299 // <casesensitive> <matchword> <all> <forward>"
302 docstring howto = split(ev.argument(), search, '\n');
303 howto = split(howto, rplc, '\n');
305 bool casesensitive = parse_bool(howto);
306 bool matchword = parse_bool(howto);
307 bool all = parse_bool(howto);
308 bool forward = parse_bool(howto);
311 int const replace_count = all
312 ? replaceAll(bv, search, rplc, casesensitive, matchword)
313 : replace(bv, search, rplc, casesensitive, matchword, forward);
315 Buffer & buf = bv->buffer();
316 if (replace_count == 0) {
317 // emit message signal.
318 buf.message(_("String not found!"));
320 if (replace_count == 1) {
321 // emit message signal.
322 buf.message(_("String has been replaced."));
324 docstring str = convert<docstring>(replace_count);
325 str += _(" strings have been replaced.");
326 // emit message signal.
331 // if we have deleted characters, we do not replace at all, but
332 // rather search for the next occurence
333 if (find(bv, search, casesensitive, matchword, forward))
336 bv->message(_("String not found!"));
341 bool findNextChange(BufferView * bv)
343 return findChange(bv, true);
347 bool findPreviousChange(BufferView * bv)
349 return findChange(bv, false);
353 bool findChange(BufferView * bv, bool next)
355 if (bv->cursor().selection()) {
356 // set the cursor at the beginning or at the end of the selection
357 // before searching. Otherwise, the current change will be found.
358 if (next != bv->cursor().top() > bv->cursor().anchor())
359 bv->cursor().setCursorToAnchor();
362 DocIterator cur = bv->cursor();
364 // Are we within a change ? Then first search forward (backward),
365 // clear the selection and search the other way around (see the end
366 // of this function). This will avoid changes to be selected half.
367 bool search_both_sides = false;
369 Change change_next_pos
370 = cur.paragraph().lookupChange(cur.pos());
371 Change change_prev_pos
372 = cur.paragraph().lookupChange(cur.pos() - 1);
373 if (change_next_pos.isSimilarTo(change_prev_pos))
374 search_both_sides = true;
377 if (!findChange(cur, next))
380 bv->cursor().setCursor(cur);
381 bv->cursor().resetAnchor();
384 // take a step into the change
387 Change orig_change = cur.paragraph().lookupChange(cur.pos());
389 CursorSlice & tip = cur.top();
391 for (; !tip.at_end(); tip.forwardPos()) {
392 Change change = tip.paragraph().lookupChange(tip.pos());
393 if (change != orig_change)
397 for (; !tip.at_begin();) {
399 Change change = tip.paragraph().lookupChange(tip.pos());
400 if (change != orig_change) {
401 // take a step forward to correctly set the selection
408 // Now put cursor to end of selection:
409 bv->cursor().setCursor(cur);
410 bv->cursor().setSelection();
412 if (search_both_sides) {
413 bv->cursor().setSelection(false);
414 findChange(bv, !next);
422 typedef vector<pair<string, string> > Escapes;
424 /// A map of symbols and their escaped equivalent needed within a regex.
425 Escapes const & get_regexp_escapes()
427 static Escapes escape_map;
428 if (escape_map.empty()) {
429 escape_map.push_back(pair<string, string>("\\", "\\\\"));
430 escape_map.push_back(pair<string, string>("^", "\\^"));
431 escape_map.push_back(pair<string, string>("$", "\\$"));
432 escape_map.push_back(pair<string, string>("{", "\\{"));
433 escape_map.push_back(pair<string, string>("}", "\\}"));
434 escape_map.push_back(pair<string, string>("[", "\\["));
435 escape_map.push_back(pair<string, string>("]", "\\]"));
436 escape_map.push_back(pair<string, string>("(", "\\("));
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>(".", "\\."));
445 /// A map of lyx escaped strings and their unescaped equivalent.
446 Escapes const & get_lyx_unescapes() {
447 static Escapes escape_map;
448 if (escape_map.empty()) {
449 escape_map.push_back(pair<string, string>("{*}", "*"));
450 escape_map.push_back(pair<string, string>("{[}", "["));
451 escape_map.push_back(pair<string, string>("\\$", "$"));
452 escape_map.push_back(pair<string, string>("\\backslash{}", "\\"));
453 escape_map.push_back(pair<string, string>("\\backslash", "\\"));
454 escape_map.push_back(pair<string, string>("\\sim ", "~"));
455 escape_map.push_back(pair<string, string>("\\^", "^"));
460 /** @todo Probably the maps need to be migrated to regexps, in order to distinguish if
461 ** the found occurrence were escaped.
463 string apply_escapes(string s, Escapes const & escape_map)
465 LYXERR(Debug::DEBUG, "Escaping: '" << s << "'");
466 Escapes::const_iterator it;
467 for (it = escape_map.begin(); it != escape_map.end(); ++it) {
468 // LYXERR(Debug::DEBUG, "Escaping " << it->first << " as " << it->second);
469 unsigned int pos = 0;
470 while (pos < s.length() && (pos = s.find(it->first, pos)) < s.length()) {
471 s.replace(pos, it->first.length(), it->second);
472 // LYXERR(Debug::DEBUG, "After escape: " << s);
473 pos += it->second.length();
474 // LYXERR(Debug::DEBUG, "pos: " << pos);
477 LYXERR(Debug::DEBUG, "Escaped : '" << s << "'");
481 /** Return the position of the closing brace matching the open one at s[pos],
482 ** or s.size() if not found.
484 size_t find_matching_brace(string const & s, size_t pos)
486 LASSERT(s[pos] == '{', /* */);
488 for (++pos; pos < s.size(); ++pos) {
491 else if (s[pos] == '{')
493 else if (s[pos] == '}') {
495 if (open_braces == 0)
502 /// Within \regex{} apply get_regex_escapes(), while outside apply get_lyx_unescapes().
503 string escape_for_regex(string s)
506 while (pos < s.size()) {
507 size_t new_pos = s.find("\\regexp{", pos);
508 if (new_pos == string::npos)
510 LYXERR(Debug::DEBUG, "new_pos: " << new_pos);
511 string t = apply_escapes(s.substr(pos, new_pos - pos), get_lyx_unescapes());
512 LYXERR(Debug::DEBUG, "t : " << t);
513 t = apply_escapes(t, get_regexp_escapes());
514 s.replace(pos, new_pos - pos, t);
515 new_pos = pos + t.size();
516 LYXERR(Debug::DEBUG, "Regexp after escaping: " << s);
517 LYXERR(Debug::DEBUG, "new_pos: " << new_pos);
518 if (new_pos == s.size())
520 size_t end_pos = find_matching_brace(s, new_pos + 7);
521 LYXERR(Debug::DEBUG, "end_pos: " << end_pos);
522 t = apply_escapes(s.substr(new_pos + 8, end_pos - (new_pos + 8)), get_lyx_unescapes());
523 LYXERR(Debug::DEBUG, "t : " << t);
524 if (end_pos == s.size()) {
525 s.replace(new_pos, end_pos - new_pos, t);
527 LYXERR(Debug::DEBUG, "Regexp after \\regexp{} removal: " << s);
530 s.replace(new_pos, end_pos + 1 - new_pos, t);
531 LYXERR(Debug::DEBUG, "Regexp after \\regexp{} removal: " << s);
532 pos = new_pos + t.size();
533 LYXERR(Debug::DEBUG, "pos: " << pos);
538 /// Wrapper for boost::regex_replace with simpler interface
539 bool regex_replace(string const & s, string & t, string const & searchstr,
540 string const & replacestr)
542 boost::regex e(searchstr);
544 ostream_iterator<char, char> it(oss);
545 boost::regex_replace(it, s.begin(), s.end(), e, replacestr);
546 // tolerate t and s be references to the same variable
547 bool rv = (s != oss.str());
552 /** Checks if supplied string segment is well-formed from the standpoint of matching open-closed braces.
554 ** Verify that closed braces exactly match open braces. This avoids that, for example,
555 ** \frac{.*}{x} matches \frac{x+\frac{y}{x}}{z} with .* being 'x+\frac{y'.
558 ** Number of open braces that must remain open at the end for the verification to succeed.
560 bool braces_match(string::const_iterator const & beg,
561 string::const_iterator const & end, int unmatched = 0)
564 string::const_iterator it = beg;
565 LYXERR(Debug::DEBUG, "Checking " << unmatched << " unmatched braces in '" << string(beg, end) << "'");
566 for (; it != end; ++it) {
567 // Skip escaped braces in the count
572 } else if (*it == '{') {
574 } else if (*it == '}') {
575 if (open_pars == 0) {
576 LYXERR(Debug::DEBUG, "Found unmatched closed brace");
582 if (open_pars != unmatched) {
583 LYXERR(Debug::DEBUG, "Found " << open_pars << " instead of " << unmatched << " unmatched open braces at the end of count");
586 LYXERR(Debug::DEBUG, "Braces match as expected");
590 /** The class performing a match between a position in the document and the FindAdvOptions.
592 ** @todo The user-entered regexp expression(s) should be enclosed within something like \regexp{},
593 ** to be written by a dedicated Inset, so to avoid escaping it in escape_for_regex().
595 class MatchStringAdv {
597 MatchStringAdv(lyx::Buffer const & buf, FindAndReplaceOptions const & opt);
599 /** Tests if text starting at the supplied position matches with the one provided to the MatchStringAdv
600 ** constructor as opt.search, under the opt.* options settings.
603 ** If set, then match is searched only against beginning of text starting at cur.
604 ** If unset, then match is searched anywhere in text starting at cur.
607 ** The length of the matching text, or zero if no match was found.
609 int operator()(DocIterator const & cur, int len = -1, bool at_begin = true) const;
613 lyx::Buffer const & buf;
615 FindAndReplaceOptions const & opt;
618 /** Normalize a stringified or latexified LyX paragraph.
622 ** <li>if search is not casesensitive, then lowercase the string;
623 ** <li>remove any newline at begin or end of the string;
624 ** <li>replace any newline in the middle of the string with a simple space;
625 ** <li>remove stale empty styles and environments, like \emph{} and \textbf{}.
628 ** @todo Normalization should also expand macros, if the corresponding
629 ** search option was checked.
631 string normalize(docstring const & s) const;
632 // normalized string to search
633 string par_as_string;
634 // regular expression to use for searching
636 // same as regexp, but prefixed with a ".*"
637 boost::regex regexp2;
638 // unmatched open braces in the search string/regexp
640 // number of (.*?) subexpressions added at end of search regexp for closing
641 // environments, math mode, styles, etc...
646 MatchStringAdv::MatchStringAdv(lyx::Buffer const & buf, FindAndReplaceOptions const & opt)
649 par_as_string = normalize(opt.search);
654 // Remove trailing closure of math, macros and environments, so to catch parts of them.
656 LYXERR(Debug::DEBUG, "par_as_string now is '" << par_as_string << "'");
657 if (regex_replace(par_as_string, par_as_string, "(.*)[[:blank:]]\\'", "$1"))
659 if (regex_replace(par_as_string, par_as_string, "(.*[^\\\\]) ?\\$\\'", "$1"))
661 // @todo need to account for open square braces as well ?
662 if (regex_replace(par_as_string, par_as_string, "(.*[^\\\\]) ?\\\\\\]\\'", "$1"))
664 if (regex_replace(par_as_string, par_as_string, "(.*[^\\\\]) ?\\\\end\\{[a-zA-Z_]*\\}\\'", "$1"))
666 if (regex_replace(par_as_string, par_as_string, "(.*[^\\\\]) ?\\}\\'", "$1")) {
672 LYXERR(Debug::DEBUG, "Open braces: " << open_braces);
673 LASSERT(braces_match(par_as_string.begin(), par_as_string.end(), open_braces), /* */);
674 LYXERR(Debug::DEBUG, "Built MatchStringAdv object: par_as_string = '" << par_as_string << "'");
676 par_as_string = escape_for_regex(par_as_string);
677 // Insert (.*?) before trailing closure of math, macros and environments, so to catch parts of them.
678 LYXERR(Debug::DEBUG, "par_as_string now is '" << par_as_string << "'");
680 // Insert .* before trailing '\$' ('$' has been escaped by escape_for_regex)
681 regex_replace(par_as_string, par_as_string, "(.*[^\\\\])(\\\\\\$)\\'", "$1(.*?)$2")
682 // Insert .* before trailing '\\\]' ('\]' has been escaped by escape_for_regex)
683 || regex_replace(par_as_string, par_as_string, "(.*[^\\\\])(\\\\\\\\\\\\\\])\\'", "$1(.*?)$2")
684 // Insert .* before trailing '\\end\{...}' ('\end{...}' has been escaped by escape_for_regex)
685 || regex_replace(par_as_string, par_as_string, "(.*[^\\\\])(\\\\\\\\end\\\\\\{[a-zA-Z_]*\\\\\\})\\'", "$1(.*?)$2")
686 // Insert .* before trailing '\}' ('}' has been escaped by escape_for_regex)
687 || regex_replace(par_as_string, par_as_string, "(.*[^\\\\])(\\\\\\})\\'", "$1(.*?)$2")
691 LYXERR(Debug::DEBUG, "par_as_string now is '" << par_as_string << "'");
692 LYXERR(Debug::DEBUG, "Open braces: " << open_braces);
693 LYXERR(Debug::DEBUG, "Close .*? : " << close_wildcards);
694 LASSERT(braces_match(par_as_string.begin(), par_as_string.end(), open_braces), /* */);
695 // Entered regexp must match at begin of searched string buffer
696 par_as_string = string("\\`") + par_as_string;
697 LYXERR(Debug::DEBUG, "Replaced text (to be used as regex): " << par_as_string);
698 regexp = boost::regex(par_as_string);
699 regexp2 = boost::regex(string(".*") + par_as_string);
704 int MatchStringAdv::operator()(DocIterator const & cur, int len, bool at_begin) const
706 docstring docstr = stringifyFromForSearch(opt, cur, len);
707 LYXERR(Debug::DEBUG, "Matching against '" << lyx::to_utf8(docstr) << "'");
708 string str = normalize(docstr);
709 LYXERR(Debug::DEBUG, "After normalization: '" << str << "'");
712 if (str.substr(0, par_as_string.size()) == par_as_string)
713 return par_as_string.size();
715 size_t pos = str.find(par_as_string);
716 if (pos != string::npos)
717 return par_as_string.size();
720 // Try all possible regexp matches, until one that verifies the braces match test is found
721 boost::regex const *p_regexp = at_begin ? ®exp : ®exp2;
722 boost::sregex_iterator re_it(str.begin(), str.end(), *p_regexp);
723 boost::sregex_iterator re_it_end;
724 for (; re_it != re_it_end; ++re_it) {
725 boost::match_results<string::const_iterator> const & m = *re_it;
726 // Check braces on the segment that matched the entire regexp expression,
727 // plus the last subexpression, if a (.*?) was inserted in the constructor.
728 if (! braces_match(m[0].first, m[0].second, open_braces))
730 // Check braces on segments that matched all (.*?) subexpressions.
731 for (size_t i = 1; i < m.size(); ++i)
732 if (! braces_match(m[i].first, m[i].second))
734 // Exclude from the returned match length any length due to close wildcards added at end of regexp
735 if (close_wildcards == 0)
736 return m[0].second - m[0].first;
738 return m[m.size() - close_wildcards].first - m[0].first;
745 string MatchStringAdv::normalize(docstring const & s) const
748 if (! opt.casesensitive)
749 t = lyx::to_utf8(lowercase(s));
752 // Remove \n at begin
753 while (t.size() > 0 && t[0] == '\n')
756 while (t.size() > 0 && t[t.size() - 1] == '\n')
757 t = t.substr(0, t.size() - 1);
759 // Replace all other \n with spaces
760 while ((pos = t.find("\n")) != string::npos)
761 t.replace(pos, 1, " ");
762 // Remove stale empty \emph{}, \textbf{} and similar blocks from latexify
763 while (regex_replace(t, t, "\\\\[a-zA-Z_]+(\\{\\})+", ""))
769 docstring stringifyFromCursor(DocIterator const & cur, int len)
771 LYXERR(Debug::DEBUG, "Stringifying with len=" << len << " from cursor at pos: " << cur);
772 if (cur.inTexted()) {
773 Paragraph const & par = cur.paragraph();
774 // TODO what about searching beyond/across paragraph breaks ?
775 // TODO Try adding a AS_STR_INSERTS as last arg
776 pos_type end = ( len == -1 || cur.pos() + len > int(par.size()) ) ? int(par.size()) : cur.pos() + len;
777 OutputParams runparams(&cur.buffer()->params().encoding());
779 runparams.nice = true;
780 runparams.flavor = OutputParams::LATEX;
781 runparams.linelen = 100000; //lyxrc.plaintext_linelen;
782 // No side effect of file copying and image conversion
783 runparams.dryrun = true;
784 LYXERR(Debug::DEBUG, "Stringifying with cur: " << cur << ", from pos: " << cur.pos() << ", end: " << end);
785 return par.stringify(cur.pos(), end, AS_STR_INSETS, runparams);
786 } else if (cur.inMathed()) {
788 CursorSlice cs = cur.top();
789 MathData md = cs.cell();
790 MathData::const_iterator it_end = ( ( len == -1 || cs.pos() + len > int(md.size()) ) ? md.end() : md.begin() + cs.pos() + len );
791 for (MathData::const_iterator it = md.begin() + cs.pos(); it != it_end; ++it)
795 LYXERR(Debug::DEBUG, "Don't know how to stringify from here: " << cur);
799 /** Computes the LaTeX export of buf starting from cur and ending len positions
800 * after cur, if len is positive, or at the paragraph or innermost inset end
804 docstring latexifyFromCursor(DocIterator const & cur, int len)
806 LYXERR(Debug::DEBUG, "Latexifying with len=" << len << " from cursor at pos: " << cur);
807 LYXERR(Debug::DEBUG, " with cur.lastpost=" << cur.lastpos() << ", cur.lastrow="
808 << cur.lastrow() << ", cur.lastcol=" << cur.lastcol());
809 Buffer const & buf = *cur.buffer();
810 LASSERT(buf.isLatex(), /* */);
813 odocstringstream ods;
814 OutputParams runparams(&buf.params().encoding());
815 runparams.nice = false;
816 runparams.flavor = OutputParams::LATEX;
817 runparams.linelen = 8000; //lyxrc.plaintext_linelen;
818 // No side effect of file copying and image conversion
819 runparams.dryrun = true;
821 if (cur.inTexted()) {
822 // @TODO what about searching beyond/across paragraph breaks ?
823 ParagraphList::const_iterator pit = cur.innerText()->paragraphs().begin();
824 for (int i = 0; i < cur.pit(); ++i)
826 // ParagraphList::const_iterator pit_end = pit;
828 // lyx::latexParagraphs(buf, cur.innerText()->paragraphs(), ods, texrow, runparams, string(), pit, pit_end);
829 pos_type const endpos = (len == -1 || cur.pos() + len > int(pit->size()))
830 ? pit->size() : cur.pos() + len;
831 TeXOnePar(buf, *cur.innerText(), pit, ods, texrow, runparams, string(),
833 LYXERR(Debug::DEBUG, "Latexified text: '" << lyx::to_utf8(ods.str()) << "'");
834 } else if (cur.inMathed()) {
835 // Retrieve the math environment type, and add '$' or '$[' or others (\begin{equation}) accordingly
836 for (int s = cur.depth() - 1; s >= 0; --s) {
837 CursorSlice const & cs = cur[s];
838 if (cs.asInsetMath() && cs.asInsetMath() && cs.asInsetMath()->asHullInset()) {
840 cs.asInsetMath()->asHullInset()->header_write(ws);
845 CursorSlice const & cs = cur.top();
846 MathData md = cs.cell();
847 MathData::const_iterator it_end = ( ( len == -1 || cs.pos() + len > int(md.size()) )
848 ? md.end() : md.begin() + cs.pos() + len );
849 for (MathData::const_iterator it = md.begin() + cs.pos(); it != it_end; ++it)
852 // MathData md = cur.cell();
853 // MathData::const_iterator it_end = ( ( len == -1 || cur.pos() + len > int(md.size()) ) ? md.end() : md.begin() + cur.pos() + len );
854 // for (MathData::const_iterator it = md.begin() + cur.pos(); it != it_end; ++it) {
855 // MathAtom const & ma = *it;
856 // ma.nucleus()->latex(buf, ods, runparams);
859 // Retrieve the math environment type, and add '$' or '$]'
860 // or others (\end{equation}) accordingly
861 for (int s = cur.depth() - 1; s >= 0; --s) {
862 CursorSlice const & cs = cur[s];
863 InsetMath * inset = cs.asInsetMath();
864 if (inset && inset->asHullInset()) {
866 inset->asHullInset()->footer_write(ws);
870 LYXERR(Debug::DEBUG, "Latexified math: '" << lyx::to_utf8(ods.str()) << "'");
872 LYXERR(Debug::DEBUG, "Don't know how to stringify from here: " << cur);
877 /** Finalize an advanced find operation, advancing the cursor to the innermost
878 ** position that matches, plus computing the length of the matching text to
881 int findAdvFinalize(DocIterator & cur, MatchStringAdv const & match)
883 // Search the foremost position that matches (avoids find of entire math
884 // inset when match at start of it)
886 DocIterator old_cur(cur.buffer());
888 LYXERR(Debug::DEBUG, "Forwarding one step (searching for innermost match)");
892 } while (cur && cur.depth() > d && match(cur) > 0);
894 LASSERT(match(cur) > 0, /* */);
895 LYXERR(Debug::DEBUG, "Ok");
897 // Compute the match length
899 LYXERR(Debug::DEBUG, "verifying unmatch with len = " << len);
900 while (cur.pos() + len <= cur.lastpos() && match(cur, len) == 0) {
902 LYXERR(Debug::DEBUG, "verifying unmatch with len = " << len);
904 // Length of matched text (different from len param)
905 int old_len = match(cur, len);
907 // Greedy behaviour while matching regexps
908 while ((new_len = match(cur, len + 1)) > old_len) {
911 LYXERR(Debug::DEBUG, "verifying match with len = " << len);
918 int findForwardAdv(DocIterator & cur, MatchStringAdv const & match)
924 while (cur && !match(cur, -1, false)) {
925 if (cur.pit() < cur.lastpit())
931 for (; cur; cur.forwardPos()) {
933 return findAdvFinalize(cur, match);
935 wrap_answer = frontend::Alert::prompt(
937 _("End of document reached while searching forward\n"
939 "Continue searching from beginning ?"),
940 0, 1, _("&Yes"), _("&No"));
942 cur.push_back(CursorSlice(match.buf.inset()));
943 } while (wrap_answer == 0);
949 int findBackwardsAdv(DocIterator & cur, MatchStringAdv const & match) {
950 // if (cur.pos() > 0 || cur.depth() > 0)
951 // cur.backwardPos();
952 DocIterator cur_orig(cur);
954 findAdvFinalize(cur_orig, match);
955 // int total = cur.bottom().pit() + 1;
958 // TODO No ! così non va.
959 bool pit_changed = false;
960 while (cur && !match(cur, -1, false)) {
970 if (cur && pit_changed)
971 cur.pos() = cur.lastpos();
972 for (; cur; cur.backwardPos()) {
974 // Find the most backward consecutive match within same paragraph while searching backwards.
978 int len = findAdvFinalize(cur, match);
983 LYXERR(Debug::DEBUG, "old_cur: " << old_cur << ", old_len=" << len << ", cur: " << cur);
984 } while (cur && cur.pit() == pit && match(cur)
985 && (len = findAdvFinalize(cur, match)) > old_len);
988 LYXERR(Debug::DEBUG, "cur_orig : " << cur_orig);
989 LYXERR(Debug::DEBUG, "cur : " << cur);
994 wrap_answer = frontend::Alert::prompt(
996 _("Beginning of document reached while searching backwards\n"
998 "Continue searching from end ?"),
999 0, 1, _("&Yes"), _("&No"));
1000 cur = doc_iterator_end(&match.buf);
1002 } while (wrap_answer == 0);
1006 } // anonym namespace
1009 docstring stringifyFromForSearch(FindAndReplaceOptions const & opt,
1010 DocIterator const & cur, int len)
1012 if (!opt.ignoreformat)
1013 return latexifyFromCursor(cur, len);
1015 return stringifyFromCursor(cur, len);
1019 lyx::FindAndReplaceOptions::FindAndReplaceOptions(docstring const & search, bool casesensitive,
1020 bool matchword, bool forward, bool expandmacros, bool ignoreformat,
1021 bool regexp, docstring const & replace)
1022 : search(search), casesensitive(casesensitive), matchword(matchword),
1023 forward(forward), expandmacros(expandmacros), ignoreformat(ignoreformat),
1024 regexp(regexp), replace(replace)
1028 /// Perform a FindAdv operation.
1029 bool findAdv(BufferView * bv, FindAndReplaceOptions const & opt)
1031 DocIterator cur = bv->cursor();
1034 if (opt.search.empty()) {
1035 bv->message(_("Search text is empty!"));
1038 // if (! bv->buffer()) {
1039 // bv->message(_("No open document !"));
1044 MatchStringAdv const matchAdv(bv->buffer(), opt);
1046 match_len = findForwardAdv(cur, matchAdv);
1048 match_len = findBackwardsAdv(cur, matchAdv);
1050 // This may only be raised by boost::regex()
1051 bv->message(_("Invalid regular expression!"));
1055 if (match_len == 0) {
1056 bv->message(_("Match not found!"));
1060 LYXERR(Debug::DEBUG, "Putting selection at " << cur << " with len: " << match_len);
1061 bv->putSelectionAt(cur, match_len, ! opt.forward);
1062 bv->message(_("Match found!"));
1063 if (opt.replace != docstring(from_utf8(LYX_FR_NULL_STRING))) {
1064 dispatch(FuncRequest(LFUN_SELF_INSERT, opt.replace));
1071 void findAdv(BufferView * bv, FuncRequest const & ev)
1073 if (!bv || ev.action != LFUN_WORD_FINDADV)
1076 FindAndReplaceOptions opt;
1077 istringstream iss(to_utf8(ev.argument()));
1083 ostringstream & operator<<(ostringstream & os, lyx::FindAndReplaceOptions const & opt)
1085 os << to_utf8(opt.search) << "\nEOSS\n"
1086 << opt.casesensitive << ' '
1087 << opt.matchword << ' '
1088 << opt.forward << ' '
1089 << opt.expandmacros << ' '
1090 << opt.ignoreformat << ' '
1091 << opt.regexp << ' '
1092 << to_utf8(opt.replace) << "\nEOSS\n";
1094 LYXERR(Debug::DEBUG, "built: " << os.str());
1099 istringstream & operator>>(istringstream & is, lyx::FindAndReplaceOptions & opt)
1101 LYXERR(Debug::DEBUG, "parsing");
1105 while (line != "EOSS") {
1109 if (is.eof()) // Tolerate malformed request
1113 LYXERR(Debug::DEBUG, "searching for: '" << s << "'");
1114 opt.search = from_utf8(s);
1115 is >> opt.casesensitive >> opt.matchword >> opt.forward >> opt.expandmacros >> opt.ignoreformat >> opt.regexp;
1116 is.get(); // Waste space before replace string
1119 while (line != "EOSS") {
1123 if (is.eof()) // Tolerate malformed request
1127 LYXERR(Debug::DEBUG, "parsed: " << opt.casesensitive << ' ' << opt.matchword << ' ' << opt.forward << ' '
1128 << opt.expandmacros << ' ' << opt.ignoreformat << ' ' << opt.regexp);
1129 LYXERR(Debug::DEBUG, "replacing with: '" << s << "'");
1130 opt.replace = from_utf8(s);