2011-09-21 16:37:09 +02:00
|
|
|
#include "selectors.hh"
|
|
|
|
|
2014-06-27 20:34:26 +02:00
|
|
|
#include "optional.hh"
|
2012-08-29 21:49:36 +02:00
|
|
|
#include "string.hh"
|
2012-10-08 19:12:09 +02:00
|
|
|
|
2011-09-21 21:09:49 +02:00
|
|
|
#include <algorithm>
|
|
|
|
|
2011-09-21 16:37:09 +02:00
|
|
|
namespace Kakoune
|
|
|
|
{
|
|
|
|
|
2013-06-01 14:22:57 +02:00
|
|
|
Selection select_line(const Buffer& buffer, const Selection& selection)
|
2011-09-21 16:37:09 +02:00
|
|
|
{
|
2014-01-28 20:05:49 +01:00
|
|
|
Utf8Iterator first = buffer.iterator_at(selection.cursor());
|
2013-06-04 18:53:56 +02:00
|
|
|
if (*first == '\n' and first + 1 != buffer.end())
|
2011-10-27 20:57:31 +02:00
|
|
|
++first;
|
|
|
|
|
2013-06-04 18:53:56 +02:00
|
|
|
while (first != buffer.begin() and *(first - 1) != '\n')
|
2011-09-23 11:17:19 +02:00
|
|
|
--first;
|
|
|
|
|
2012-10-08 19:12:09 +02:00
|
|
|
Utf8Iterator last = first;
|
2013-06-04 18:53:56 +02:00
|
|
|
while (last + 1 != buffer.end() and *last != '\n')
|
2011-09-23 11:17:19 +02:00
|
|
|
++last;
|
2013-04-22 14:18:49 +02:00
|
|
|
return utf8_range(first, last);
|
2011-09-21 16:37:09 +02:00
|
|
|
}
|
|
|
|
|
2013-06-01 14:22:57 +02:00
|
|
|
Selection select_matching(const Buffer& buffer, const Selection& selection)
|
2011-09-21 21:09:49 +02:00
|
|
|
{
|
2012-10-11 01:17:29 +02:00
|
|
|
std::vector<Codepoint> matching_pairs = { '(', ')', '{', '}', '[', ']', '<', '>' };
|
2014-01-28 20:05:49 +01:00
|
|
|
Utf8Iterator it = buffer.iterator_at(selection.cursor());
|
2012-10-11 01:17:29 +02:00
|
|
|
std::vector<Codepoint>::iterator match = matching_pairs.end();
|
2011-09-21 21:09:49 +02:00
|
|
|
while (not is_eol(*it))
|
|
|
|
{
|
|
|
|
match = std::find(matching_pairs.begin(), matching_pairs.end(), *it);
|
|
|
|
if (match != matching_pairs.end())
|
|
|
|
break;
|
|
|
|
++it;
|
|
|
|
}
|
|
|
|
if (match == matching_pairs.end())
|
2012-02-07 15:26:51 +01:00
|
|
|
return selection;
|
2011-09-21 21:09:49 +02:00
|
|
|
|
2012-10-08 19:12:09 +02:00
|
|
|
Utf8Iterator begin = it;
|
2011-09-21 21:09:49 +02:00
|
|
|
|
|
|
|
if (((match - matching_pairs.begin()) % 2) == 0)
|
|
|
|
{
|
|
|
|
int level = 0;
|
2012-10-11 01:17:29 +02:00
|
|
|
const Codepoint opening = *match;
|
|
|
|
const Codepoint closing = *(match+1);
|
2013-06-04 18:53:56 +02:00
|
|
|
while (it != buffer.end())
|
2011-09-21 21:09:49 +02:00
|
|
|
{
|
|
|
|
if (*it == opening)
|
|
|
|
++level;
|
|
|
|
else if (*it == closing and --level == 0)
|
2013-04-22 14:18:49 +02:00
|
|
|
return utf8_range(begin, it);
|
2011-09-21 21:09:49 +02:00
|
|
|
++it;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
int level = 0;
|
2012-10-11 01:17:29 +02:00
|
|
|
const Codepoint opening = *(match-1);
|
|
|
|
const Codepoint closing = *match;
|
2012-12-27 13:41:45 +01:00
|
|
|
while (true)
|
2011-09-21 21:09:49 +02:00
|
|
|
{
|
|
|
|
if (*it == closing)
|
|
|
|
++level;
|
|
|
|
else if (*it == opening and --level == 0)
|
2013-04-22 14:18:49 +02:00
|
|
|
return utf8_range(begin, it);
|
2013-06-04 18:53:56 +02:00
|
|
|
if (it == buffer.begin())
|
2012-12-27 13:41:45 +01:00
|
|
|
break;
|
2011-09-21 21:09:49 +02:00
|
|
|
--it;
|
|
|
|
}
|
|
|
|
}
|
2012-02-07 15:26:51 +01:00
|
|
|
return selection;
|
2011-09-21 21:09:49 +02:00
|
|
|
}
|
|
|
|
|
2014-06-27 20:34:26 +02:00
|
|
|
static Optional<Selection> find_surrounding(const Buffer& buffer,
|
2014-05-07 20:51:01 +02:00
|
|
|
ByteCoord coord,
|
2014-03-29 09:55:45 +01:00
|
|
|
CodepointPair matching,
|
|
|
|
ObjectFlags flags, int init_level)
|
2012-01-04 15:18:08 +01:00
|
|
|
{
|
2013-05-15 14:24:09 +02:00
|
|
|
const bool to_begin = flags & ObjectFlags::ToBegin;
|
|
|
|
const bool to_end = flags & ObjectFlags::ToEnd;
|
2013-02-27 19:08:13 +01:00
|
|
|
const bool nestable = matching.first != matching.second;
|
2013-06-04 18:53:56 +02:00
|
|
|
auto pos = buffer.iterator_at(coord);
|
2013-04-22 14:18:49 +02:00
|
|
|
Utf8Iterator first = pos;
|
2013-01-07 18:53:27 +01:00
|
|
|
if (to_begin)
|
2012-01-04 15:18:08 +01:00
|
|
|
{
|
2013-10-08 20:24:56 +02:00
|
|
|
int level = nestable ? init_level : 0;
|
2013-06-04 18:53:56 +02:00
|
|
|
while (first != buffer.begin())
|
2012-01-04 15:18:08 +01:00
|
|
|
{
|
2013-04-22 14:18:49 +02:00
|
|
|
if (nestable and first != pos and *first == matching.second)
|
2013-01-07 18:53:27 +01:00
|
|
|
++level;
|
|
|
|
else if (*first == matching.first)
|
|
|
|
{
|
|
|
|
if (level == 0)
|
|
|
|
break;
|
|
|
|
else
|
|
|
|
--level;
|
|
|
|
}
|
|
|
|
--first;
|
2012-01-04 15:18:08 +01:00
|
|
|
}
|
2013-01-07 18:53:27 +01:00
|
|
|
if (level != 0 or *first != matching.first)
|
2014-06-27 20:34:26 +02:00
|
|
|
return Optional<Selection>{};
|
2012-01-04 15:18:08 +01:00
|
|
|
}
|
|
|
|
|
2013-04-22 14:18:49 +02:00
|
|
|
Utf8Iterator last = pos;
|
2013-01-07 18:53:27 +01:00
|
|
|
if (to_end)
|
2012-01-04 15:18:08 +01:00
|
|
|
{
|
2013-10-08 20:24:56 +02:00
|
|
|
int level = nestable ? init_level : 0;
|
2013-06-04 18:53:56 +02:00
|
|
|
while (last != buffer.end())
|
2012-01-04 15:18:08 +01:00
|
|
|
{
|
2013-10-08 20:24:56 +02:00
|
|
|
if (nestable and last != pos and *last == matching.first)
|
2013-01-07 18:53:27 +01:00
|
|
|
++level;
|
|
|
|
else if (*last == matching.second)
|
|
|
|
{
|
|
|
|
if (level == 0)
|
|
|
|
break;
|
|
|
|
else
|
|
|
|
--level;
|
|
|
|
}
|
|
|
|
++last;
|
2012-01-04 15:18:08 +01:00
|
|
|
}
|
2013-10-08 20:24:56 +02:00
|
|
|
if (level != 0 or last == buffer.end())
|
2014-06-27 20:34:26 +02:00
|
|
|
return Optional<Selection>{};
|
2012-01-04 15:18:08 +01:00
|
|
|
}
|
|
|
|
|
2013-05-15 14:24:09 +02:00
|
|
|
if (flags & ObjectFlags::Inner)
|
2012-01-04 15:18:08 +01:00
|
|
|
{
|
2013-10-08 20:24:56 +02:00
|
|
|
if (to_begin and first != last)
|
2013-01-07 18:53:27 +01:00
|
|
|
++first;
|
|
|
|
if (to_end and first != last)
|
2012-01-04 15:18:08 +01:00
|
|
|
--last;
|
|
|
|
}
|
2013-04-22 14:18:49 +02:00
|
|
|
return to_end ? utf8_range(first, last) : utf8_range(last, first);
|
|
|
|
}
|
|
|
|
|
2013-06-01 14:22:57 +02:00
|
|
|
Selection select_surrounding(const Buffer& buffer, const Selection& selection,
|
2013-10-08 20:24:56 +02:00
|
|
|
CodepointPair matching, int level,
|
2013-05-15 14:24:09 +02:00
|
|
|
ObjectFlags flags)
|
2013-04-22 14:18:49 +02:00
|
|
|
{
|
2014-01-05 15:30:26 +01:00
|
|
|
const bool nestable = matching.first != matching.second;
|
2014-01-28 20:05:49 +01:00
|
|
|
auto pos = selection.cursor();
|
2014-01-05 15:30:26 +01:00
|
|
|
if (not nestable or flags & ObjectFlags::Inner)
|
|
|
|
{
|
2013-10-08 20:24:56 +02:00
|
|
|
if (auto res = find_surrounding(buffer, pos, matching, flags, level))
|
|
|
|
return *res;
|
|
|
|
return selection;
|
2014-01-05 15:30:26 +01:00
|
|
|
}
|
2013-10-08 20:24:56 +02:00
|
|
|
|
2014-01-05 15:30:26 +01:00
|
|
|
auto c = buffer.byte_at(pos);
|
2013-10-08 20:24:56 +02:00
|
|
|
if ((flags == ObjectFlags::ToBegin and c == matching.first) or
|
|
|
|
(flags == ObjectFlags::ToEnd and c == matching.second))
|
|
|
|
++level;
|
|
|
|
|
|
|
|
auto res = find_surrounding(buffer, pos, matching, flags, level);
|
2013-04-22 14:18:49 +02:00
|
|
|
if (not res)
|
|
|
|
return selection;
|
|
|
|
|
2013-05-15 14:24:09 +02:00
|
|
|
if (flags == (ObjectFlags::ToBegin | ObjectFlags::ToEnd) and
|
2013-10-08 20:24:56 +02:00
|
|
|
res->min() == selection.min() and res->max() == selection.max())
|
2013-04-22 14:18:49 +02:00
|
|
|
{
|
2013-10-08 20:24:56 +02:00
|
|
|
if (auto res_parent = find_surrounding(buffer, pos, matching, flags, level+1))
|
|
|
|
return Selection{*res_parent};
|
2013-04-22 14:18:49 +02:00
|
|
|
}
|
|
|
|
return *res;
|
2012-01-04 15:18:08 +01:00
|
|
|
}
|
|
|
|
|
2013-06-01 14:22:57 +02:00
|
|
|
Selection select_to(const Buffer& buffer, const Selection& selection,
|
2012-11-30 18:32:49 +01:00
|
|
|
Codepoint c, int count, bool inclusive)
|
2011-09-22 16:35:28 +02:00
|
|
|
{
|
2014-01-28 20:05:49 +01:00
|
|
|
Utf8Iterator begin = buffer.iterator_at(selection.cursor());
|
2012-10-08 19:12:09 +02:00
|
|
|
Utf8Iterator end = begin;
|
2011-09-27 16:27:48 +02:00
|
|
|
do
|
|
|
|
{
|
|
|
|
++end;
|
2013-06-04 18:53:56 +02:00
|
|
|
skip_while(end, buffer.end(), [c](Codepoint cur) { return cur != c; });
|
|
|
|
if (end == buffer.end())
|
2012-02-07 15:26:51 +01:00
|
|
|
return selection;
|
2011-09-27 16:27:48 +02:00
|
|
|
}
|
|
|
|
while (--count > 0);
|
|
|
|
|
2013-04-22 14:18:49 +02:00
|
|
|
return utf8_range(begin, inclusive ? end : end-1);
|
2011-09-22 16:35:28 +02:00
|
|
|
}
|
|
|
|
|
2013-06-01 14:22:57 +02:00
|
|
|
Selection select_to_reverse(const Buffer& buffer, const Selection& selection,
|
2012-11-30 18:32:49 +01:00
|
|
|
Codepoint c, int count, bool inclusive)
|
2011-10-03 16:29:44 +02:00
|
|
|
{
|
2014-01-28 20:05:49 +01:00
|
|
|
Utf8Iterator begin = buffer.iterator_at(selection.cursor());
|
2012-10-08 19:12:09 +02:00
|
|
|
Utf8Iterator end = begin;
|
2011-10-03 16:29:44 +02:00
|
|
|
do
|
|
|
|
{
|
|
|
|
--end;
|
2013-06-04 18:53:56 +02:00
|
|
|
skip_while_reverse(end, buffer.begin(), [c](Codepoint cur) { return cur != c; });
|
|
|
|
if (end == buffer.begin())
|
2012-02-07 15:26:51 +01:00
|
|
|
return selection;
|
2011-10-03 16:29:44 +02:00
|
|
|
}
|
|
|
|
while (--count > 0);
|
|
|
|
|
2013-04-22 14:18:49 +02:00
|
|
|
return utf8_range(begin, inclusive ? end : end+1);
|
2011-10-03 16:29:44 +02:00
|
|
|
}
|
|
|
|
|
2013-06-01 14:22:57 +02:00
|
|
|
Selection select_to_eol(const Buffer& buffer, const Selection& selection)
|
2011-10-10 16:24:17 +02:00
|
|
|
{
|
2014-01-28 20:05:49 +01:00
|
|
|
Utf8Iterator begin = buffer.iterator_at(selection.cursor());
|
2014-01-02 20:28:37 +01:00
|
|
|
Utf8Iterator end = begin;
|
2013-06-04 18:53:56 +02:00
|
|
|
skip_while(end, buffer.end(), [](Codepoint cur) { return not is_eol(cur); });
|
2014-01-02 20:28:37 +01:00
|
|
|
return utf8_range(begin, end != begin ? end-1 : end);
|
2011-10-10 16:24:17 +02:00
|
|
|
}
|
|
|
|
|
2013-06-01 14:22:57 +02:00
|
|
|
Selection select_to_eol_reverse(const Buffer& buffer, const Selection& selection)
|
2011-10-10 16:24:17 +02:00
|
|
|
{
|
2014-01-28 20:05:49 +01:00
|
|
|
Utf8Iterator begin = buffer.iterator_at(selection.cursor());
|
2012-10-08 19:12:09 +02:00
|
|
|
Utf8Iterator end = begin - 1;
|
2013-06-04 18:53:56 +02:00
|
|
|
skip_while_reverse(end, buffer.begin(), [](Codepoint cur) { return not is_eol(cur); });
|
|
|
|
return utf8_range(begin, end == buffer.begin() ? end : end+1);
|
2011-10-10 16:24:17 +02:00
|
|
|
}
|
|
|
|
|
2014-05-27 10:50:12 +02:00
|
|
|
Selection select_number(const Buffer& buffer, const Selection& selection, ObjectFlags flags)
|
|
|
|
{
|
|
|
|
auto is_number = [&](char c) {
|
|
|
|
return (c >= '0' and c <= '9') or
|
|
|
|
(not (flags & ObjectFlags::Inner) and c == '.');
|
|
|
|
};
|
|
|
|
|
|
|
|
BufferIterator first = buffer.iterator_at(selection.cursor());
|
|
|
|
if (flags & ObjectFlags::ToBegin)
|
|
|
|
{
|
|
|
|
skip_while_reverse(first, buffer.begin(), is_number);
|
|
|
|
if (not is_number(*first) or not *first == '-')
|
|
|
|
++first;
|
|
|
|
}
|
|
|
|
BufferIterator last = buffer.iterator_at(selection.cursor());
|
|
|
|
if (flags & ObjectFlags::ToEnd)
|
|
|
|
{
|
|
|
|
skip_while(last, buffer.end(), is_number);
|
|
|
|
--last;
|
|
|
|
}
|
|
|
|
|
|
|
|
return (flags & ObjectFlags::ToEnd) ? Selection{first.coord(), last.coord()}
|
|
|
|
: Selection{last.coord(), first.coord()};
|
|
|
|
}
|
|
|
|
|
2014-03-30 12:13:37 +02:00
|
|
|
static bool is_end_of_sentence(char c)
|
|
|
|
{
|
|
|
|
return c == '.' or c == ';' or c == '!' or c == '?';
|
|
|
|
}
|
|
|
|
|
2014-05-26 22:44:57 +02:00
|
|
|
Selection select_sentence(const Buffer& buffer, const Selection& selection, ObjectFlags flags)
|
2013-04-30 14:21:48 +02:00
|
|
|
{
|
2014-01-28 20:05:49 +01:00
|
|
|
BufferIterator first = buffer.iterator_at(selection.cursor());
|
2014-03-31 22:46:47 +02:00
|
|
|
|
|
|
|
if (not (flags & ObjectFlags::ToEnd))
|
|
|
|
{
|
|
|
|
BufferIterator prev_non_blank = first-1;
|
|
|
|
skip_while_reverse(prev_non_blank, buffer.begin(),
|
|
|
|
[](char c) { return is_blank(c) or is_eol(c); });
|
|
|
|
if (is_end_of_sentence(*prev_non_blank))
|
|
|
|
first = prev_non_blank;
|
|
|
|
}
|
|
|
|
|
2013-05-15 14:24:09 +02:00
|
|
|
BufferIterator last = first;
|
2013-04-30 14:21:48 +02:00
|
|
|
|
2013-05-15 14:24:09 +02:00
|
|
|
if (flags & ObjectFlags::ToBegin)
|
2013-04-30 14:21:48 +02:00
|
|
|
{
|
2013-05-15 14:24:09 +02:00
|
|
|
bool saw_non_blank = false;
|
2013-06-04 18:53:56 +02:00
|
|
|
while (first != buffer.begin())
|
2013-04-30 14:21:48 +02:00
|
|
|
{
|
2013-05-15 14:24:09 +02:00
|
|
|
char cur = *first;
|
|
|
|
char prev = *(first-1);
|
|
|
|
if (not is_blank(cur))
|
|
|
|
saw_non_blank = true;
|
|
|
|
if (is_eol(prev) and is_eol(cur))
|
|
|
|
{
|
|
|
|
++first;
|
|
|
|
break;
|
|
|
|
}
|
2014-03-30 12:13:37 +02:00
|
|
|
else if (is_end_of_sentence(prev))
|
2013-05-15 14:24:09 +02:00
|
|
|
{
|
|
|
|
if (saw_non_blank)
|
|
|
|
break;
|
|
|
|
else if (flags & ObjectFlags::ToEnd)
|
|
|
|
last = first-1;
|
|
|
|
}
|
|
|
|
--first;
|
2013-04-30 14:21:48 +02:00
|
|
|
}
|
2013-06-04 18:53:56 +02:00
|
|
|
skip_while(first, buffer.end(), is_blank);
|
2013-04-30 14:21:48 +02:00
|
|
|
}
|
2013-05-15 14:24:09 +02:00
|
|
|
if (flags & ObjectFlags::ToEnd)
|
2013-04-30 14:21:48 +02:00
|
|
|
{
|
2013-06-04 18:53:56 +02:00
|
|
|
while (last != buffer.end())
|
2013-05-15 14:24:09 +02:00
|
|
|
{
|
|
|
|
char cur = *last;
|
2014-03-30 12:13:37 +02:00
|
|
|
if (is_end_of_sentence(cur) or
|
2013-06-04 18:53:56 +02:00
|
|
|
(is_eol(cur) and (last+1 == buffer.end() or is_eol(*(last+1)))))
|
2013-05-15 14:24:09 +02:00
|
|
|
break;
|
|
|
|
++last;
|
|
|
|
}
|
2013-06-04 18:53:56 +02:00
|
|
|
if (not (flags & ObjectFlags::Inner) and last != buffer.end())
|
2013-05-15 14:24:09 +02:00
|
|
|
{
|
|
|
|
++last;
|
2013-06-04 18:53:56 +02:00
|
|
|
skip_while(last, buffer.end(), is_blank);
|
2013-05-15 14:24:09 +02:00
|
|
|
--last;
|
|
|
|
}
|
2013-04-30 14:21:48 +02:00
|
|
|
}
|
2013-06-04 19:23:11 +02:00
|
|
|
return (flags & ObjectFlags::ToEnd) ? Selection{first.coord(), last.coord()}
|
|
|
|
: Selection{last.coord(), first.coord()};
|
2013-04-30 14:21:48 +02:00
|
|
|
}
|
|
|
|
|
2014-05-26 22:44:57 +02:00
|
|
|
Selection select_paragraph(const Buffer& buffer, const Selection& selection, ObjectFlags flags)
|
2013-04-30 14:29:18 +02:00
|
|
|
{
|
2014-01-28 20:05:49 +01:00
|
|
|
BufferIterator first = buffer.iterator_at(selection.cursor());
|
2014-03-31 22:46:47 +02:00
|
|
|
|
2014-05-24 18:08:01 +02:00
|
|
|
if (not (flags & ObjectFlags::ToEnd) and first.coord() > ByteCoord{0,1} and
|
2014-03-31 22:46:47 +02:00
|
|
|
*(first-1) == '\n' and *(first-2) == '\n')
|
|
|
|
--first;
|
2014-05-04 12:21:19 +02:00
|
|
|
else if ((flags & ObjectFlags::ToEnd) and
|
|
|
|
first != buffer.begin() and (first+1) != buffer.end() and
|
|
|
|
*(first-1) == '\n' and *first == '\n')
|
|
|
|
++first;
|
2014-03-31 22:46:47 +02:00
|
|
|
|
2013-05-15 14:24:09 +02:00
|
|
|
BufferIterator last = first;
|
2013-04-30 14:29:18 +02:00
|
|
|
|
2014-03-31 22:46:47 +02:00
|
|
|
if ((flags & ObjectFlags::ToBegin) and first != buffer.begin())
|
2013-04-30 14:29:18 +02:00
|
|
|
{
|
2013-06-04 18:53:56 +02:00
|
|
|
skip_while_reverse(first, buffer.begin(), is_eol);
|
2013-05-15 14:24:09 +02:00
|
|
|
if (flags & ObjectFlags::ToEnd)
|
|
|
|
last = first;
|
2013-06-04 18:53:56 +02:00
|
|
|
while (first != buffer.begin())
|
2013-04-30 14:29:18 +02:00
|
|
|
{
|
2013-05-15 14:24:09 +02:00
|
|
|
char cur = *first;
|
|
|
|
char prev = *(first-1);
|
|
|
|
if (is_eol(prev) and is_eol(cur))
|
|
|
|
{
|
|
|
|
++first;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
--first;
|
2013-04-30 14:29:18 +02:00
|
|
|
}
|
|
|
|
}
|
2013-05-15 14:24:09 +02:00
|
|
|
if (flags & ObjectFlags::ToEnd)
|
2013-04-30 14:29:18 +02:00
|
|
|
{
|
2014-03-30 12:13:45 +02:00
|
|
|
if (last != buffer.end() && is_eol(*last))
|
|
|
|
++last;
|
2013-06-04 18:53:56 +02:00
|
|
|
while (last != buffer.end())
|
2013-04-30 14:29:18 +02:00
|
|
|
{
|
2014-06-14 15:07:03 +02:00
|
|
|
if (last != buffer.begin() and is_eol(*last) and is_eol(*(last-1)))
|
2013-05-15 14:24:09 +02:00
|
|
|
{
|
|
|
|
if (not (flags & ObjectFlags::Inner))
|
2013-06-04 18:53:56 +02:00
|
|
|
skip_while(last, buffer.end(), is_eol);
|
2013-05-15 14:24:09 +02:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
++last;
|
2013-04-30 14:29:18 +02:00
|
|
|
}
|
2013-06-03 14:27:51 +02:00
|
|
|
--last;
|
2013-04-30 14:29:18 +02:00
|
|
|
}
|
2013-06-04 19:23:11 +02:00
|
|
|
return (flags & ObjectFlags::ToEnd) ? Selection{first.coord(), last.coord()}
|
|
|
|
: Selection{last.coord(), first.coord()};
|
2013-04-30 14:29:18 +02:00
|
|
|
}
|
|
|
|
|
2013-07-22 19:58:16 +02:00
|
|
|
static CharCount get_indent(const String& str, int tabstop)
|
|
|
|
{
|
|
|
|
CharCount indent = 0;
|
|
|
|
for (auto& c : str)
|
|
|
|
{
|
|
|
|
if (c == ' ')
|
|
|
|
++indent;
|
|
|
|
else if (c =='\t')
|
|
|
|
indent = (indent / tabstop + 1) * tabstop;
|
|
|
|
else
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
return indent;
|
|
|
|
}
|
|
|
|
|
2014-06-11 15:00:45 +02:00
|
|
|
Selection select_whitespaces(const Buffer& buffer, const Selection& selection, ObjectFlags flags)
|
|
|
|
{
|
|
|
|
auto is_whitespace = [&](char c) {
|
|
|
|
return c == ' ' or c == '\t' or
|
|
|
|
(not (flags & ObjectFlags::Inner) and c == '\n');
|
|
|
|
};
|
|
|
|
BufferIterator first = buffer.iterator_at(selection.cursor());
|
|
|
|
BufferIterator last = first;
|
|
|
|
if (flags & ObjectFlags::ToBegin)
|
|
|
|
{
|
|
|
|
if (is_whitespace(*first))
|
|
|
|
{
|
|
|
|
skip_while_reverse(first, buffer.begin(), is_whitespace);
|
|
|
|
if (not is_whitespace(*first))
|
|
|
|
++first;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if (flags & ObjectFlags::ToEnd)
|
|
|
|
{
|
|
|
|
if (is_whitespace(*last))
|
|
|
|
{
|
|
|
|
skip_while(last, buffer.end(), is_whitespace);
|
|
|
|
--last;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return (flags & ObjectFlags::ToEnd) ? utf8_range(first, last)
|
|
|
|
: utf8_range(last, first);
|
|
|
|
}
|
|
|
|
|
2014-05-26 22:33:31 +02:00
|
|
|
static bool is_only_whitespaces(const String& str)
|
|
|
|
{
|
|
|
|
auto it = str.begin();
|
|
|
|
skip_while(it, str.end(),
|
|
|
|
[](char c){ return c == ' ' or c == '\t' or c == '\n'; });
|
|
|
|
return it == str.end();
|
|
|
|
}
|
|
|
|
|
2014-05-26 22:44:57 +02:00
|
|
|
Selection select_indent(const Buffer& buffer, const Selection& selection, ObjectFlags flags)
|
2013-07-22 19:58:16 +02:00
|
|
|
{
|
|
|
|
int tabstop = buffer.options()["tabstop"].get<int>();
|
2014-01-28 20:05:49 +01:00
|
|
|
LineCount line = selection.cursor().line;
|
2013-07-22 19:58:16 +02:00
|
|
|
auto indent = get_indent(buffer[line], tabstop);
|
|
|
|
|
|
|
|
LineCount begin_line = line - 1;
|
|
|
|
if (flags & ObjectFlags::ToBegin)
|
|
|
|
{
|
|
|
|
while (begin_line >= 0 and (buffer[begin_line] == "\n" or get_indent(buffer[begin_line], tabstop) >= indent))
|
|
|
|
--begin_line;
|
|
|
|
}
|
|
|
|
++begin_line;
|
|
|
|
LineCount end_line = line + 1;
|
|
|
|
if (flags & ObjectFlags::ToEnd)
|
|
|
|
{
|
2014-05-26 22:33:31 +02:00
|
|
|
const LineCount end = buffer.line_count();
|
2013-07-22 19:58:16 +02:00
|
|
|
while (end_line < end and (buffer[end_line] == "\n" or get_indent(buffer[end_line], tabstop) >= indent))
|
|
|
|
++end_line;
|
|
|
|
}
|
|
|
|
--end_line;
|
2014-05-26 22:33:31 +02:00
|
|
|
// remove only whitespaces lines in inner mode
|
2013-07-27 15:37:28 +02:00
|
|
|
if (flags & ObjectFlags::Inner)
|
|
|
|
{
|
2014-05-26 22:33:31 +02:00
|
|
|
while (begin_line < end_line and
|
|
|
|
is_only_whitespaces(buffer[begin_line]))
|
|
|
|
++begin_line;
|
|
|
|
while (begin_line < end_line and
|
|
|
|
is_only_whitespaces(buffer[end_line]))
|
|
|
|
--end_line;
|
2013-07-27 15:37:28 +02:00
|
|
|
}
|
2014-05-26 22:33:31 +02:00
|
|
|
return Selection{begin_line, {end_line, buffer[end_line].length() - 1}};
|
2013-07-22 19:58:16 +02:00
|
|
|
}
|
|
|
|
|
2014-05-26 22:44:57 +02:00
|
|
|
Selection select_lines(const Buffer& buffer, const Selection& selection)
|
2011-11-21 19:53:22 +01:00
|
|
|
{
|
2013-01-03 14:30:14 +01:00
|
|
|
// no need to be utf8 aware for is_eol as we only use \n as line seperator
|
2014-01-28 20:05:49 +01:00
|
|
|
BufferIterator first = buffer.iterator_at(selection.anchor());
|
|
|
|
BufferIterator last = buffer.iterator_at(selection.cursor());
|
2013-01-03 14:30:14 +01:00
|
|
|
BufferIterator& to_line_start = first <= last ? first : last;
|
|
|
|
BufferIterator& to_line_end = first <= last ? last : first;
|
2011-11-21 19:53:22 +01:00
|
|
|
|
2013-01-03 14:30:14 +01:00
|
|
|
--to_line_start;
|
2013-06-04 18:53:56 +02:00
|
|
|
skip_while_reverse(to_line_start, buffer.begin(), [](char cur) { return not is_eol(cur); });
|
2013-01-03 14:30:14 +01:00
|
|
|
if (is_eol(*to_line_start))
|
2014-04-10 21:06:17 +02:00
|
|
|
{
|
|
|
|
if (++to_line_start == buffer.end())
|
|
|
|
--to_line_start;
|
|
|
|
}
|
2011-11-22 19:58:05 +01:00
|
|
|
|
2013-06-04 18:53:56 +02:00
|
|
|
skip_while(to_line_end, buffer.end(), [](char cur) { return not is_eol(cur); });
|
|
|
|
if (to_line_end == buffer.end())
|
2013-05-23 19:38:51 +02:00
|
|
|
--to_line_end;
|
2011-11-21 19:53:22 +01:00
|
|
|
|
2013-06-04 19:23:11 +02:00
|
|
|
return Selection(first.coord(), last.coord());
|
2012-02-07 15:26:51 +01:00
|
|
|
}
|
|
|
|
|
2013-06-01 14:22:57 +02:00
|
|
|
Selection trim_partial_lines(const Buffer& buffer, const Selection& selection)
|
2013-04-16 14:30:11 +02:00
|
|
|
{
|
2014-05-26 22:44:57 +02:00
|
|
|
// same as select_lines
|
2014-01-28 20:05:49 +01:00
|
|
|
BufferIterator first = buffer.iterator_at(selection.anchor());
|
|
|
|
BufferIterator last = buffer.iterator_at(selection.cursor());
|
2013-04-16 14:30:11 +02:00
|
|
|
BufferIterator& to_line_start = first <= last ? first : last;
|
|
|
|
BufferIterator& to_line_end = first <= last ? last : first;
|
|
|
|
|
2013-06-04 18:53:56 +02:00
|
|
|
while (to_line_start != buffer.begin() and *(to_line_start-1) != '\n')
|
2013-04-16 14:30:11 +02:00
|
|
|
++to_line_start;
|
|
|
|
while (*(to_line_end+1) != '\n' and to_line_end != to_line_start)
|
|
|
|
--to_line_end;
|
|
|
|
|
2013-06-04 19:23:11 +02:00
|
|
|
return Selection(first.coord(), last.coord());
|
2013-04-16 14:30:11 +02:00
|
|
|
}
|
|
|
|
|
2014-05-27 01:35:12 +02:00
|
|
|
void select_buffer(SelectionList& selections)
|
2012-02-07 15:26:51 +01:00
|
|
|
{
|
2014-05-25 21:28:32 +02:00
|
|
|
auto& buffer = selections.buffer();
|
2014-05-13 00:25:15 +02:00
|
|
|
selections = SelectionList{ buffer, Selection({0,0}, buffer.back_coord()) };
|
2011-11-21 19:53:22 +01:00
|
|
|
}
|
|
|
|
|
2014-05-25 21:28:32 +02:00
|
|
|
void select_all_matches(SelectionList& selections, const Regex& regex)
|
2011-11-21 20:08:51 +01:00
|
|
|
{
|
2014-05-14 00:22:54 +02:00
|
|
|
std::vector<Selection> result;
|
2014-05-25 21:28:32 +02:00
|
|
|
auto& buffer = selections.buffer();
|
2013-12-13 00:56:53 +01:00
|
|
|
for (auto& sel : selections)
|
2013-04-05 19:28:08 +02:00
|
|
|
{
|
2013-12-13 00:56:53 +01:00
|
|
|
auto sel_end = utf8::next(buffer.iterator_at(sel.max()));
|
|
|
|
RegexIterator re_it(buffer.iterator_at(sel.min()), sel_end, regex);
|
|
|
|
RegexIterator re_end;
|
2012-03-04 21:11:22 +01:00
|
|
|
|
2013-12-13 00:56:53 +01:00
|
|
|
for (; re_it != re_end; ++re_it)
|
|
|
|
{
|
|
|
|
auto& begin = (*re_it)[0].first;
|
|
|
|
auto& end = (*re_it)[0].second;
|
|
|
|
|
|
|
|
if (begin == sel_end)
|
|
|
|
continue;
|
2012-09-19 14:04:09 +02:00
|
|
|
|
2013-12-13 00:56:53 +01:00
|
|
|
CaptureList captures;
|
|
|
|
for (auto& match : *re_it)
|
|
|
|
captures.emplace_back(match.first, match.second);
|
2011-11-21 20:30:44 +01:00
|
|
|
|
2014-05-11 20:44:19 +02:00
|
|
|
result.push_back({ begin.coord(),
|
|
|
|
(begin == end ? end : utf8::previous(end)).coord(),
|
|
|
|
std::move(captures) });
|
2013-12-13 00:56:53 +01:00
|
|
|
}
|
2011-11-21 20:30:44 +01:00
|
|
|
}
|
2013-12-13 10:11:48 +01:00
|
|
|
if (result.empty())
|
|
|
|
throw runtime_error("nothing selected");
|
|
|
|
selections = std::move(result);
|
2011-11-21 20:30:44 +01:00
|
|
|
}
|
|
|
|
|
2014-05-25 21:28:32 +02:00
|
|
|
void split_selections(SelectionList& selections, const Regex& regex)
|
2011-11-21 20:30:44 +01:00
|
|
|
{
|
2014-05-14 00:22:54 +02:00
|
|
|
std::vector<Selection> result;
|
2014-05-25 21:28:32 +02:00
|
|
|
auto& buffer = selections.buffer();
|
2013-12-13 00:56:53 +01:00
|
|
|
for (auto& sel : selections)
|
2012-03-04 21:11:22 +01:00
|
|
|
{
|
2013-12-13 00:56:53 +01:00
|
|
|
auto begin = buffer.iterator_at(sel.min());
|
|
|
|
auto sel_end = utf8::next(buffer.iterator_at(sel.max()));
|
|
|
|
RegexIterator re_it(begin, sel_end, regex,
|
|
|
|
boost::regex_constants::match_nosubs);
|
|
|
|
RegexIterator re_end;
|
2013-04-05 19:28:08 +02:00
|
|
|
|
2013-12-13 00:56:53 +01:00
|
|
|
for (; re_it != re_end; ++re_it)
|
|
|
|
{
|
|
|
|
BufferIterator end = (*re_it)[0].first;
|
|
|
|
|
2014-05-11 20:44:19 +02:00
|
|
|
result.push_back({ begin.coord(), (begin == end) ? end.coord() : utf8::previous(end).coord() });
|
2013-12-13 00:56:53 +01:00
|
|
|
begin = (*re_it)[0].second;
|
|
|
|
}
|
2014-01-04 15:23:08 +01:00
|
|
|
if (begin.coord() <= sel.max())
|
2014-05-11 20:44:19 +02:00
|
|
|
result.push_back({ begin.coord(), sel.max() });
|
2011-11-21 20:08:51 +01:00
|
|
|
}
|
2013-12-13 10:11:48 +01:00
|
|
|
selections = std::move(result);
|
2011-11-21 20:08:51 +01:00
|
|
|
}
|
|
|
|
|
2011-09-21 16:37:09 +02:00
|
|
|
}
|