libcubescript/src/lib_list.cc

635 lines
18 KiB
C++
Raw Normal View History

2016-09-07 22:57:28 +02:00
#include "cubescript/cubescript.hh"
#include "cs_util.hh"
namespace cscript {
2016-08-17 20:51:21 +02:00
template<typename T>
struct CsArgVal;
template<>
struct CsArgVal<CsInt> {
2016-08-18 20:38:30 +02:00
static CsInt get(CsValue &tv) {
2016-08-17 20:51:21 +02:00
return tv.get_int();
}
};
template<>
struct CsArgVal<CsFloat> {
2016-08-18 20:38:30 +02:00
static CsFloat get(CsValue &tv) {
2016-08-17 20:51:21 +02:00
return tv.get_float();
}
};
template<>
struct CsArgVal<ostd::ConstCharRange> {
2016-08-18 20:38:30 +02:00
static ostd::ConstCharRange get(CsValue &tv) {
2016-08-17 20:51:21 +02:00
return tv.get_strr();
}
};
template<typename T, typename F>
static inline void cs_list_find(
CsState &cs, CsValueRange args, CsValue &res, F cmp
) {
2016-08-17 20:51:21 +02:00
CsInt n = 0, skip = args[2].get_int();
T val = CsArgVal<T>::get(args[1]);
for (util::ListParser p(cs, args[0].get_strr()); p.parse(); ++n) {
2016-08-17 20:51:21 +02:00
if (cmp(p, val)) {
res.set_int(n);
return;
}
for (int i = 0; i < skip; ++i) {
if (!p.parse()) {
goto notfound;
}
++n;
}
}
notfound:
res.set_int(-1);
}
template<typename T, typename F>
static inline void cs_list_assoc(
CsState &cs, CsValueRange args, CsValue &res, F cmp
) {
2016-08-17 20:51:21 +02:00
T val = CsArgVal<T>::get(args[1]);
for (util::ListParser p(cs, args[0].get_strr()); p.parse();) {
2016-08-17 20:51:21 +02:00
if (cmp(p, val)) {
if (p.parse()) {
2016-11-07 23:33:53 +01:00
res.set_str(p.get_item());
2016-08-17 20:51:21 +02:00
}
return;
}
if (!p.parse()) {
break;
}
}
}
static void cs_loop_list_conc(
2016-08-29 19:17:11 +02:00
CsState &cs, CsValue &res, CsIdent *id, ostd::ConstCharRange list,
2016-08-30 22:29:09 +02:00
CsBytecode *body, bool space
) {
2016-08-31 19:49:24 +02:00
CsStackedValue idv{id};
if (!idv.has_alias()) {
return;
2016-08-17 20:51:21 +02:00
}
2016-09-15 22:34:52 +02:00
CsString r;
int n = 0;
for (util::ListParser p(cs, list); p.parse(); ++n) {
2016-11-07 23:33:53 +01:00
idv.set_str(p.get_item());
2016-08-31 19:49:24 +02:00
idv.push();
2016-08-17 20:51:21 +02:00
if (n && space) {
2016-09-15 22:34:52 +02:00
r += ' ';
2016-08-17 20:51:21 +02:00
}
2016-08-18 20:38:30 +02:00
CsValue v;
2016-09-14 23:24:13 +02:00
switch (cs.run_loop(body, v)) {
case CsLoopState::Break:
goto end;
case CsLoopState::Continue:
continue;
default:
break;
}
2016-09-15 22:34:52 +02:00
r += v.get_str();
}
2016-09-14 23:24:13 +02:00
end:
2017-01-25 01:57:33 +01:00
res.set_str(std::move(r));
}
int cs_list_includes(
CsState &cs, ostd::ConstCharRange list, ostd::ConstCharRange needle
) {
int offset = 0;
for (util::ListParser p(cs, list); p.parse();) {
2016-11-07 23:33:53 +01:00
if (p.get_raw_item() == needle) {
return offset;
2016-08-17 20:51:21 +02:00
}
++offset;
}
return -1;
}
2016-08-17 20:51:21 +02:00
template<bool PushList, bool Swap, typename F>
static inline void cs_list_merge(
CsState &cs, CsValueRange args, CsValue &res, F cmp
) {
2016-08-17 20:51:21 +02:00
ostd::ConstCharRange list = args[0].get_strr();
ostd::ConstCharRange elems = args[1].get_strr();
2016-09-15 22:34:52 +02:00
CsString buf;
2016-08-17 20:51:21 +02:00
if (PushList) {
2016-09-15 22:34:52 +02:00
buf += list;
2016-08-17 20:51:21 +02:00
}
if (Swap) {
ostd::swap(list, elems);
}
for (util::ListParser p(cs, list); p.parse();) {
2016-11-07 23:33:53 +01:00
if (cmp(cs_list_includes(cs, elems, p.get_raw_item()), 0)) {
2016-08-17 20:52:18 +02:00
if (!buf.empty()) {
2016-09-15 22:34:52 +02:00
buf += ' ';
2016-08-17 20:52:18 +02:00
}
2016-11-07 23:33:53 +01:00
buf += p.get_raw_item(true);
2016-08-17 20:51:21 +02:00
}
}
2017-01-25 01:57:33 +01:00
res.set_str(std::move(buf));
2016-08-17 20:51:21 +02:00
}
static void cs_init_lib_list_sort(CsState &cs);
void cs_init_lib_list(CsState &gcs) {
gcs.new_command("listlen", "s", [](auto &cs, auto args, auto &res) {
res.set_int(CsInt(util::ListParser(cs, args[0].get_strr()).count()));
});
gcs.new_command("at", "si1V", [](auto &cs, auto args, auto &res) {
2016-08-17 20:51:21 +02:00
if (args.empty()) {
return;
2016-08-17 20:51:21 +02:00
}
2017-01-25 01:57:33 +01:00
CsString str = std::move(args[0].get_str());
util::ListParser p(cs, str);
2016-11-07 23:33:53 +01:00
p.get_raw_item() = str;
2017-01-25 02:09:50 +01:00
for (size_t i = 1; i < args.size(); ++i) {
2016-10-27 00:49:16 +02:00
p.get_input() = str;
2016-08-14 18:35:38 +02:00
CsInt pos = args[i].get_int();
2016-08-17 20:51:21 +02:00
for (; pos > 0; --pos) {
if (!p.parse()) {
break;
}
}
if (pos > 0 || !p.parse()) {
2016-11-07 23:33:53 +01:00
p.get_raw_item() = p.get_raw_item(true) = ostd::ConstCharRange();
2016-08-17 20:51:21 +02:00
}
}
2016-11-07 23:33:53 +01:00
res.set_str(p.get_item());
});
gcs.new_command("sublist", "siiN", [](auto &cs, auto args, auto &res) {
2016-08-14 18:35:38 +02:00
CsInt skip = args[1].get_int(),
count = args[2].get_int(),
2016-10-24 02:38:52 +02:00
numargs = args[3].get_int();
CsInt offset = ostd::max(skip, CsInt(0)),
len = (numargs >= 3) ? ostd::max(count, CsInt(0)) : -1;
util::ListParser p(cs, args[0].get_strr());
2016-08-17 20:51:21 +02:00
for (CsInt i = 0; i < offset; ++i) {
if (!p.parse()) break;
2016-08-17 20:51:21 +02:00
}
if (len < 0) {
2016-08-17 20:51:21 +02:00
if (offset > 0) {
p.skip();
2016-08-17 20:51:21 +02:00
}
2016-10-27 00:49:16 +02:00
res.set_str(p.get_input());
return;
}
2016-10-27 00:49:16 +02:00
char const *list = p.get_input().data();
2016-11-07 23:33:53 +01:00
p.get_raw_item(true) = ostd::ConstCharRange();
2016-08-17 20:51:21 +02:00
if (len > 0 && p.parse()) {
while (--len > 0 && p.parse());
2016-08-17 20:51:21 +02:00
}
2016-11-07 23:33:53 +01:00
ostd::ConstCharRange quote = p.get_raw_item(true);
char const *qend = !quote.empty() ? &quote[quote.size()] : list;
res.set_str(ostd::ConstCharRange(list, qend - list));
});
gcs.new_command("listfind", "rse", [](auto &cs, auto args, auto &res) {
2016-08-31 19:49:24 +02:00
CsStackedValue idv{args[0].get_ident()};
if (!idv.has_alias()) {
res.set_int(-1);
return;
}
2016-08-31 19:49:24 +02:00
auto body = args[2].get_code();
int n = -1;
for (util::ListParser p(cs, args[1].get_strr()); p.parse();) {
++n;
2016-11-07 23:33:53 +01:00
idv.set_str(p.get_raw_item());
2016-08-31 19:49:24 +02:00
idv.push();
if (cs.run_bool(body)) {
2016-08-14 18:35:38 +02:00
res.set_int(CsInt(n));
2016-08-31 19:49:24 +02:00
return;
}
}
res.set_int(-1);
});
gcs.new_command("listassoc", "rse", [](auto &cs, auto args, auto &res) {
2016-08-31 19:49:24 +02:00
CsStackedValue idv{args[0].get_ident()};
if (!idv.has_alias()) {
return;
2016-08-17 20:51:21 +02:00
}
2016-08-31 19:49:24 +02:00
auto body = args[2].get_code();
int n = -1;
for (util::ListParser p(cs, args[1].get_strr()); p.parse();) {
++n;
2016-11-07 23:33:53 +01:00
idv.set_str(p.get_raw_item());
2016-08-31 19:49:24 +02:00
idv.push();
if (cs.run_bool(body)) {
if (p.parse()) {
2016-11-07 23:33:53 +01:00
res.set_str(p.get_item());
}
break;
}
2016-08-17 20:51:21 +02:00
if (!p.parse()) {
break;
2016-08-17 20:51:21 +02:00
}
}
});
gcs.new_command("listfind=", "i", [](auto &cs, auto args, auto &res) {
2016-08-17 20:51:21 +02:00
cs_list_find<CsInt>(
cs, args, res, [](const util::ListParser &p, CsInt val) {
2016-11-07 23:33:53 +01:00
return cs_parse_int(p.get_raw_item()) == val;
2016-08-17 20:51:21 +02:00
}
);
});
gcs.new_command("listfind=f", "f", [](auto &cs, auto args, auto &res) {
2016-08-17 20:51:21 +02:00
cs_list_find<CsFloat>(
cs, args, res, [](const util::ListParser &p, CsFloat val) {
2016-11-07 23:33:53 +01:00
return cs_parse_float(p.get_raw_item()) == val;
2016-08-17 20:51:21 +02:00
}
);
});
gcs.new_command("listfind=s", "s", [](auto &cs, auto args, auto &res) {
2016-08-17 20:51:21 +02:00
cs_list_find<ostd::ConstCharRange>(
cs, args, res, [](const util::ListParser &p, ostd::ConstCharRange val) {
2016-11-07 23:33:53 +01:00
return p.get_raw_item() == val;
2016-08-17 20:51:21 +02:00
}
);
});
gcs.new_command("listassoc=", "i", [](auto &cs, auto args, auto &res) {
2016-08-17 20:51:21 +02:00
cs_list_assoc<CsInt>(
cs, args, res, [](const util::ListParser &p, CsInt val) {
2016-11-07 23:33:53 +01:00
return cs_parse_int(p.get_raw_item()) == val;
2016-08-17 20:51:21 +02:00
}
);
});
gcs.new_command("listassoc=f", "f", [](auto &cs, auto args, auto &res) {
2016-08-17 20:51:21 +02:00
cs_list_assoc<CsFloat>(
cs, args, res, [](const util::ListParser &p, CsFloat val) {
2016-11-07 23:33:53 +01:00
return cs_parse_float(p.get_raw_item()) == val;
2016-08-17 20:51:21 +02:00
}
);
});
gcs.new_command("listassoc=s", "s", [](auto &cs, auto args, auto &res) {
2016-08-17 20:51:21 +02:00
cs_list_assoc<ostd::ConstCharRange>(
cs, args, res, [](const util::ListParser &p, ostd::ConstCharRange val) {
2016-11-07 23:33:53 +01:00
return p.get_raw_item() == val;
2016-08-17 20:51:21 +02:00
}
);
});
gcs.new_command("looplist", "rse", [](auto &cs, auto args, auto &) {
2016-08-31 19:49:24 +02:00
CsStackedValue idv{args[0].get_ident()};
if (!idv.has_alias()) {
return;
2016-08-17 20:51:21 +02:00
}
2016-08-31 19:49:24 +02:00
auto body = args[2].get_code();
int n = 0;
for (util::ListParser p(cs, args[1].get_strr()); p.parse(); ++n) {
2016-11-07 23:33:53 +01:00
idv.set_str(p.get_item());
2016-08-31 19:49:24 +02:00
idv.push();
2016-09-14 23:24:13 +02:00
switch (cs.run_loop(body)) {
case CsLoopState::Break:
goto end;
default: /* continue and normal */
break;
}
}
2016-09-14 23:24:13 +02:00
end:
return;
});
gcs.new_command("looplist2", "rrse", [](auto &cs, auto args, auto &) {
2016-08-31 19:49:24 +02:00
CsStackedValue idv1{args[0].get_ident()}, idv2{args[1].get_ident()};
if (!idv1.has_alias() || !idv2.has_alias()) {
return;
2016-08-17 20:51:21 +02:00
}
2016-08-31 19:49:24 +02:00
auto body = args[3].get_code();
int n = 0;
for (util::ListParser p(cs, args[2].get_strr()); p.parse(); n += 2) {
2016-11-07 23:33:53 +01:00
idv1.set_str(p.get_item());
2016-09-15 22:34:52 +02:00
if (p.parse()) {
2016-11-07 23:33:53 +01:00
idv2.set_str(p.get_item());
2016-09-15 22:34:52 +02:00
} else {
idv2.set_str("");
}
2016-08-31 19:49:24 +02:00
idv1.push();
idv2.push();
2016-09-14 23:24:13 +02:00
switch (cs.run_loop(body)) {
case CsLoopState::Break:
goto end;
default: /* continue and normal */
break;
}
}
2016-09-14 23:24:13 +02:00
end:
return;
});
gcs.new_command("looplist3", "rrrse", [](auto &cs, auto args, auto &) {
2016-08-31 19:49:24 +02:00
CsStackedValue idv1{args[0].get_ident()};
CsStackedValue idv2{args[1].get_ident()};
CsStackedValue idv3{args[2].get_ident()};
if (!idv1.has_alias() || !idv2.has_alias() || !idv3.has_alias()) {
return;
2016-08-17 20:51:21 +02:00
}
2016-08-31 19:49:24 +02:00
auto body = args[4].get_code();
int n = 0;
for (util::ListParser p(cs, args[3].get_strr()); p.parse(); n += 3) {
2016-11-07 23:33:53 +01:00
idv1.set_str(p.get_item());
2016-09-15 22:34:52 +02:00
if (p.parse()) {
2016-11-07 23:33:53 +01:00
idv2.set_str(p.get_item());
2016-09-15 22:34:52 +02:00
} else {
idv2.set_str("");
}
if (p.parse()) {
2016-11-07 23:33:53 +01:00
idv3.set_str(p.get_item());
2016-09-15 22:34:52 +02:00
} else {
idv3.set_str("");
}
2016-08-31 19:49:24 +02:00
idv1.push();
idv2.push();
idv3.push();
2016-09-14 23:24:13 +02:00
switch (cs.run_loop(body)) {
case CsLoopState::Break:
goto end;
default: /* continue and normal */
break;
}
}
2016-09-14 23:24:13 +02:00
end:
return;
});
gcs.new_command("looplistconcat", "rse", [](auto &cs, auto args, auto &res) {
cs_loop_list_conc(
cs, res, args[0].get_ident(), args[1].get_strr(),
args[2].get_code(), true
);
});
gcs.new_command("looplistconcatword", "rse", [](
auto &cs, auto args, auto &res
2016-08-17 20:51:21 +02:00
) {
cs_loop_list_conc(
cs, res, args[0].get_ident(), args[1].get_strr(),
args[2].get_code(), false
);
});
gcs.new_command("listfilter", "rse", [](auto &cs, auto args, auto &res) {
2016-08-31 19:49:24 +02:00
CsStackedValue idv{args[0].get_ident()};
if (!idv.has_alias()) {
return;
2016-08-17 20:51:21 +02:00
}
2016-08-31 19:49:24 +02:00
auto body = args[2].get_code();
2016-09-15 22:34:52 +02:00
CsString r;
int n = 0;
for (util::ListParser p(cs, args[1].get_strr()); p.parse(); ++n) {
2016-11-07 23:33:53 +01:00
idv.set_str(p.get_raw_item());
2016-08-31 19:49:24 +02:00
idv.push();
if (cs.run_bool(body)) {
2016-08-17 20:51:21 +02:00
if (r.size()) {
2016-09-15 22:34:52 +02:00
r += ' ';
2016-08-17 20:51:21 +02:00
}
2016-11-07 23:33:53 +01:00
r += p.get_raw_item(true);
}
}
2017-01-25 01:57:33 +01:00
res.set_str(std::move(r));
});
gcs.new_command("listcount", "rse", [](auto &cs, auto args, auto &res) {
2016-08-31 19:49:24 +02:00
CsStackedValue idv{args[0].get_ident()};
if (!idv.has_alias()) {
return;
2016-08-17 20:51:21 +02:00
}
2016-08-31 19:49:24 +02:00
auto body = args[2].get_code();
int n = 0, r = 0;
for (util::ListParser p(cs, args[1].get_strr()); p.parse(); ++n) {
2016-11-07 23:33:53 +01:00
idv.set_str(p.get_raw_item());
2016-08-31 19:49:24 +02:00
idv.push();
2016-08-17 20:51:21 +02:00
if (cs.run_bool(body)) {
r++;
2016-08-17 20:51:21 +02:00
}
}
res.set_int(r);
});
gcs.new_command("prettylist", "ss", [](auto &cs, auto args, auto &res) {
2016-09-15 22:34:52 +02:00
auto buf = ostd::appender<CsString>();
ostd::ConstCharRange s = args[0].get_strr();
ostd::ConstCharRange conj = args[1].get_strr();
2017-01-25 02:09:50 +01:00
size_t len = util::ListParser(cs, s).count();
size_t n = 0;
for (util::ListParser p(cs, s); p.parse(); ++n) {
2016-11-07 23:33:53 +01:00
if (!p.get_raw_item(true).empty() &&
(p.get_raw_item(true).front() == '"')) {
util::unescape_string(buf, p.get_raw_item());
} else {
2016-11-07 23:33:53 +01:00
buf.put_n(p.get_raw_item().data(), p.get_raw_item().size());
}
if ((n + 1) < len) {
2016-08-17 20:51:21 +02:00
if ((len > 2) || conj.empty()) {
2016-09-15 22:34:52 +02:00
buf.put(',');
2016-08-17 20:51:21 +02:00
}
if ((n + 2 == len) && !conj.empty()) {
2016-09-15 22:34:52 +02:00
buf.put(' ');
buf.put_n(conj.data(), conj.size());
}
2016-09-15 22:34:52 +02:00
buf.put(' ');
}
}
2017-01-25 01:57:33 +01:00
res.set_str(std::move(buf.get()));
});
gcs.new_command("indexof", "ss", [](auto &cs, auto args, auto &res) {
res.set_int(
cs_list_includes(cs, args[0].get_strr(), args[1].get_strr())
);
});
gcs.new_command("listdel", "ss", [](auto &cs, auto args, auto &res) {
cs_list_merge<false, false>(cs, args, res, ostd::Less<int>());
2016-08-17 20:51:21 +02:00
});
gcs.new_command("listintersect", "ss", [](auto &cs, auto args, auto &res) {
cs_list_merge<false, false>(cs, args, res, ostd::GreaterEqual<int>());
2016-08-17 20:51:21 +02:00
});
gcs.new_command("listunion", "ss", [](auto &cs, auto args, auto &res) {
cs_list_merge<true, true>(cs, args, res, ostd::Less<int>());
});
gcs.new_command("listsplice", "ssii", [](auto &cs, auto args, auto &res) {
CsInt offset = ostd::max(args[2].get_int(), CsInt(0));
CsInt len = ostd::max(args[3].get_int(), CsInt(0));
ostd::ConstCharRange s = args[0].get_strr();
ostd::ConstCharRange vals = args[1].get_strr();
char const *list = s.data();
util::ListParser p(cs, s);
2016-08-17 20:51:21 +02:00
for (CsInt i = 0; i < offset; ++i) {
if (!p.parse()) {
break;
2016-08-17 20:51:21 +02:00
}
}
2016-11-07 23:33:53 +01:00
ostd::ConstCharRange quote = p.get_raw_item(true);
char const *qend = !quote.empty() ? &quote[quote.size()] : list;
2016-09-15 22:34:52 +02:00
CsString buf;
2016-08-17 20:51:21 +02:00
if (qend > list) {
2016-09-15 22:34:52 +02:00
buf += ostd::ConstCharRange(list, qend - list);
2016-08-17 20:51:21 +02:00
}
if (!vals.empty()) {
2016-08-17 20:51:21 +02:00
if (!buf.empty()) {
2016-09-15 22:34:52 +02:00
buf += ' ';
2016-08-17 20:51:21 +02:00
}
2016-09-15 22:34:52 +02:00
buf += vals;
}
2016-08-17 20:51:21 +02:00
for (CsInt i = 0; i < len; ++i) {
if (!p.parse()) {
break;
2016-08-17 20:51:21 +02:00
}
}
p.skip();
2016-10-27 00:49:16 +02:00
if (!p.get_input().empty()) {
switch (p.get_input().front()) {
2016-08-17 20:51:21 +02:00
case ')':
case ']':
break;
default:
if (!buf.empty()) {
2016-09-15 22:34:52 +02:00
buf += ' ';
2016-08-17 20:51:21 +02:00
}
2016-10-27 00:49:16 +02:00
buf += p.get_input();
2016-08-17 20:51:21 +02:00
break;
}
}
2017-01-25 01:57:33 +01:00
res.set_str(std::move(buf));
});
cs_init_lib_list_sort(gcs);
}
struct ListSortItem {
2016-09-15 22:45:28 +02:00
ostd::ConstCharRange str;
ostd::ConstCharRange quote;
};
struct ListSortFun {
CsState &cs;
2016-08-31 19:49:24 +02:00
CsStackedValue &xv, &yv;
2016-08-28 19:40:18 +02:00
CsBytecode *body;
bool operator()(ListSortItem const &xval, ListSortItem const &yval) {
2016-08-31 19:49:24 +02:00
xv.set_cstr(xval.str);
yv.set_cstr(yval.str);
xv.push();
yv.push();
return cs.run_bool(body);
}
};
static void cs_list_sort(
CsState &cs, CsValue &res, ostd::ConstCharRange list,
CsIdent *x, CsIdent *y, CsBytecode *body, CsBytecode *unique
) {
2016-08-17 20:51:21 +02:00
if (x == y || !x->is_alias() || !y->is_alias()) {
return;
2016-08-17 20:51:21 +02:00
}
2016-08-29 19:17:11 +02:00
CsAlias *xa = static_cast<CsAlias *>(x), *ya = static_cast<CsAlias *>(y);
2016-08-18 00:06:39 +02:00
2016-08-21 02:34:03 +02:00
CsVector<ListSortItem> items;
2017-01-25 02:09:50 +01:00
size_t total = 0;
for (util::ListParser p(cs, list); p.parse();) {
2016-11-07 23:33:53 +01:00
ListSortItem item = { p.get_raw_item(), p.get_raw_item(true) };
2017-01-25 01:18:29 +01:00
items.push_back(item);
total += item.quote.size();
}
if (items.empty()) {
2016-09-15 22:45:28 +02:00
res.set_str(list);
return;
}
2016-08-31 19:49:24 +02:00
CsStackedValue xval{xa}, yval{ya};
xval.set_null();
yval.set_null();
xval.push();
yval.push();
2017-01-25 02:09:50 +01:00
size_t totaluniq = total;
size_t nuniq = items.size();
if (body) {
2016-08-31 19:49:24 +02:00
ListSortFun f = { cs, xval, yval, body };
2017-01-25 01:18:29 +01:00
ostd::sort_cmp(ostd::iter(items), f);
2016-08-29 19:17:11 +02:00
if (!cs_code_is_empty(unique)) {
f.body = unique;
totaluniq = items[0].quote.size();
nuniq = 1;
2017-01-25 02:09:50 +01:00
for (size_t i = 1; i < items.size(); i++) {
ListSortItem &item = items[i];
2016-08-17 20:51:21 +02:00
if (f(items[i - 1], item)) {
item.quote = nullptr;
2016-08-17 20:51:21 +02:00
} else {
totaluniq += item.quote.size();
++nuniq;
}
}
}
} else {
2016-08-31 19:49:24 +02:00
ListSortFun f = { cs, xval, yval, unique };
totaluniq = items[0].quote.size();
nuniq = 1;
2017-01-25 02:09:50 +01:00
for (size_t i = 1; i < items.size(); i++) {
ListSortItem &item = items[i];
2017-01-25 02:09:50 +01:00
for (size_t j = 0; j < i; ++j) {
ListSortItem &prev = items[j];
if (!prev.quote.empty() && f(item, prev)) {
item.quote = nullptr;
break;
}
}
if (!item.quote.empty()) {
totaluniq += item.quote.size();
++nuniq;
}
}
}
2016-08-31 19:49:24 +02:00
xval.pop();
yval.pop();
2016-09-15 22:45:28 +02:00
CsString sorted;
2017-01-25 02:09:50 +01:00
sorted.reserve(totaluniq + ostd::max(nuniq - 1, size_t(0)));
for (size_t i = 0; i < items.size(); ++i) {
ListSortItem &item = items[i];
2016-08-17 20:51:21 +02:00
if (item.quote.empty()) {
continue;
2016-08-17 20:51:21 +02:00
}
if (i) {
2016-09-15 22:45:28 +02:00
sorted += ' ';
2016-08-17 20:51:21 +02:00
}
2016-09-15 22:45:28 +02:00
sorted += item.quote;
}
2017-01-25 01:57:33 +01:00
res.set_str(std::move(sorted));
}
static void cs_init_lib_list_sort(CsState &gcs) {
gcs.new_command("sortlist", "srree", [](auto &cs, auto args, auto &res) {
cs_list_sort(
cs, res, args[0].get_strr(), args[1].get_ident(),
args[2].get_ident(), args[3].get_code(), args[4].get_code()
);
});
gcs.new_command("uniquelist", "srre", [](auto &cs, auto args, auto &res) {
cs_list_sort(
cs, res, args[0].get_strr(), args[1].get_ident(),
args[2].get_ident(), nullptr, args[3].get_code()
);
});
}
} /* namespace cscript */