3 * This file is part of LyX, the document processor.
4 * License details can be found in the file COPYING.
6 * \author Lars Gullik Bjønnes
9 * \author Alfredo Braunstein
10 * \author Tommaso Cucinotta
12 * Full author contact details are available in file CREDITS.
20 #include "buffer_funcs.h"
21 #include "BufferList.h"
22 #include "BufferParams.h"
23 #include "BufferView.h"
26 #include "CutAndPaste.h"
27 #include "FuncRequest.h"
29 #include "output_latex.h"
30 #include "OutputParams.h"
31 #include "Paragraph.h"
32 #include "ParIterator.h"
36 #include "frontends/alert.h"
38 #include "mathed/InsetMath.h"
39 #include "mathed/InsetMathGrid.h"
40 #include "mathed/InsetMathHull.h"
41 #include "mathed/MathStream.h"
43 #include "support/convert.h"
44 #include "support/debug.h"
45 #include "support/docstream.h"
46 #include "support/gettext.h"
47 #include "support/lassert.h"
48 #include "support/lstrings.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;
376 DocIterator tmpcur = cur;
378 while (tmpcur.inMathed())
380 Change change_next_pos
381 = tmpcur.paragraph().lookupChange(tmpcur.pos());
382 if (change_next_pos.changed() && cur.inMathed()) {
384 search_both_sides = true;
385 } else if (tmpcur.pos() > 0 && tmpcur.inTexted()) {
386 Change change_prev_pos
387 = tmpcur.paragraph().lookupChange(tmpcur.pos() - 1);
388 if (change_next_pos.isSimilarTo(change_prev_pos))
389 search_both_sides = true;
392 if (!findChange(cur, next))
395 bv->cursor().setCursor(cur);
396 bv->cursor().resetAnchor();
399 // take a step into the change
402 Change orig_change = cur.paragraph().lookupChange(cur.pos());
404 CursorSlice & tip = cur.top();
406 for (; !tip.at_end(); tip.forwardPos()) {
407 Change change = tip.paragraph().lookupChange(tip.pos());
408 if (change != orig_change)
412 for (; !tip.at_begin();) {
414 Change change = tip.paragraph().lookupChange(tip.pos());
415 if (change != orig_change) {
416 // take a step forward to correctly set the selection
423 // Now put cursor to end of selection:
424 bv->cursor().setCursor(cur);
425 bv->cursor().setSelection();
427 if (search_both_sides) {
428 bv->cursor().setSelection(false);
429 findChange(bv, !next);
437 typedef vector<pair<string, string> > Escapes;
439 /// A map of symbols and their escaped equivalent needed within a regex.
440 Escapes const & get_regexp_escapes()
442 static Escapes escape_map;
443 if (escape_map.empty()) {
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>("}", "\\}"));
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>(".", "\\."));
460 /// A map of lyx escaped strings and their unescaped equivalent.
461 Escapes const & get_lyx_unescapes() {
462 static Escapes escape_map;
463 if (escape_map.empty()) {
464 escape_map.push_back(pair<string, string>("{*}", "*"));
465 escape_map.push_back(pair<string, string>("{[}", "["));
466 escape_map.push_back(pair<string, string>("\\$", "$"));
467 escape_map.push_back(pair<string, string>("\\backslash{}", "\\"));
468 escape_map.push_back(pair<string, string>("\\backslash", "\\"));
469 escape_map.push_back(pair<string, string>("\\sim ", "~"));
470 escape_map.push_back(pair<string, string>("\\^", "^"));
475 /** @todo Probably the maps need to be migrated to regexps, in order to distinguish if
476 ** the found occurrence were escaped.
478 string apply_escapes(string s, Escapes const & escape_map)
480 LYXERR(Debug::FIND, "Escaping: '" << s << "'");
481 Escapes::const_iterator it;
482 for (it = escape_map.begin(); it != escape_map.end(); ++it) {
483 // LYXERR(Debug::FIND, "Escaping " << it->first << " as " << it->second);
484 unsigned int pos = 0;
485 while (pos < s.length() && (pos = s.find(it->first, pos)) < s.length()) {
486 s.replace(pos, it->first.length(), it->second);
487 // LYXERR(Debug::FIND, "After escape: " << s);
488 pos += it->second.length();
489 // LYXERR(Debug::FIND, "pos: " << pos);
492 LYXERR(Debug::FIND, "Escaped : '" << s << "'");
496 /** Return the position of the closing brace matching the open one at s[pos],
497 ** or s.size() if not found.
499 size_t find_matching_brace(string const & s, size_t pos)
501 LASSERT(s[pos] == '{', /* */);
503 for (++pos; pos < s.size(); ++pos) {
506 else if (s[pos] == '{')
508 else if (s[pos] == '}') {
510 if (open_braces == 0)
517 /// Within \regexp{} apply get_regex_escapes(), while outside apply get_lyx_unescapes().
518 string escape_for_regex(string s)
521 while (pos < s.size()) {
522 size_t new_pos = s.find("\\regexp{", pos);
523 if (new_pos == string::npos)
525 LYXERR(Debug::FIND, "new_pos: " << new_pos);
526 string t = apply_escapes(s.substr(pos, new_pos - pos), get_lyx_unescapes());
527 LYXERR(Debug::FIND, "t : " << t);
528 t = apply_escapes(t, get_regexp_escapes());
529 s.replace(pos, new_pos - pos, t);
530 new_pos = pos + t.size();
531 LYXERR(Debug::FIND, "Regexp after escaping: " << s);
532 LYXERR(Debug::FIND, "new_pos: " << new_pos);
533 if (new_pos == s.size())
535 size_t end_pos = find_matching_brace(s, new_pos + 7);
536 LYXERR(Debug::FIND, "end_pos: " << end_pos);
537 t = apply_escapes(s.substr(new_pos + 8, end_pos - (new_pos + 8)), get_lyx_unescapes());
538 LYXERR(Debug::FIND, "t : " << t);
539 if (end_pos == s.size()) {
540 s.replace(new_pos, end_pos - new_pos, t);
542 LYXERR(Debug::FIND, "Regexp after \\regexp{} removal: " << s);
545 s.replace(new_pos, end_pos + 1 - new_pos, t);
546 LYXERR(Debug::FIND, "Regexp after \\regexp{} removal: " << s);
547 pos = new_pos + t.size();
548 LYXERR(Debug::FIND, "pos: " << pos);
553 /// Wrapper for boost::regex_replace with simpler interface
554 bool regex_replace(string const & s, string & t, string const & searchstr,
555 string const & replacestr)
557 boost::regex e(searchstr);
559 ostream_iterator<char, char> it(oss);
560 boost::regex_replace(it, s.begin(), s.end(), e, replacestr);
561 // tolerate t and s be references to the same variable
562 bool rv = (s != oss.str());
567 /** Checks if supplied string segment is well-formed from the standpoint of matching open-closed braces.
569 ** Verify that closed braces exactly match open braces. This avoids that, for example,
570 ** \frac{.*}{x} matches \frac{x+\frac{y}{x}}{z} with .* being 'x+\frac{y'.
573 ** Number of open braces that must remain open at the end for the verification to succeed.
575 bool braces_match(string::const_iterator const & beg,
576 string::const_iterator const & end, int unmatched = 0)
579 string::const_iterator it = beg;
580 LYXERR(Debug::FIND, "Checking " << unmatched << " unmatched braces in '" << string(beg, end) << "'");
581 for (; it != end; ++it) {
582 // Skip escaped braces in the count
587 } else if (*it == '{') {
589 } else if (*it == '}') {
590 if (open_pars == 0) {
591 LYXERR(Debug::FIND, "Found unmatched closed brace");
597 if (open_pars != unmatched) {
598 LYXERR(Debug::FIND, "Found " << open_pars
599 << " instead of " << unmatched
600 << " unmatched open braces at the end of count");
603 LYXERR(Debug::FIND, "Braces match as expected");
607 /** The class performing a match between a position in the document and the FindAdvOptions.
609 class MatchStringAdv {
611 MatchStringAdv(lyx::Buffer & buf, FindAndReplaceOptions const & opt);
613 /** Tests if text starting at the supplied position matches with the one provided to the MatchStringAdv
614 ** constructor as opt.search, under the opt.* options settings.
617 ** If set, then match is searched only against beginning of text starting at cur.
618 ** If unset, then match is searched anywhere in text starting at cur.
621 ** The length of the matching text, or zero if no match was found.
623 int operator()(DocIterator const & cur, int len = -1, bool at_begin = true) const;
628 /// first buffer on which search was started
629 lyx::Buffer * const p_first_buf;
631 FindAndReplaceOptions const & opt;
634 /// Auxiliary find method (does not account for opt.matchword)
635 int findAux(DocIterator const & cur, int len = -1, bool at_begin = true) const;
637 /** Normalize a stringified or latexified LyX paragraph.
641 ** <li>if search is not casesensitive, then lowercase the string;
642 ** <li>remove any newline at begin or end of the string;
643 ** <li>replace any newline in the middle of the string with a simple space;
644 ** <li>remove stale empty styles and environments, like \emph{} and \textbf{}.
647 ** @todo Normalization should also expand macros, if the corresponding
648 ** search option was checked.
650 string normalize(docstring const & s) const;
651 // normalized string to search
652 string par_as_string;
653 // regular expression to use for searching
655 // same as regexp, but prefixed with a ".*"
656 boost::regex regexp2;
657 // unmatched open braces in the search string/regexp
659 // number of (.*?) subexpressions added at end of search regexp for closing
660 // environments, math mode, styles, etc...
665 MatchStringAdv::MatchStringAdv(lyx::Buffer & buf, FindAndReplaceOptions const & opt)
666 : p_buf(&buf), p_first_buf(&buf), opt(opt)
668 par_as_string = normalize(opt.search);
673 // Remove trailing closure of math, macros and environments, so to catch parts of them.
675 LYXERR(Debug::FIND, "par_as_string now is '" << par_as_string << "'");
676 if (regex_replace(par_as_string, par_as_string, "(.*)[[:blank:]]\\'", "$1"))
678 if (regex_replace(par_as_string, par_as_string, "(.*[^\\\\]) ?\\$\\'", "$1"))
680 // @todo need to account for open square braces as well ?
681 if (regex_replace(par_as_string, par_as_string, "(.*[^\\\\]) ?\\\\\\]\\'", "$1"))
683 if (regex_replace(par_as_string, par_as_string, "(.*[^\\\\]) ?\\\\end\\{[a-zA-Z_]*\\}\\'", "$1"))
685 if (regex_replace(par_as_string, par_as_string, "(.*[^\\\\]) ?\\}\\'", "$1")) {
691 LYXERR(Debug::FIND, "Open braces: " << open_braces);
692 LASSERT(braces_match(par_as_string.begin(), par_as_string.end(), open_braces), /* */);
693 LYXERR(Debug::FIND, "Built MatchStringAdv object: par_as_string = '" << par_as_string << "'");
695 par_as_string = escape_for_regex(par_as_string);
696 // Insert (.*?) before trailing closure of math, macros and environments, so to catch parts of them.
697 LYXERR(Debug::FIND, "par_as_string now is '" << par_as_string << "'");
699 // Insert .* before trailing '\$' ('$' has been escaped by escape_for_regex)
700 regex_replace(par_as_string, par_as_string, "(.*[^\\\\])(\\\\\\$)\\'", "$1(.*?)$2")
701 // Insert .* before trailing '\\\]' ('\]' has been escaped by escape_for_regex)
702 || regex_replace(par_as_string, par_as_string, "(.*[^\\\\])(\\\\\\\\\\\\\\])\\'", "$1(.*?)$2")
703 // Insert .* before trailing '\\end\{...}' ('\end{...}' has been escaped by escape_for_regex)
704 || regex_replace(par_as_string, par_as_string,
705 "(.*[^\\\\])(\\\\\\\\end\\\\\\{[a-zA-Z_]*\\\\\\})\\'", "$1(.*?)$2")
706 // Insert .* before trailing '\}' ('}' has been escaped by escape_for_regex)
707 || regex_replace(par_as_string, par_as_string, "(.*[^\\\\])(\\\\\\})\\'", "$1(.*?)$2")
711 LYXERR(Debug::FIND, "par_as_string now is '" << par_as_string << "'");
712 LYXERR(Debug::FIND, "Open braces: " << open_braces);
713 LYXERR(Debug::FIND, "Close .*? : " << close_wildcards);
714 LASSERT(braces_match(par_as_string.begin(), par_as_string.end(), open_braces), /* */);
715 LYXERR(Debug::FIND, "Replaced text (to be used as regex): " << par_as_string);
716 // If entered regexp must match at begin of searched string buffer
717 regexp = boost::regex(string("\\`") + par_as_string);
718 // If entered regexp may match wherever in searched string buffer
719 regexp2 = boost::regex(string("\\`.*") + par_as_string);
724 int MatchStringAdv::findAux(DocIterator const & cur, int len, bool at_begin) const
726 docstring docstr = stringifyFromForSearch(opt, cur, len);
727 LYXERR(Debug::FIND, "Matching against '" << lyx::to_utf8(docstr) << "'");
728 string str = normalize(docstr);
729 LYXERR(Debug::FIND, "After normalization: '" << str << "'");
732 if (str.substr(0, par_as_string.size()) == par_as_string)
733 return par_as_string.size();
735 size_t pos = str.find(par_as_string);
736 if (pos != string::npos)
737 return par_as_string.size();
740 // Try all possible regexp matches,
741 //until one that verifies the braces match test is found
742 boost::regex const *p_regexp = at_begin ? ®exp : ®exp2;
743 boost::sregex_iterator re_it(str.begin(), str.end(), *p_regexp);
744 boost::sregex_iterator re_it_end;
745 for (; re_it != re_it_end; ++re_it) {
746 boost::match_results<string::const_iterator> const & m = *re_it;
747 // Check braces on the segment that matched the entire regexp expression,
748 // plus the last subexpression, if a (.*?) was inserted in the constructor.
749 if (! braces_match(m[0].first, m[0].second, open_braces))
751 // Check braces on segments that matched all (.*?) subexpressions.
752 for (size_t i = 1; i < m.size(); ++i)
753 if (! braces_match(m[i].first, m[i].second))
755 // Exclude from the returned match length any length
756 // due to close wildcards added at end of regexp
757 if (close_wildcards == 0)
758 return m[0].second - m[0].first;
760 return m[m.size() - close_wildcards].first - m[0].first;
767 int MatchStringAdv::operator()(DocIterator const & cur, int len, bool at_begin) const
769 int res = findAux(cur, len, at_begin);
770 if (res == 0 || !at_begin || !opt.matchword || !cur.inTexted())
772 Paragraph const & par = cur.paragraph();
773 bool ws_left = cur.pos() > 0 ?
774 par.isWordSeparator(cur.pos() - 1) : true;
775 bool ws_right = cur.pos() + res < par.size() ?
776 par.isWordSeparator(cur.pos() + res) : true;
778 "cur.pos()=" << cur.pos() << ", res=" << res
779 << ", separ: " << ws_left << ", " << ws_right
781 if (ws_left && ws_right)
787 string MatchStringAdv::normalize(docstring const & s) const
790 if (! opt.casesensitive)
791 t = lyx::to_utf8(lowercase(s));
794 // Remove \n at begin
795 while (t.size() > 0 && t[0] == '\n')
798 while (t.size() > 0 && t[t.size() - 1] == '\n')
799 t = t.substr(0, t.size() - 1);
801 // Replace all other \n with spaces
802 while ((pos = t.find("\n")) != string::npos)
803 t.replace(pos, 1, " ");
804 // Remove stale empty \emph{}, \textbf{} and similar blocks from latexify
805 LYXERR(Debug::FIND, "Removing stale empty \\emph{}, \\textbf{}, \\*section{} macros from: " << t);
806 while (regex_replace(t, t, "\\\\(emph|textbf|subsubsection|subsection|section|subparagraph|paragraph)(\\{\\})+", ""))
807 LYXERR(Debug::FIND, " further removing stale empty \\emph{}, \\textbf{} macros from: " << t);
812 docstring stringifyFromCursor(DocIterator const & cur, int len)
814 LYXERR(Debug::FIND, "Stringifying with len=" << len << " from cursor at pos: " << cur);
815 if (cur.inTexted()) {
816 Paragraph const & par = cur.paragraph();
817 // TODO what about searching beyond/across paragraph breaks ?
818 // TODO Try adding a AS_STR_INSERTS as last arg
819 pos_type end = ( len == -1 || cur.pos() + len > int(par.size()) ) ?
820 int(par.size()) : cur.pos() + len;
821 OutputParams runparams(&cur.buffer()->params().encoding());
823 runparams.nice = true;
824 runparams.flavor = OutputParams::LATEX;
825 runparams.linelen = 100000; //lyxrc.plaintext_linelen;
826 // No side effect of file copying and image conversion
827 runparams.dryrun = true;
828 LYXERR(Debug::FIND, "Stringifying with cur: "
829 << cur << ", from pos: " << cur.pos() << ", end: " << end);
830 return par.stringify(cur.pos(), end, AS_STR_INSETS, runparams);
831 } else if (cur.inMathed()) {
833 CursorSlice cs = cur.top();
834 MathData md = cs.cell();
835 MathData::const_iterator it_end =
836 ( ( len == -1 || cs.pos() + len > int(md.size()) )
837 ? md.end() : md.begin() + cs.pos() + len );
838 for (MathData::const_iterator it = md.begin() + cs.pos(); it != it_end; ++it)
842 LYXERR(Debug::FIND, "Don't know how to stringify from here: " << cur);
847 /** Computes the LaTeX export of buf starting from cur and ending len positions
848 * after cur, if len is positive, or at the paragraph or innermost inset end
851 docstring latexifyFromCursor(DocIterator const & cur, int len)
853 LYXERR(Debug::FIND, "Latexifying with len=" << len << " from cursor at pos: " << cur);
854 LYXERR(Debug::FIND, " with cur.lastpost=" << cur.lastpos() << ", cur.lastrow="
855 << cur.lastrow() << ", cur.lastcol=" << cur.lastcol());
856 Buffer const & buf = *cur.buffer();
857 LASSERT(buf.isLatex(), /* */);
860 odocstringstream ods;
861 OutputParams runparams(&buf.params().encoding());
862 runparams.nice = false;
863 runparams.flavor = OutputParams::LATEX;
864 runparams.linelen = 8000; //lyxrc.plaintext_linelen;
865 // No side effect of file copying and image conversion
866 runparams.dryrun = true;
868 if (cur.inTexted()) {
869 // @TODO what about searching beyond/across paragraph breaks ?
870 ParagraphList::const_iterator pit = cur.innerText()->paragraphs().begin();
871 for (int i = 0; i < cur.pit(); ++i)
873 // ParagraphList::const_iterator pit_end = pit;
875 // lyx::latexParagraphs(buf, cur.innerText()->paragraphs(), ods, texrow, runparams, string(), pit, pit_end);
876 pos_type const endpos = (len == -1 || cur.pos() + len > int(pit->size()))
877 ? pit->size() : cur.pos() + len;
878 TeXOnePar(buf, *cur.innerText(), pit, ods, texrow, runparams, string(),
880 LYXERR(Debug::FIND, "Latexified text: '" << lyx::to_utf8(ods.str()) << "'");
881 } else if (cur.inMathed()) {
882 // Retrieve the math environment type, and add '$' or '$[' or others (\begin{equation}) accordingly
883 for (int s = cur.depth() - 1; s >= 0; --s) {
884 CursorSlice const & cs = cur[s];
885 if (cs.asInsetMath() && cs.asInsetMath() && cs.asInsetMath()->asHullInset()) {
887 cs.asInsetMath()->asHullInset()->header_write(ws);
892 CursorSlice const & cs = cur.top();
893 MathData md = cs.cell();
894 MathData::const_iterator it_end = ( ( len == -1 || cs.pos() + len > int(md.size()) )
895 ? md.end() : md.begin() + cs.pos() + len );
896 for (MathData::const_iterator it = md.begin() + cs.pos(); it != it_end; ++it)
899 // MathData md = cur.cell();
900 // MathData::const_iterator it_end = ( ( len == -1 || cur.pos() + len > int(md.size()) ) ? md.end() : md.begin() + cur.pos() + len );
901 // for (MathData::const_iterator it = md.begin() + cur.pos(); it != it_end; ++it) {
902 // MathAtom const & ma = *it;
903 // ma.nucleus()->latex(buf, ods, runparams);
906 // Retrieve the math environment type, and add '$' or '$]'
907 // or others (\end{equation}) accordingly
908 for (int s = cur.depth() - 1; s >= 0; --s) {
909 CursorSlice const & cs = cur[s];
910 InsetMath * inset = cs.asInsetMath();
911 if (inset && inset->asHullInset()) {
913 inset->asHullInset()->footer_write(ws);
917 LYXERR(Debug::FIND, "Latexified math: '" << lyx::to_utf8(ods.str()) << "'");
919 LYXERR(Debug::FIND, "Don't know how to stringify from here: " << cur);
925 /** Finalize an advanced find operation, advancing the cursor to the innermost
926 ** position that matches, plus computing the length of the matching text to
929 int findAdvFinalize(DocIterator & cur, MatchStringAdv const & match)
931 // Search the foremost position that matches (avoids find of entire math
932 // inset when match at start of it)
934 DocIterator old_cur(cur.buffer());
936 LYXERR(Debug::FIND, "Forwarding one step (searching for innermost match)");
940 } while (cur && cur.depth() > d && match(cur) > 0);
942 LASSERT(match(cur) > 0, /* */);
943 LYXERR(Debug::FIND, "Ok");
945 // Compute the match length
947 LYXERR(Debug::FIND, "verifying unmatch with len = " << len);
948 while (cur.pos() + len <= cur.lastpos() && match(cur, len) == 0) {
950 LYXERR(Debug::FIND, "verifying unmatch with len = " << len);
952 // Length of matched text (different from len param)
953 int old_len = match(cur, len);
955 // Greedy behaviour while matching regexps
956 while ((new_len = match(cur, len + 1)) > old_len) {
959 LYXERR(Debug::FIND, "verifying match with len = " << len);
966 int findForwardAdv(DocIterator & cur, MatchStringAdv & match)
970 while (cur && !match(cur, -1, false)) {
971 if (cur.pit() < cur.lastpit())
977 for (; cur; cur.forwardPos()) {
979 return findAdvFinalize(cur, match);
985 /// Find the most backward consecutive match within same paragraph while searching backwards.
986 void findMostBackwards(DocIterator & cur, MatchStringAdv const & match, int & len)
988 DocIterator cur_begin = doc_iterator_begin(cur.buffer());
989 len = findAdvFinalize(cur, match);
990 if (cur != cur_begin) {
991 Inset & inset = cur.inset();
999 LYXERR(Debug::FIND, "findMostBackwards(): old_cur="
1000 << old_cur << ", old_len=" << len << ", cur=" << cur);
1002 } while (cur != cur_begin && &cur.inset() == &inset && match(cur)
1003 && (len = findAdvFinalize(dit2, match)) > old_len);
1007 LYXERR(Debug::FIND, "findMostBackwards(): cur=" << cur);
1012 int findBackwardsAdv(DocIterator & cur, MatchStringAdv & match) {
1015 // Backup of original position
1016 DocIterator cur_orig(cur);
1017 DocIterator cur_begin = doc_iterator_begin(cur.buffer());
1018 if (cur == cur_begin)
1021 bool pit_changed = false;
1022 found_match = false;
1025 found_match = match(cur, -1, false);
1029 cur.pos() = cur.lastpos();
1031 cur.pos() = cur_orig.pos();
1032 LYXERR(Debug::FIND, "findBackAdv2: cur: " << cur);
1033 DocIterator cur_prev_iter;
1035 found_match = match(cur);
1036 LYXERR(Debug::FIND, "findBackAdv3: found_match="
1037 << found_match << ", cur: " << cur);
1040 findMostBackwards(cur, match, len);
1044 // Prevent infinite loop at begin of document
1045 if (cur == cur_begin || cur == cur_prev_iter)
1047 cur_prev_iter = cur;
1051 if (cur == cur_begin)
1063 } // anonym namespace
1066 docstring stringifyFromForSearch(FindAndReplaceOptions const & opt,
1067 DocIterator const & cur, int len)
1069 if (!opt.ignoreformat)
1070 return latexifyFromCursor(cur, len);
1072 return stringifyFromCursor(cur, len);
1076 FindAndReplaceOptions::FindAndReplaceOptions(docstring const & search, bool casesensitive,
1077 bool matchword, bool forward, bool expandmacros, bool ignoreformat,
1078 bool regexp, docstring const & replace, bool keep_case,
1080 : search(search), casesensitive(casesensitive), matchword(matchword),
1081 forward(forward), expandmacros(expandmacros), ignoreformat(ignoreformat),
1082 regexp(regexp), replace(replace), keep_case(keep_case), scope(scope)
1087 /** Checks if the supplied character is lower-case */
1088 static bool isLowerCase(char_type ch) {
1089 return lowercase(ch) == ch;
1093 /** Checks if the supplied character is upper-case */
1094 static bool isUpperCase(char_type ch) {
1095 return uppercase(ch) == ch;
1099 /** Check if 'len' letters following cursor are all non-lowercase */
1100 static bool allNonLowercase(DocIterator const & cur, int len) {
1101 pos_type end_pos = cur.pos() + len;
1102 for (pos_type pos = cur.pos(); pos != end_pos; ++pos)
1103 if (isLowerCase(cur.paragraph().getChar(pos)))
1109 /** Check if first letter is upper case and second one is lower case */
1110 static bool firstUppercase(DocIterator const & cur) {
1112 if (cur.pos() >= cur.lastpos() - 1) {
1113 LYXERR(Debug::FIND, "No upper-case at cur: " << cur);
1116 ch1 = cur.paragraph().getChar(cur.pos());
1117 ch2 = cur.paragraph().getChar(cur.pos()+1);
1118 bool result = isUpperCase(ch1) && isLowerCase(ch2);
1119 LYXERR(Debug::FIND, "firstUppercase(): "
1120 << "ch1=" << ch1 << "(" << char(ch1) << "), ch2="
1121 << ch2 << "(" << char(ch2) << ")"
1122 << ", result=" << result << ", cur=" << cur);
1127 /** Make first letter of supplied buffer upper-case, and the rest lower-case.
1129 ** \fixme What to do with possible further paragraphs in replace buffer ?
1131 static void changeFirstCase(Buffer & buffer, TextCase first_case, TextCase others_case) {
1132 ParagraphList::iterator pit = buffer.paragraphs().begin();
1133 pos_type right = pos_type(1);
1134 pit->changeCase(buffer.params(), pos_type(0), right, first_case);
1135 right = pit->size() + 1;
1136 pit->changeCase(buffer.params(), right, right, others_case);
1140 /// Perform a FindAdv operation.
1141 bool findAdv(BufferView * bv, FindAndReplaceOptions const & opt)
1143 DocIterator cur = bv->cursor();
1146 if (opt.search.empty()) {
1147 bv->message(_("Search text is empty!"));
1151 MatchStringAdv matchAdv(bv->buffer(), opt);
1154 match_len = findForwardAdv(cur, matchAdv);
1156 match_len = findBackwardsAdv(cur, matchAdv);
1158 // This may only be raised by boost::regex()
1159 bv->message(_("Invalid regular expression!"));
1163 if (match_len == 0) {
1164 bv->message(_("Match not found!"));
1168 LYXERR(Debug::FIND, "Putting selection at buf=" << matchAdv.p_buf
1169 << "cur=" << cur << " with len: " << match_len);
1171 bv->putSelectionAt(cur, match_len, ! opt.forward);
1172 if (opt.replace == docstring(from_utf8(LYX_FR_NULL_STRING))) {
1173 bv->message(_("Match found!"));
1175 string lyx = to_utf8(opt.replace);
1176 // FIXME: Seems so stupid to me to rebuild a buffer here,
1177 // when we already have one (replace_work_area_.buffer())
1178 Buffer repl_buffer("", false);
1179 repl_buffer.setUnnamed(true);
1180 if (repl_buffer.readString(lyx)) {
1181 if (opt.keep_case && match_len >= 2) {
1182 if (cur.inTexted()) {
1183 if (firstUppercase(cur))
1184 changeFirstCase(repl_buffer, text_uppercase, text_lowercase);
1185 else if (allNonLowercase(cur, match_len))
1186 changeFirstCase(repl_buffer, text_uppercase, text_uppercase);
1189 cap::cutSelection(bv->cursor(), false, false);
1190 if (! cur.inMathed()) {
1191 LYXERR(Debug::FIND, "Replacing by pasteParagraphList()ing repl_buffer");
1192 cap::pasteParagraphList(bv->cursor(), repl_buffer.paragraphs(),
1193 repl_buffer.params().documentClassPtr(),
1194 bv->buffer().errorList("Paste"));
1196 odocstringstream ods;
1197 OutputParams runparams(&repl_buffer.params().encoding());
1198 runparams.nice = false;
1199 runparams.flavor = OutputParams::LATEX;
1200 runparams.linelen = 8000; //lyxrc.plaintext_linelen;
1201 runparams.dryrun = true;
1203 TeXOnePar(repl_buffer, repl_buffer.text(),
1204 repl_buffer.paragraphs().begin(), ods, texrow, runparams);
1205 //repl_buffer.getSourceCode(ods, 0, repl_buffer.paragraphs().size(), false);
1206 docstring repl_latex = ods.str();
1207 LYXERR(Debug::FIND, "Latexified replace_buffer: '" << repl_latex << "'");
1209 regex_replace(to_utf8(repl_latex), s, "\\$(.*)\\$", "$1");
1210 regex_replace(s, s, "\\\\\\[(.*)\\\\\\]", "$1");
1211 repl_latex = from_utf8(s);
1212 LYXERR(Debug::FIND, "Replacing by niceInsert()ing latex: '" << repl_latex << "'");
1213 bv->cursor().niceInsert(repl_latex);
1215 bv->putSelectionAt(cur, repl_buffer.paragraphs().begin()->size(), ! opt.forward);
1216 bv->message(_("Match found and replaced !"));
1218 LASSERT(false, /**/);
1225 ostringstream & operator<<(ostringstream & os, FindAndReplaceOptions const & opt)
1227 os << to_utf8(opt.search) << "\nEOSS\n"
1228 << opt.casesensitive << ' '
1229 << opt.matchword << ' '
1230 << opt.forward << ' '
1231 << opt.expandmacros << ' '
1232 << opt.ignoreformat << ' '
1233 << opt.regexp << ' '
1234 << to_utf8(opt.replace) << "\nEOSS\n"
1235 << opt.keep_case << ' '
1238 LYXERR(Debug::FIND, "built: " << os.str());
1243 istringstream & operator>>(istringstream & is, FindAndReplaceOptions & opt)
1245 LYXERR(Debug::FIND, "parsing");
1249 while (line != "EOSS") {
1253 if (is.eof()) // Tolerate malformed request
1257 LYXERR(Debug::FIND, "searching for: '" << s << "'");
1258 opt.search = from_utf8(s);
1259 is >> opt.casesensitive >> opt.matchword >> opt.forward >> opt.expandmacros >> opt.ignoreformat >> opt.regexp;
1260 is.get(); // Waste space before replace string
1263 while (line != "EOSS") {
1267 if (is.eof()) // Tolerate malformed request
1271 is >> opt.keep_case;
1274 opt.scope = FindAndReplaceOptions::SearchScope(i);
1275 LYXERR(Debug::FIND, "parsed: " << opt.casesensitive << ' ' << opt.matchword << ' ' << opt.forward << ' '
1276 << opt.expandmacros << ' ' << opt.ignoreformat << ' ' << opt.regexp << ' ' << opt.keep_case);
1277 LYXERR(Debug::FIND, "replacing with: '" << s << "'");
1278 opt.replace = from_utf8(s);