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 "BufferList.h"
21 #include "buffer_funcs.h"
22 #include "BufferParams.h"
23 #include "BufferView.h"
26 #include "CutAndPaste.h"
27 #include "FuncRequest.h"
28 #include "OutputParams.h"
29 #include "output_latex.h"
30 #include "Paragraph.h"
31 #include "ParIterator.h"
34 #include "FuncRequest.h"
37 #include "mathed/InsetMath.h"
38 #include "mathed/InsetMathGrid.h"
39 #include "mathed/InsetMathHull.h"
40 #include "mathed/MathStream.h"
42 #include "frontends/alert.h"
44 #include "support/convert.h"
45 #include "support/debug.h"
46 #include "support/docstream.h"
47 #include "support/gettext.h"
48 #include "support/lstrings.h"
49 #include "support/lassert.h"
51 #include "frontends/Application.h"
52 #include "frontends/LyXView.h"
54 #include <boost/regex.hpp>
55 #include <boost/next_prior.hpp>
58 using namespace lyx::support;
64 bool parse_bool(docstring & howto)
69 howto = split(howto, var, ' ');
74 class MatchString : public binary_function<Paragraph, pos_type, bool>
77 MatchString(docstring const & str, bool cs, bool mw)
78 : str(str), cs(cs), mw(mw)
81 // returns true if the specified string is at the specified position
82 // del specifies whether deleted strings in ct mode will be considered
83 bool operator()(Paragraph const & par, pos_type pos, bool del = true) const
85 return par.find(str, cs, mw, pos, del);
93 // match whole words only
98 bool findForward(DocIterator & cur, MatchString const & match,
101 for (; cur; cur.forwardChar())
102 if (cur.inTexted() &&
103 match(cur.paragraph(), cur.pos(), find_del))
109 bool findBackwards(DocIterator & cur, MatchString const & match,
110 bool find_del = true)
114 if (cur.inTexted() &&
115 match(cur.paragraph(), cur.pos(), find_del))
122 bool findChange(DocIterator & cur, bool next)
126 for (; cur; next ? cur.forwardPos() : cur.backwardPos())
127 if (cur.inTexted() && cur.paragraph().isChanged(cur.pos())) {
129 // if we search backwards, take a step forward
130 // to correctly set the anchor
139 bool searchAllowed(BufferView * /*bv*/, docstring const & str)
142 frontend::Alert::error(_("Search error"), _("Search string is empty"));
149 bool find(BufferView * bv, docstring const & searchstr,
150 bool cs, bool mw, bool fw, bool find_del = true)
152 if (!searchAllowed(bv, searchstr))
155 DocIterator cur = bv->cursor();
157 MatchString const match(searchstr, cs, mw);
159 bool found = fw ? findForward(cur, match, find_del) :
160 findBackwards(cur, match, find_del);
163 bv->putSelectionAt(cur, searchstr.length(), !fw);
169 int replaceAll(BufferView * bv,
170 docstring const & searchstr, docstring const & replacestr,
173 Buffer & buf = bv->buffer();
175 if (!searchAllowed(bv, searchstr) || buf.isReadonly())
178 MatchString const match(searchstr, cs, mw);
181 int const rsize = replacestr.size();
182 int const ssize = searchstr.size();
185 cur.setCursor(doc_iterator_begin(&buf));
186 while (findForward(cur, match, false)) {
187 // Backup current cursor position and font.
188 pos_type const pos = cur.pos();
189 Font const font = cur.paragraph().getFontSettings(buf.params(), pos);
191 int striked = ssize - cur.paragraph().eraseChars(pos, pos + ssize,
192 buf.params().trackChanges);
193 cur.paragraph().insert(pos, replacestr, font,
194 Change(buf.params().trackChanges ?
195 Change::INSERTED : Change::UNCHANGED));
196 for (int i = 0; i < rsize + striked; ++i)
202 bv->putSelectionAt(doc_iterator_begin(&buf), 0, false);
209 bool stringSelected(BufferView * bv, docstring & searchstr,
210 bool cs, bool mw, bool fw)
212 // if nothing selected and searched string is empty, this
213 // means that we want to search current word at cursor position.
214 if (!bv->cursor().selection() && searchstr.empty()) {
215 bv->cursor().innerText()->selectWord(bv->cursor(), WHOLE_WORD);
216 searchstr = bv->cursor().selectionAsString(false);
220 // if nothing selected or selection does not equal search
221 // string search and select next occurance and return
222 docstring const & str1 = searchstr;
223 docstring const str2 = bv->cursor().selectionAsString(false);
224 if ((cs && str1 != str2) || compare_no_case(str1, str2) != 0) {
225 find(bv, searchstr, cs, mw, fw);
233 int replace(BufferView * bv, docstring & searchstr,
234 docstring const & replacestr, bool cs, bool mw, bool fw)
236 if (!stringSelected(bv, searchstr, cs, mw, fw))
239 if (!searchAllowed(bv, searchstr) || bv->buffer().isReadonly())
242 Cursor & cur = bv->cursor();
243 cap::replaceSelectionWithString(cur, replacestr, fw);
244 bv->buffer().markDirty();
245 find(bv, searchstr, cs, mw, fw, false);
246 bv->buffer().updateMacros();
247 bv->processUpdateFlags(Update::Force | Update::FitCursor);
255 docstring const find2string(docstring const & search,
256 bool casesensitive, bool matchword, bool forward)
260 << int(casesensitive) << ' '
261 << int(matchword) << ' '
267 docstring const replace2string(docstring const & replace,
268 docstring const & search, bool casesensitive, bool matchword,
269 bool all, bool forward)
272 ss << replace << '\n'
274 << int(casesensitive) << ' '
275 << int(matchword) << ' '
282 bool find(BufferView * bv, FuncRequest const & ev)
284 if (!bv || ev.action != LFUN_WORD_FIND)
287 //lyxerr << "find called, cmd: " << ev << endl;
289 // data is of the form
291 // <casesensitive> <matchword> <forward>"
293 docstring howto = split(ev.argument(), search, '\n');
295 bool casesensitive = parse_bool(howto);
296 bool matchword = parse_bool(howto);
297 bool forward = parse_bool(howto);
299 return find(bv, search, casesensitive, matchword, forward);
303 void replace(BufferView * bv, FuncRequest const & ev, bool has_deleted)
305 if (!bv || ev.action != LFUN_WORD_REPLACE)
308 // data is of the form
311 // <casesensitive> <matchword> <all> <forward>"
314 docstring howto = split(ev.argument(), rplc, '\n');
315 howto = split(howto, search, '\n');
317 bool casesensitive = parse_bool(howto);
318 bool matchword = parse_bool(howto);
319 bool all = parse_bool(howto);
320 bool forward = parse_bool(howto);
323 int const replace_count = all
324 ? replaceAll(bv, search, rplc, casesensitive, matchword)
325 : replace(bv, search, rplc, casesensitive, matchword, forward);
327 Buffer & buf = bv->buffer();
328 if (replace_count == 0) {
329 // emit message signal.
330 buf.message(_("String not found!"));
332 if (replace_count == 1) {
333 // emit message signal.
334 buf.message(_("String has been replaced."));
336 docstring str = convert<docstring>(replace_count);
337 str += _(" strings have been replaced.");
338 // emit message signal.
343 // if we have deleted characters, we do not replace at all, but
344 // rather search for the next occurence
345 if (find(bv, search, casesensitive, matchword, forward))
348 bv->message(_("String not found!"));
353 bool findNextChange(BufferView * bv)
355 return findChange(bv, true);
359 bool findPreviousChange(BufferView * bv)
361 return findChange(bv, false);
365 bool findChange(BufferView * bv, bool next)
367 if (bv->cursor().selection()) {
368 // set the cursor at the beginning or at the end of the selection
369 // before searching. Otherwise, the current change will be found.
370 if (next != (bv->cursor().top() > bv->cursor().anchor()))
371 bv->cursor().setCursorToAnchor();
374 DocIterator cur = bv->cursor();
376 // Are we within a change ? Then first search forward (backward),
377 // clear the selection and search the other way around (see the end
378 // of this function). This will avoid changes to be selected half.
379 bool search_both_sides = false;
380 DocIterator tmpcur = cur;
382 while (tmpcur.inMathed())
384 Change change_next_pos
385 = tmpcur.paragraph().lookupChange(tmpcur.pos());
386 if (change_next_pos.changed() && cur.inMathed()) {
388 search_both_sides = true;
389 } else if (tmpcur.pos() > 0 && tmpcur.inTexted()) {
390 Change change_prev_pos
391 = tmpcur.paragraph().lookupChange(tmpcur.pos() - 1);
392 if (change_next_pos.isSimilarTo(change_prev_pos))
393 search_both_sides = true;
396 if (!findChange(cur, next))
399 bv->cursor().setCursor(cur);
400 bv->cursor().resetAnchor();
403 // take a step into the change
406 Change orig_change = cur.paragraph().lookupChange(cur.pos());
408 CursorSlice & tip = cur.top();
410 for (; !tip.at_end(); tip.forwardPos()) {
411 Change change = tip.paragraph().lookupChange(tip.pos());
412 if (change != orig_change)
416 for (; !tip.at_begin();) {
418 Change change = tip.paragraph().lookupChange(tip.pos());
419 if (change != orig_change) {
420 // take a step forward to correctly set the selection
427 // Now put cursor to end of selection:
428 bv->cursor().setCursor(cur);
429 bv->cursor().setSelection();
431 if (search_both_sides) {
432 bv->cursor().setSelection(false);
433 findChange(bv, !next);
441 typedef vector<pair<string, string> > Escapes;
443 /// A map of symbols and their escaped equivalent needed within a regex.
444 Escapes const & get_regexp_escapes()
446 static Escapes escape_map;
447 if (escape_map.empty()) {
448 escape_map.push_back(pair<string, string>("\\", "\\\\"));
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>("}", "\\}"));
453 escape_map.push_back(pair<string, string>("[", "\\["));
454 escape_map.push_back(pair<string, string>("]", "\\]"));
455 escape_map.push_back(pair<string, string>("(", "\\("));
456 escape_map.push_back(pair<string, string>(")", "\\)"));
457 escape_map.push_back(pair<string, string>("+", "\\+"));
458 escape_map.push_back(pair<string, string>("*", "\\*"));
459 escape_map.push_back(pair<string, string>(".", "\\."));
464 /// A map of lyx escaped strings and their unescaped equivalent.
465 Escapes const & get_lyx_unescapes() {
466 static Escapes escape_map;
467 if (escape_map.empty()) {
468 escape_map.push_back(pair<string, string>("{*}", "*"));
469 escape_map.push_back(pair<string, string>("{[}", "["));
470 escape_map.push_back(pair<string, string>("\\$", "$"));
471 escape_map.push_back(pair<string, string>("\\backslash{}", "\\"));
472 escape_map.push_back(pair<string, string>("\\backslash", "\\"));
473 escape_map.push_back(pair<string, string>("\\sim ", "~"));
474 escape_map.push_back(pair<string, string>("\\^", "^"));
479 /** @todo Probably the maps need to be migrated to regexps, in order to distinguish if
480 ** the found occurrence were escaped.
482 string apply_escapes(string s, Escapes const & escape_map)
484 LYXERR(Debug::FIND, "Escaping: '" << s << "'");
485 Escapes::const_iterator it;
486 for (it = escape_map.begin(); it != escape_map.end(); ++it) {
487 // LYXERR(Debug::FIND, "Escaping " << it->first << " as " << it->second);
488 unsigned int pos = 0;
489 while (pos < s.length() && (pos = s.find(it->first, pos)) < s.length()) {
490 s.replace(pos, it->first.length(), it->second);
491 // LYXERR(Debug::FIND, "After escape: " << s);
492 pos += it->second.length();
493 // LYXERR(Debug::FIND, "pos: " << pos);
496 LYXERR(Debug::FIND, "Escaped : '" << s << "'");
500 /** Return the position of the closing brace matching the open one at s[pos],
501 ** or s.size() if not found.
503 size_t find_matching_brace(string const & s, size_t pos)
505 LASSERT(s[pos] == '{', /* */);
507 for (++pos; pos < s.size(); ++pos) {
510 else if (s[pos] == '{')
512 else if (s[pos] == '}') {
514 if (open_braces == 0)
521 /// Within \regexp{} apply get_regex_escapes(), while outside apply get_lyx_unescapes().
522 string escape_for_regex(string s)
525 while (pos < s.size()) {
526 size_t new_pos = s.find("\\regexp{", pos);
527 if (new_pos == string::npos)
529 LYXERR(Debug::FIND, "new_pos: " << new_pos);
530 string t = apply_escapes(s.substr(pos, new_pos - pos), get_lyx_unescapes());
531 LYXERR(Debug::FIND, "t : " << t);
532 t = apply_escapes(t, get_regexp_escapes());
533 s.replace(pos, new_pos - pos, t);
534 new_pos = pos + t.size();
535 LYXERR(Debug::FIND, "Regexp after escaping: " << s);
536 LYXERR(Debug::FIND, "new_pos: " << new_pos);
537 if (new_pos == s.size())
539 size_t end_pos = find_matching_brace(s, new_pos + 7);
540 LYXERR(Debug::FIND, "end_pos: " << end_pos);
541 t = apply_escapes(s.substr(new_pos + 8, end_pos - (new_pos + 8)), get_lyx_unescapes());
542 LYXERR(Debug::FIND, "t : " << t);
543 if (end_pos == s.size()) {
544 s.replace(new_pos, end_pos - new_pos, t);
546 LYXERR(Debug::FIND, "Regexp after \\regexp{} removal: " << s);
549 s.replace(new_pos, end_pos + 1 - new_pos, t);
550 LYXERR(Debug::FIND, "Regexp after \\regexp{} removal: " << s);
551 pos = new_pos + t.size();
552 LYXERR(Debug::FIND, "pos: " << pos);
557 /// Wrapper for boost::regex_replace with simpler interface
558 bool regex_replace(string const & s, string & t, string const & searchstr,
559 string const & replacestr)
561 boost::regex e(searchstr);
563 ostream_iterator<char, char> it(oss);
564 boost::regex_replace(it, s.begin(), s.end(), e, replacestr);
565 // tolerate t and s be references to the same variable
566 bool rv = (s != oss.str());
571 /** Checks if supplied string segment is well-formed from the standpoint of matching open-closed braces.
573 ** Verify that closed braces exactly match open braces. This avoids that, for example,
574 ** \frac{.*}{x} matches \frac{x+\frac{y}{x}}{z} with .* being 'x+\frac{y'.
577 ** Number of open braces that must remain open at the end for the verification to succeed.
579 bool braces_match(string::const_iterator const & beg,
580 string::const_iterator const & end, int unmatched = 0)
583 string::const_iterator it = beg;
584 LYXERR(Debug::FIND, "Checking " << unmatched << " unmatched braces in '" << string(beg, end) << "'");
585 for (; it != end; ++it) {
586 // Skip escaped braces in the count
591 } else if (*it == '{') {
593 } else if (*it == '}') {
594 if (open_pars == 0) {
595 LYXERR(Debug::FIND, "Found unmatched closed brace");
601 if (open_pars != unmatched) {
602 LYXERR(Debug::FIND, "Found " << open_pars
603 << " instead of " << unmatched
604 << " unmatched open braces at the end of count");
607 LYXERR(Debug::FIND, "Braces match as expected");
611 /** The class performing a match between a position in the document and the FindAdvOptions.
613 class MatchStringAdv {
615 MatchStringAdv(lyx::Buffer & buf, FindAndReplaceOptions const & opt);
617 /** Tests if text starting at the supplied position matches with the one provided to the MatchStringAdv
618 ** constructor as opt.search, under the opt.* options settings.
621 ** If set, then match is searched only against beginning of text starting at cur.
622 ** If unset, then match is searched anywhere in text starting at cur.
625 ** The length of the matching text, or zero if no match was found.
627 int operator()(DocIterator const & cur, int len = -1, bool at_begin = true) const;
632 /// first buffer on which search was started
633 lyx::Buffer * const p_first_buf;
635 FindAndReplaceOptions const & opt;
638 /** Normalize a stringified or latexified LyX paragraph.
642 ** <li>if search is not casesensitive, then lowercase the string;
643 ** <li>remove any newline at begin or end of the string;
644 ** <li>replace any newline in the middle of the string with a simple space;
645 ** <li>remove stale empty styles and environments, like \emph{} and \textbf{}.
648 ** @todo Normalization should also expand macros, if the corresponding
649 ** search option was checked.
651 string normalize(docstring const & s) const;
652 // normalized string to search
653 string par_as_string;
654 // regular expression to use for searching
656 // same as regexp, but prefixed with a ".*"
657 boost::regex regexp2;
658 // unmatched open braces in the search string/regexp
660 // number of (.*?) subexpressions added at end of search regexp for closing
661 // environments, math mode, styles, etc...
666 MatchStringAdv::MatchStringAdv(lyx::Buffer & buf, FindAndReplaceOptions const & opt)
667 : p_buf(&buf), p_first_buf(&buf), opt(opt)
669 par_as_string = normalize(opt.search);
674 // Remove trailing closure of math, macros and environments, so to catch parts of them.
676 LYXERR(Debug::FIND, "par_as_string now is '" << par_as_string << "'");
677 if (regex_replace(par_as_string, par_as_string, "(.*)[[:blank:]]\\'", "$1"))
679 if (regex_replace(par_as_string, par_as_string, "(.*[^\\\\]) ?\\$\\'", "$1"))
681 // @todo need to account for open square braces as well ?
682 if (regex_replace(par_as_string, par_as_string, "(.*[^\\\\]) ?\\\\\\]\\'", "$1"))
684 if (regex_replace(par_as_string, par_as_string, "(.*[^\\\\]) ?\\\\end\\{[a-zA-Z_]*\\}\\'", "$1"))
686 if (regex_replace(par_as_string, par_as_string, "(.*[^\\\\]) ?\\}\\'", "$1")) {
692 LYXERR(Debug::FIND, "Open braces: " << open_braces);
693 LASSERT(braces_match(par_as_string.begin(), par_as_string.end(), open_braces), /* */);
694 LYXERR(Debug::FIND, "Built MatchStringAdv object: par_as_string = '" << par_as_string << "'");
696 par_as_string = escape_for_regex(par_as_string);
697 // Insert (.*?) before trailing closure of math, macros and environments, so to catch parts of them.
698 LYXERR(Debug::FIND, "par_as_string now is '" << par_as_string << "'");
700 // Insert .* before trailing '\$' ('$' has been escaped by escape_for_regex)
701 regex_replace(par_as_string, par_as_string, "(.*[^\\\\])(\\\\\\$)\\'", "$1(.*?)$2")
702 // Insert .* before trailing '\\\]' ('\]' has been escaped by escape_for_regex)
703 || regex_replace(par_as_string, par_as_string, "(.*[^\\\\])(\\\\\\\\\\\\\\])\\'", "$1(.*?)$2")
704 // Insert .* before trailing '\\end\{...}' ('\end{...}' has been escaped by escape_for_regex)
705 || regex_replace(par_as_string, par_as_string,
706 "(.*[^\\\\])(\\\\\\\\end\\\\\\{[a-zA-Z_]*\\\\\\})\\'", "$1(.*?)$2")
707 // Insert .* before trailing '\}' ('}' has been escaped by escape_for_regex)
708 || regex_replace(par_as_string, par_as_string, "(.*[^\\\\])(\\\\\\})\\'", "$1(.*?)$2")
712 LYXERR(Debug::FIND, "par_as_string now is '" << par_as_string << "'");
713 LYXERR(Debug::FIND, "Open braces: " << open_braces);
714 LYXERR(Debug::FIND, "Close .*? : " << close_wildcards);
715 LASSERT(braces_match(par_as_string.begin(), par_as_string.end(), open_braces), /* */);
716 LYXERR(Debug::FIND, "Replaced text (to be used as regex): " << par_as_string);
717 // If entered regexp must match at begin of searched string buffer
718 regexp = boost::regex(string("\\`") + par_as_string);
719 // If entered regexp may match wherever in searched string buffer
720 regexp2 = boost::regex(string("\\`.*") + par_as_string);
725 int MatchStringAdv::operator()(DocIterator const & cur, int len, bool at_begin) const
727 docstring docstr = stringifyFromForSearch(opt, cur, len);
728 LYXERR(Debug::FIND, "Matching against '" << lyx::to_utf8(docstr) << "'");
729 string str = normalize(docstr);
730 LYXERR(Debug::FIND, "After normalization: '" << str << "'");
733 if (str.substr(0, par_as_string.size()) == par_as_string)
734 return par_as_string.size();
736 size_t pos = str.find(par_as_string);
737 if (pos != string::npos)
738 return par_as_string.size();
741 // Try all possible regexp matches,
742 //until one that verifies the braces match test is found
743 boost::regex const *p_regexp = at_begin ? ®exp : ®exp2;
744 boost::sregex_iterator re_it(str.begin(), str.end(), *p_regexp);
745 boost::sregex_iterator re_it_end;
746 for (; re_it != re_it_end; ++re_it) {
747 boost::match_results<string::const_iterator> const & m = *re_it;
748 // Check braces on the segment that matched the entire regexp expression,
749 // plus the last subexpression, if a (.*?) was inserted in the constructor.
750 if (! braces_match(m[0].first, m[0].second, open_braces))
752 // Check braces on segments that matched all (.*?) subexpressions.
753 for (size_t i = 1; i < m.size(); ++i)
754 if (! braces_match(m[i].first, m[i].second))
756 // Exclude from the returned match length any length
757 // due to close wildcards added at end of regexp
758 if (close_wildcards == 0)
759 return m[0].second - m[0].first;
761 return m[m.size() - close_wildcards].first - m[0].first;
768 string MatchStringAdv::normalize(docstring const & s) const
771 if (! opt.casesensitive)
772 t = lyx::to_utf8(lowercase(s));
775 // Remove \n at begin
776 while (t.size() > 0 && t[0] == '\n')
779 while (t.size() > 0 && t[t.size() - 1] == '\n')
780 t = t.substr(0, t.size() - 1);
782 // Replace all other \n with spaces
783 while ((pos = t.find("\n")) != string::npos)
784 t.replace(pos, 1, " ");
785 // Remove stale empty \emph{}, \textbf{} and similar blocks from latexify
786 LYXERR(Debug::FIND, "Removing stale empty \\emph{}, \\textbf{}, \\*section{} macros from: " << t);
787 while (regex_replace(t, t, "\\\\(emph|textbf|subsubsection|subsection|section|subparagraph|paragraph)(\\{\\})+", ""))
788 LYXERR(Debug::FIND, " further removing stale empty \\emph{}, \\textbf{} macros from: " << t);
793 docstring stringifyFromCursor(DocIterator const & cur, int len)
795 LYXERR(Debug::FIND, "Stringifying with len=" << len << " from cursor at pos: " << cur);
796 if (cur.inTexted()) {
797 Paragraph const & par = cur.paragraph();
798 // TODO what about searching beyond/across paragraph breaks ?
799 // TODO Try adding a AS_STR_INSERTS as last arg
800 pos_type end = ( len == -1 || cur.pos() + len > int(par.size()) ) ?
801 int(par.size()) : cur.pos() + len;
802 OutputParams runparams(&cur.buffer()->params().encoding());
804 runparams.nice = true;
805 runparams.flavor = OutputParams::LATEX;
806 runparams.linelen = 100000; //lyxrc.plaintext_linelen;
807 // No side effect of file copying and image conversion
808 runparams.dryrun = true;
809 LYXERR(Debug::FIND, "Stringifying with cur: "
810 << cur << ", from pos: " << cur.pos() << ", end: " << end);
811 return par.stringify(cur.pos(), end, AS_STR_INSETS, runparams);
812 } else if (cur.inMathed()) {
814 CursorSlice cs = cur.top();
815 MathData md = cs.cell();
816 MathData::const_iterator it_end =
817 ( ( len == -1 || cs.pos() + len > int(md.size()) )
818 ? md.end() : md.begin() + cs.pos() + len );
819 for (MathData::const_iterator it = md.begin() + cs.pos(); it != it_end; ++it)
823 LYXERR(Debug::FIND, "Don't know how to stringify from here: " << cur);
828 /** Computes the LaTeX export of buf starting from cur and ending len positions
829 * after cur, if len is positive, or at the paragraph or innermost inset end
832 docstring latexifyFromCursor(DocIterator const & cur, int len)
834 LYXERR(Debug::FIND, "Latexifying with len=" << len << " from cursor at pos: " << cur);
835 LYXERR(Debug::FIND, " with cur.lastpost=" << cur.lastpos() << ", cur.lastrow="
836 << cur.lastrow() << ", cur.lastcol=" << cur.lastcol());
837 Buffer const & buf = *cur.buffer();
838 LASSERT(buf.isLatex(), /* */);
841 odocstringstream ods;
842 OutputParams runparams(&buf.params().encoding());
843 runparams.nice = false;
844 runparams.flavor = OutputParams::LATEX;
845 runparams.linelen = 8000; //lyxrc.plaintext_linelen;
846 // No side effect of file copying and image conversion
847 runparams.dryrun = true;
849 if (cur.inTexted()) {
850 // @TODO what about searching beyond/across paragraph breaks ?
851 ParagraphList::const_iterator pit = cur.innerText()->paragraphs().begin();
852 for (int i = 0; i < cur.pit(); ++i)
854 // ParagraphList::const_iterator pit_end = pit;
856 // lyx::latexParagraphs(buf, cur.innerText()->paragraphs(), ods, texrow, runparams, string(), pit, pit_end);
857 pos_type const endpos = (len == -1 || cur.pos() + len > int(pit->size()))
858 ? pit->size() : cur.pos() + len;
859 TeXOnePar(buf, *cur.innerText(), pit, ods, texrow, runparams, string(),
861 LYXERR(Debug::FIND, "Latexified text: '" << lyx::to_utf8(ods.str()) << "'");
862 } else if (cur.inMathed()) {
863 // Retrieve the math environment type, and add '$' or '$[' or others (\begin{equation}) accordingly
864 for (int s = cur.depth() - 1; s >= 0; --s) {
865 CursorSlice const & cs = cur[s];
866 if (cs.asInsetMath() && cs.asInsetMath() && cs.asInsetMath()->asHullInset()) {
868 cs.asInsetMath()->asHullInset()->header_write(ws);
873 CursorSlice const & cs = cur.top();
874 MathData md = cs.cell();
875 MathData::const_iterator it_end = ( ( len == -1 || cs.pos() + len > int(md.size()) )
876 ? md.end() : md.begin() + cs.pos() + len );
877 for (MathData::const_iterator it = md.begin() + cs.pos(); it != it_end; ++it)
880 // MathData md = cur.cell();
881 // MathData::const_iterator it_end = ( ( len == -1 || cur.pos() + len > int(md.size()) ) ? md.end() : md.begin() + cur.pos() + len );
882 // for (MathData::const_iterator it = md.begin() + cur.pos(); it != it_end; ++it) {
883 // MathAtom const & ma = *it;
884 // ma.nucleus()->latex(buf, ods, runparams);
887 // Retrieve the math environment type, and add '$' or '$]'
888 // or others (\end{equation}) accordingly
889 for (int s = cur.depth() - 1; s >= 0; --s) {
890 CursorSlice const & cs = cur[s];
891 InsetMath * inset = cs.asInsetMath();
892 if (inset && inset->asHullInset()) {
894 inset->asHullInset()->footer_write(ws);
898 LYXERR(Debug::FIND, "Latexified math: '" << lyx::to_utf8(ods.str()) << "'");
900 LYXERR(Debug::FIND, "Don't know how to stringify from here: " << cur);
906 /** Finalize an advanced find operation, advancing the cursor to the innermost
907 ** position that matches, plus computing the length of the matching text to
910 int findAdvFinalize(DocIterator & cur, MatchStringAdv const & match)
912 // Search the foremost position that matches (avoids find of entire math
913 // inset when match at start of it)
915 DocIterator old_cur(cur.buffer());
917 LYXERR(Debug::FIND, "Forwarding one step (searching for innermost match)");
921 } while (cur && cur.depth() > d && match(cur) > 0);
923 LASSERT(match(cur) > 0, /* */);
924 LYXERR(Debug::FIND, "Ok");
926 // Compute the match length
928 LYXERR(Debug::FIND, "verifying unmatch with len = " << len);
929 while (cur.pos() + len <= cur.lastpos() && match(cur, len) == 0) {
931 LYXERR(Debug::FIND, "verifying unmatch with len = " << len);
933 // Length of matched text (different from len param)
934 int old_len = match(cur, len);
936 // Greedy behaviour while matching regexps
937 while ((new_len = match(cur, len + 1)) > old_len) {
940 LYXERR(Debug::FIND, "verifying match with len = " << len);
947 int findForwardAdv(DocIterator & cur, MatchStringAdv & match)
951 while (cur && !match(cur, -1, false)) {
952 if (cur.pit() < cur.lastpit())
958 for (; cur; cur.forwardPos()) {
960 return findAdvFinalize(cur, match);
966 /// Find the most backward consecutive match within same paragraph while searching backwards.
967 void findMostBackwards(DocIterator & cur, MatchStringAdv const & match, int & len)
969 DocIterator cur_begin = doc_iterator_begin(cur.buffer());
970 len = findAdvFinalize(cur, match);
971 if (cur != cur_begin) {
972 Inset & inset = cur.inset();
980 LYXERR(Debug::FIND, "findMostBackwards(): old_cur="
981 << old_cur << ", old_len=" << len << ", cur=" << cur);
983 } while (cur != cur_begin && &cur.inset() == &inset && match(cur)
984 && (len = findAdvFinalize(dit2, match)) > old_len);
988 LYXERR(Debug::FIND, "findMostBackwards(): cur=" << cur);
993 int findBackwardsAdv(DocIterator & cur, MatchStringAdv & match) {
996 // Backup of original position
997 DocIterator cur_orig(cur);
998 DocIterator cur_begin = doc_iterator_begin(cur.buffer());
999 if (cur == cur_begin)
1002 bool pit_changed = false;
1003 found_match = false;
1006 found_match = match(cur, -1, false);
1010 cur.pos() = cur.lastpos();
1012 cur.pos() = cur_orig.pos();
1013 LYXERR(Debug::FIND, "findBackAdv2: cur: " << cur);
1014 DocIterator cur_prev_iter;
1016 found_match = match(cur);
1017 LYXERR(Debug::FIND, "findBackAdv3: found_match="
1018 << found_match << ", cur: " << cur);
1021 findMostBackwards(cur, match, len);
1025 // Prevent infinite loop at begin of document
1026 if (cur == cur_begin || cur == cur_prev_iter)
1028 cur_prev_iter = cur;
1032 if (cur == cur_begin)
1044 } // anonym namespace
1047 docstring stringifyFromForSearch(FindAndReplaceOptions const & opt,
1048 DocIterator const & cur, int len)
1050 if (!opt.ignoreformat)
1051 return latexifyFromCursor(cur, len);
1053 return stringifyFromCursor(cur, len);
1057 FindAndReplaceOptions::FindAndReplaceOptions(docstring const & search, bool casesensitive,
1058 bool matchword, bool forward, bool expandmacros, bool ignoreformat,
1059 bool regexp, docstring const & replace, bool keep_case,
1061 : search(search), casesensitive(casesensitive), matchword(matchword),
1062 forward(forward), expandmacros(expandmacros), ignoreformat(ignoreformat),
1063 regexp(regexp), replace(replace), keep_case(keep_case), scope(scope)
1068 /** Checks if the supplied character is lower-case */
1069 static bool isLowerCase(char_type ch) {
1070 return lowercase(ch) == ch;
1074 /** Checks if the supplied character is upper-case */
1075 static bool isUpperCase(char_type ch) {
1076 return uppercase(ch) == ch;
1080 /** Check if 'len' letters following cursor are all non-lowercase */
1081 static bool allNonLowercase(DocIterator const & cur, int len) {
1082 pos_type end_pos = cur.pos() + len;
1083 for (pos_type pos = cur.pos(); pos != end_pos; ++pos)
1084 if (isLowerCase(cur.paragraph().getChar(pos)))
1090 /** Check if first letter is upper case and second one is lower case */
1091 static bool firstUppercase(DocIterator const & cur) {
1093 if (cur.pos() >= cur.lastpos() - 1) {
1094 LYXERR(Debug::FIND, "No upper-case at cur: " << cur);
1097 ch1 = cur.paragraph().getChar(cur.pos());
1098 ch2 = cur.paragraph().getChar(cur.pos()+1);
1099 bool result = isUpperCase(ch1) && isLowerCase(ch2);
1100 LYXERR(Debug::FIND, "firstUppercase(): "
1101 << "ch1=" << ch1 << "(" << char(ch1) << "), ch2="
1102 << ch2 << "(" << char(ch2) << ")"
1103 << ", result=" << result << ", cur=" << cur);
1108 /** Make first letter of supplied buffer upper-case, and the rest lower-case.
1110 ** \fixme What to do with possible further paragraphs in replace buffer ?
1112 static void changeFirstCase(Buffer & buffer, TextCase first_case, TextCase others_case) {
1113 ParagraphList::iterator pit = buffer.paragraphs().begin();
1114 pos_type right = pos_type(1);
1115 pit->changeCase(buffer.params(), pos_type(0), right, first_case);
1116 right = pit->size() + 1;
1117 pit->changeCase(buffer.params(), right, right, others_case);
1121 /// Perform a FindAdv operation.
1122 bool findAdv(BufferView * bv, FindAndReplaceOptions const & opt)
1124 DocIterator cur = bv->cursor();
1127 if (opt.search.empty()) {
1128 bv->message(_("Search text is empty!"));
1132 MatchStringAdv matchAdv(bv->buffer(), opt);
1135 match_len = findForwardAdv(cur, matchAdv);
1137 match_len = findBackwardsAdv(cur, matchAdv);
1139 // This may only be raised by boost::regex()
1140 bv->message(_("Invalid regular expression!"));
1144 if (match_len == 0) {
1145 bv->message(_("Match not found!"));
1149 LYXERR(Debug::FIND, "Putting selection at buf=" << matchAdv.p_buf
1150 << "cur=" << cur << " with len: " << match_len);
1152 bv->putSelectionAt(cur, match_len, ! opt.forward);
1153 if (opt.replace == docstring(from_utf8(LYX_FR_NULL_STRING))) {
1154 bv->message(_("Match found!"));
1156 string lyx = to_utf8(opt.replace);
1157 // FIXME: Seems so stupid to me to rebuild a buffer here,
1158 // when we already have one (replace_work_area_.buffer())
1159 Buffer repl_buffer("", false);
1160 repl_buffer.setUnnamed(true);
1161 if (repl_buffer.readString(lyx)) {
1162 if (opt.keep_case && match_len >= 2) {
1163 if (cur.inTexted()) {
1164 if (firstUppercase(cur))
1165 changeFirstCase(repl_buffer, text_uppercase, text_lowercase);
1166 else if (allNonLowercase(cur, match_len))
1167 changeFirstCase(repl_buffer, text_uppercase, text_uppercase);
1170 cap::cutSelection(bv->cursor(), false, false);
1171 if (! cur.inMathed()) {
1172 LYXERR(Debug::FIND, "Replacing by pasteParagraphList()ing repl_buffer");
1173 cap::pasteParagraphList(bv->cursor(), repl_buffer.paragraphs(),
1174 repl_buffer.params().documentClassPtr(),
1175 bv->buffer().errorList("Paste"));
1177 odocstringstream ods;
1178 OutputParams runparams(&repl_buffer.params().encoding());
1179 runparams.nice = false;
1180 runparams.flavor = OutputParams::LATEX;
1181 runparams.linelen = 8000; //lyxrc.plaintext_linelen;
1182 runparams.dryrun = true;
1184 TeXOnePar(repl_buffer, repl_buffer.text(),
1185 repl_buffer.paragraphs().begin(), ods, texrow, runparams);
1186 //repl_buffer.getSourceCode(ods, 0, repl_buffer.paragraphs().size(), false);
1187 docstring repl_latex = ods.str();
1188 LYXERR(Debug::FIND, "Latexified replace_buffer: '" << repl_latex << "'");
1190 regex_replace(to_utf8(repl_latex), s, "\\$(.*)\\$", "$1");
1191 regex_replace(s, s, "\\\\\\[(.*)\\\\\\]", "$1");
1192 repl_latex = from_utf8(s);
1193 LYXERR(Debug::FIND, "Replacing by niceInsert()ing latex: '" << repl_latex << "'");
1194 bv->cursor().niceInsert(repl_latex);
1196 bv->putSelectionAt(cur, repl_buffer.paragraphs().begin()->size(), ! opt.forward);
1197 bv->message(_("Match found and replaced !"));
1199 LASSERT(false, /**/);
1206 ostringstream & operator<<(ostringstream & os, lyx::FindAndReplaceOptions const & opt)
1208 os << to_utf8(opt.search) << "\nEOSS\n"
1209 << opt.casesensitive << ' '
1210 << opt.matchword << ' '
1211 << opt.forward << ' '
1212 << opt.expandmacros << ' '
1213 << opt.ignoreformat << ' '
1214 << opt.regexp << ' '
1215 << to_utf8(opt.replace) << "\nEOSS\n"
1216 << opt.keep_case << ' '
1219 LYXERR(Debug::FIND, "built: " << os.str());
1224 istringstream & operator>>(istringstream & is, lyx::FindAndReplaceOptions & opt)
1226 LYXERR(Debug::FIND, "parsing");
1230 while (line != "EOSS") {
1234 if (is.eof()) // Tolerate malformed request
1238 LYXERR(Debug::FIND, "searching for: '" << s << "'");
1239 opt.search = from_utf8(s);
1240 is >> opt.casesensitive >> opt.matchword >> opt.forward >> opt.expandmacros >> opt.ignoreformat >> opt.regexp;
1241 is.get(); // Waste space before replace string
1244 while (line != "EOSS") {
1248 if (is.eof()) // Tolerate malformed request
1252 is >> opt.keep_case;
1255 opt.scope = FindAndReplaceOptions::SearchScope(i);
1256 LYXERR(Debug::FIND, "parsed: " << opt.casesensitive << ' ' << opt.matchword << ' ' << opt.forward << ' '
1257 << opt.expandmacros << ' ' << opt.ignoreformat << ' ' << opt.regexp << ' ' << opt.keep_case);
1258 LYXERR(Debug::FIND, "replacing with: '" << s << "'");
1259 opt.replace = from_utf8(s);