forked from OctaForge/libcubescript
637 lines
18 KiB
C++
637 lines
18 KiB
C++
#include <functional>
|
|
|
|
#include <cubescript/cubescript.hh>
|
|
#include "cs_util.hh"
|
|
|
|
namespace cscript {
|
|
|
|
template<typename T>
|
|
struct cs_arg_val;
|
|
|
|
template<>
|
|
struct cs_arg_val<cs_int> {
|
|
static cs_int get(cs_value &tv) {
|
|
return tv.get_int();
|
|
}
|
|
};
|
|
|
|
template<>
|
|
struct cs_arg_val<cs_float> {
|
|
static cs_float get(cs_value &tv) {
|
|
return tv.get_float();
|
|
}
|
|
};
|
|
|
|
template<>
|
|
struct cs_arg_val<ostd::string_range> {
|
|
static ostd::string_range get(cs_value &tv) {
|
|
return tv.get_strr();
|
|
}
|
|
};
|
|
|
|
template<typename T, typename F>
|
|
static inline void cs_list_find(
|
|
cs_state &cs, cs_value_r args, cs_value &res, F cmp
|
|
) {
|
|
cs_int n = 0, skip = args[2].get_int();
|
|
T val = cs_arg_val<T>::get(args[1]);
|
|
for (util::list_parser p(cs, args[0].get_strr()); p.parse(); ++n) {
|
|
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(
|
|
cs_state &cs, cs_value_r args, cs_value &res, F cmp
|
|
) {
|
|
T val = cs_arg_val<T>::get(args[1]);
|
|
for (util::list_parser p(cs, args[0].get_strr()); p.parse();) {
|
|
if (cmp(p, val)) {
|
|
if (p.parse()) {
|
|
res.set_str(p.get_item());
|
|
}
|
|
return;
|
|
}
|
|
if (!p.parse()) {
|
|
break;
|
|
}
|
|
}
|
|
}
|
|
|
|
static void cs_loop_list_conc(
|
|
cs_state &cs, cs_value &res, cs_ident *id, ostd::string_range list,
|
|
cs_bcode *body, bool space
|
|
) {
|
|
cs_stacked_value idv{id};
|
|
if (!idv.has_alias()) {
|
|
return;
|
|
}
|
|
cs_string r;
|
|
int n = 0;
|
|
for (util::list_parser p(cs, list); p.parse(); ++n) {
|
|
idv.set_str(p.get_item());
|
|
idv.push();
|
|
if (n && space) {
|
|
r += ' ';
|
|
}
|
|
cs_value v;
|
|
switch (cs.run_loop(body, v)) {
|
|
case CsLoopState::Break:
|
|
goto end;
|
|
case CsLoopState::Continue:
|
|
continue;
|
|
default:
|
|
break;
|
|
}
|
|
r += v.get_str();
|
|
}
|
|
end:
|
|
res.set_str(std::move(r));
|
|
}
|
|
|
|
int cs_list_includes(
|
|
cs_state &cs, ostd::string_range list, ostd::string_range needle
|
|
) {
|
|
int offset = 0;
|
|
for (util::list_parser p(cs, list); p.parse();) {
|
|
if (p.get_raw_item() == needle) {
|
|
return offset;
|
|
}
|
|
++offset;
|
|
}
|
|
return -1;
|
|
}
|
|
|
|
template<bool PushList, bool Swap, typename F>
|
|
static inline void cs_list_merge(
|
|
cs_state &cs, cs_value_r args, cs_value &res, F cmp
|
|
) {
|
|
ostd::string_range list = args[0].get_strr();
|
|
ostd::string_range elems = args[1].get_strr();
|
|
cs_string buf;
|
|
if (PushList) {
|
|
buf += list;
|
|
}
|
|
if (Swap) {
|
|
std::swap(list, elems);
|
|
}
|
|
for (util::list_parser p(cs, list); p.parse();) {
|
|
if (cmp(cs_list_includes(cs, elems, p.get_raw_item()), 0)) {
|
|
if (!buf.empty()) {
|
|
buf += ' ';
|
|
}
|
|
buf += p.get_raw_item(true);
|
|
}
|
|
}
|
|
res.set_str(std::move(buf));
|
|
}
|
|
|
|
static void cs_init_lib_list_sort(cs_state &cs);
|
|
|
|
void cs_init_lib_list(cs_state &gcs) {
|
|
gcs.new_command("listlen", "s", [](auto &cs, auto args, auto &res) {
|
|
res.set_int(cs_int(util::list_parser(cs, args[0].get_strr()).count()));
|
|
});
|
|
|
|
gcs.new_command("at", "si1V", [](auto &cs, auto args, auto &res) {
|
|
if (args.empty()) {
|
|
return;
|
|
}
|
|
cs_string str = std::move(args[0].get_str());
|
|
util::list_parser p(cs, str);
|
|
p.get_raw_item() = str;
|
|
for (size_t i = 1; i < args.size(); ++i) {
|
|
p.get_input() = str;
|
|
cs_int pos = args[i].get_int();
|
|
for (; pos > 0; --pos) {
|
|
if (!p.parse()) {
|
|
break;
|
|
}
|
|
}
|
|
if (pos > 0 || !p.parse()) {
|
|
p.get_raw_item() = p.get_raw_item(true) = ostd::string_range();
|
|
}
|
|
}
|
|
res.set_str(p.get_item());
|
|
});
|
|
|
|
gcs.new_command("sublist", "siiN", [](auto &cs, auto args, auto &res) {
|
|
cs_int skip = args[1].get_int(),
|
|
count = args[2].get_int(),
|
|
numargs = args[3].get_int();
|
|
|
|
cs_int offset = std::max(skip, cs_int(0)),
|
|
len = (numargs >= 3) ? std::max(count, cs_int(0)) : -1;
|
|
|
|
util::list_parser p(cs, args[0].get_strr());
|
|
for (cs_int i = 0; i < offset; ++i) {
|
|
if (!p.parse()) break;
|
|
}
|
|
if (len < 0) {
|
|
if (offset > 0) {
|
|
p.skip();
|
|
}
|
|
res.set_str(cs_string{p.get_input()});
|
|
return;
|
|
}
|
|
|
|
char const *list = p.get_input().data();
|
|
p.get_raw_item(true) = ostd::string_range();
|
|
if (len > 0 && p.parse()) {
|
|
while (--len > 0 && p.parse());
|
|
}
|
|
ostd::string_range quote = p.get_raw_item(true);
|
|
char const *qend = !quote.empty() ? "e[quote.size()] : list;
|
|
res.set_str(cs_string{list, size_t(qend - list)});
|
|
});
|
|
|
|
gcs.new_command("listfind", "rse", [](auto &cs, auto args, auto &res) {
|
|
cs_stacked_value idv{args[0].get_ident()};
|
|
if (!idv.has_alias()) {
|
|
res.set_int(-1);
|
|
return;
|
|
}
|
|
auto body = args[2].get_code();
|
|
int n = -1;
|
|
for (util::list_parser p(cs, args[1].get_strr()); p.parse();) {
|
|
++n;
|
|
idv.set_str(cs_string{p.get_raw_item()});
|
|
idv.push();
|
|
if (cs.run_bool(body)) {
|
|
res.set_int(cs_int(n));
|
|
return;
|
|
}
|
|
}
|
|
res.set_int(-1);
|
|
});
|
|
|
|
gcs.new_command("listassoc", "rse", [](auto &cs, auto args, auto &res) {
|
|
cs_stacked_value idv{args[0].get_ident()};
|
|
if (!idv.has_alias()) {
|
|
return;
|
|
}
|
|
auto body = args[2].get_code();
|
|
int n = -1;
|
|
for (util::list_parser p(cs, args[1].get_strr()); p.parse();) {
|
|
++n;
|
|
idv.set_str(cs_string{p.get_raw_item()});
|
|
idv.push();
|
|
if (cs.run_bool(body)) {
|
|
if (p.parse()) {
|
|
res.set_str(p.get_item());
|
|
}
|
|
break;
|
|
}
|
|
if (!p.parse()) {
|
|
break;
|
|
}
|
|
}
|
|
});
|
|
|
|
gcs.new_command("listfind=", "i", [](auto &cs, auto args, auto &res) {
|
|
cs_list_find<cs_int>(
|
|
cs, args, res, [](const util::list_parser &p, cs_int val) {
|
|
return cs_parse_int(p.get_raw_item()) == val;
|
|
}
|
|
);
|
|
});
|
|
gcs.new_command("listfind=f", "f", [](auto &cs, auto args, auto &res) {
|
|
cs_list_find<cs_float>(
|
|
cs, args, res, [](const util::list_parser &p, cs_float val) {
|
|
return cs_parse_float(p.get_raw_item()) == val;
|
|
}
|
|
);
|
|
});
|
|
gcs.new_command("listfind=s", "s", [](auto &cs, auto args, auto &res) {
|
|
cs_list_find<ostd::string_range>(
|
|
cs, args, res, [](const util::list_parser &p, ostd::string_range val) {
|
|
return p.get_raw_item() == val;
|
|
}
|
|
);
|
|
});
|
|
|
|
gcs.new_command("listassoc=", "i", [](auto &cs, auto args, auto &res) {
|
|
cs_list_assoc<cs_int>(
|
|
cs, args, res, [](const util::list_parser &p, cs_int val) {
|
|
return cs_parse_int(p.get_raw_item()) == val;
|
|
}
|
|
);
|
|
});
|
|
gcs.new_command("listassoc=f", "f", [](auto &cs, auto args, auto &res) {
|
|
cs_list_assoc<cs_float>(
|
|
cs, args, res, [](const util::list_parser &p, cs_float val) {
|
|
return cs_parse_float(p.get_raw_item()) == val;
|
|
}
|
|
);
|
|
});
|
|
gcs.new_command("listassoc=s", "s", [](auto &cs, auto args, auto &res) {
|
|
cs_list_assoc<ostd::string_range>(
|
|
cs, args, res, [](const util::list_parser &p, ostd::string_range val) {
|
|
return p.get_raw_item() == val;
|
|
}
|
|
);
|
|
});
|
|
|
|
gcs.new_command("looplist", "rse", [](auto &cs, auto args, auto &) {
|
|
cs_stacked_value idv{args[0].get_ident()};
|
|
if (!idv.has_alias()) {
|
|
return;
|
|
}
|
|
auto body = args[2].get_code();
|
|
int n = 0;
|
|
for (util::list_parser p(cs, args[1].get_strr()); p.parse(); ++n) {
|
|
idv.set_str(p.get_item());
|
|
idv.push();
|
|
switch (cs.run_loop(body)) {
|
|
case CsLoopState::Break:
|
|
goto end;
|
|
default: /* continue and normal */
|
|
break;
|
|
}
|
|
}
|
|
end:
|
|
return;
|
|
});
|
|
|
|
gcs.new_command("looplist2", "rrse", [](auto &cs, auto args, auto &) {
|
|
cs_stacked_value idv1{args[0].get_ident()}, idv2{args[1].get_ident()};
|
|
if (!idv1.has_alias() || !idv2.has_alias()) {
|
|
return;
|
|
}
|
|
auto body = args[3].get_code();
|
|
int n = 0;
|
|
for (util::list_parser p(cs, args[2].get_strr()); p.parse(); n += 2) {
|
|
idv1.set_str(p.get_item());
|
|
if (p.parse()) {
|
|
idv2.set_str(p.get_item());
|
|
} else {
|
|
idv2.set_str("");
|
|
}
|
|
idv1.push();
|
|
idv2.push();
|
|
switch (cs.run_loop(body)) {
|
|
case CsLoopState::Break:
|
|
goto end;
|
|
default: /* continue and normal */
|
|
break;
|
|
}
|
|
}
|
|
end:
|
|
return;
|
|
});
|
|
|
|
gcs.new_command("looplist3", "rrrse", [](auto &cs, auto args, auto &) {
|
|
cs_stacked_value idv1{args[0].get_ident()};
|
|
cs_stacked_value idv2{args[1].get_ident()};
|
|
cs_stacked_value idv3{args[2].get_ident()};
|
|
if (!idv1.has_alias() || !idv2.has_alias() || !idv3.has_alias()) {
|
|
return;
|
|
}
|
|
auto body = args[4].get_code();
|
|
int n = 0;
|
|
for (util::list_parser p(cs, args[3].get_strr()); p.parse(); n += 3) {
|
|
idv1.set_str(p.get_item());
|
|
if (p.parse()) {
|
|
idv2.set_str(p.get_item());
|
|
} else {
|
|
idv2.set_str("");
|
|
}
|
|
if (p.parse()) {
|
|
idv3.set_str(p.get_item());
|
|
} else {
|
|
idv3.set_str("");
|
|
}
|
|
idv1.push();
|
|
idv2.push();
|
|
idv3.push();
|
|
switch (cs.run_loop(body)) {
|
|
case CsLoopState::Break:
|
|
goto end;
|
|
default: /* continue and normal */
|
|
break;
|
|
}
|
|
}
|
|
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
|
|
) {
|
|
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) {
|
|
cs_stacked_value idv{args[0].get_ident()};
|
|
if (!idv.has_alias()) {
|
|
return;
|
|
}
|
|
auto body = args[2].get_code();
|
|
cs_string r;
|
|
int n = 0;
|
|
for (util::list_parser p(cs, args[1].get_strr()); p.parse(); ++n) {
|
|
idv.set_str(cs_string{p.get_raw_item()});
|
|
idv.push();
|
|
if (cs.run_bool(body)) {
|
|
if (r.size()) {
|
|
r += ' ';
|
|
}
|
|
r += p.get_raw_item(true);
|
|
}
|
|
}
|
|
res.set_str(std::move(r));
|
|
});
|
|
|
|
gcs.new_command("listcount", "rse", [](auto &cs, auto args, auto &res) {
|
|
cs_stacked_value idv{args[0].get_ident()};
|
|
if (!idv.has_alias()) {
|
|
return;
|
|
}
|
|
auto body = args[2].get_code();
|
|
int n = 0, r = 0;
|
|
for (util::list_parser p(cs, args[1].get_strr()); p.parse(); ++n) {
|
|
idv.set_str(cs_string{p.get_raw_item()});
|
|
idv.push();
|
|
if (cs.run_bool(body)) {
|
|
r++;
|
|
}
|
|
}
|
|
res.set_int(r);
|
|
});
|
|
|
|
gcs.new_command("prettylist", "ss", [](auto &cs, auto args, auto &res) {
|
|
auto buf = ostd::appender<cs_string>();
|
|
ostd::string_range s = args[0].get_strr();
|
|
ostd::string_range conj = args[1].get_strr();
|
|
size_t len = util::list_parser(cs, s).count();
|
|
size_t n = 0;
|
|
for (util::list_parser p(cs, s); p.parse(); ++n) {
|
|
if (!p.get_raw_item(true).empty() &&
|
|
(p.get_raw_item(true).front() == '"')) {
|
|
util::unescape_string(buf, p.get_raw_item());
|
|
} else {
|
|
ostd::range_put_all(buf, p.get_raw_item());
|
|
}
|
|
if ((n + 1) < len) {
|
|
if ((len > 2) || conj.empty()) {
|
|
buf.put(',');
|
|
}
|
|
if ((n + 2 == len) && !conj.empty()) {
|
|
buf.put(' ');
|
|
ostd::range_put_all(buf, conj);
|
|
}
|
|
buf.put(' ');
|
|
}
|
|
}
|
|
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, std::less<int>());
|
|
});
|
|
gcs.new_command("listintersect", "ss", [](auto &cs, auto args, auto &res) {
|
|
cs_list_merge<false, false>(cs, args, res, std::greater_equal<int>());
|
|
});
|
|
gcs.new_command("listunion", "ss", [](auto &cs, auto args, auto &res) {
|
|
cs_list_merge<true, true>(cs, args, res, std::less<int>());
|
|
});
|
|
|
|
gcs.new_command("listsplice", "ssii", [](auto &cs, auto args, auto &res) {
|
|
cs_int offset = std::max(args[2].get_int(), cs_int(0));
|
|
cs_int len = std::max(args[3].get_int(), cs_int(0));
|
|
ostd::string_range s = args[0].get_strr();
|
|
ostd::string_range vals = args[1].get_strr();
|
|
char const *list = s.data();
|
|
util::list_parser p(cs, s);
|
|
for (cs_int i = 0; i < offset; ++i) {
|
|
if (!p.parse()) {
|
|
break;
|
|
}
|
|
}
|
|
ostd::string_range quote = p.get_raw_item(true);
|
|
char const *qend = !quote.empty() ? "e[quote.size()] : list;
|
|
cs_string buf;
|
|
if (qend > list) {
|
|
buf += ostd::string_range(list, qend);
|
|
}
|
|
if (!vals.empty()) {
|
|
if (!buf.empty()) {
|
|
buf += ' ';
|
|
}
|
|
buf += vals;
|
|
}
|
|
for (cs_int i = 0; i < len; ++i) {
|
|
if (!p.parse()) {
|
|
break;
|
|
}
|
|
}
|
|
p.skip();
|
|
if (!p.get_input().empty()) {
|
|
switch (p.get_input().front()) {
|
|
case ')':
|
|
case ']':
|
|
break;
|
|
default:
|
|
if (!buf.empty()) {
|
|
buf += ' ';
|
|
}
|
|
buf += p.get_input();
|
|
break;
|
|
}
|
|
}
|
|
res.set_str(std::move(buf));
|
|
});
|
|
|
|
cs_init_lib_list_sort(gcs);
|
|
}
|
|
|
|
struct ListSortItem {
|
|
ostd::string_range str;
|
|
ostd::string_range quote;
|
|
};
|
|
|
|
struct ListSortFun {
|
|
cs_state &cs;
|
|
cs_stacked_value &xv, &yv;
|
|
cs_bcode *body;
|
|
|
|
bool operator()(ListSortItem const &xval, ListSortItem const &yval) {
|
|
xv.set_cstr(xval.str);
|
|
yv.set_cstr(yval.str);
|
|
xv.push();
|
|
yv.push();
|
|
return cs.run_bool(body);
|
|
}
|
|
};
|
|
|
|
static void cs_list_sort(
|
|
cs_state &cs, cs_value &res, ostd::string_range list,
|
|
cs_ident *x, cs_ident *y, cs_bcode *body, cs_bcode *unique
|
|
) {
|
|
if (x == y || !x->is_alias() || !y->is_alias()) {
|
|
return;
|
|
}
|
|
|
|
cs_alias *xa = static_cast<cs_alias *>(x), *ya = static_cast<cs_alias *>(y);
|
|
|
|
cs_vector<ListSortItem> items;
|
|
size_t total = 0;
|
|
|
|
for (util::list_parser p(cs, list); p.parse();) {
|
|
ListSortItem item = { p.get_raw_item(), p.get_raw_item(true) };
|
|
items.push_back(item);
|
|
total += item.quote.size();
|
|
}
|
|
|
|
if (items.empty()) {
|
|
res.set_str(cs_string{list});
|
|
return;
|
|
}
|
|
|
|
cs_stacked_value xval{xa}, yval{ya};
|
|
xval.set_null();
|
|
yval.set_null();
|
|
xval.push();
|
|
yval.push();
|
|
|
|
size_t totaluniq = total;
|
|
size_t nuniq = items.size();
|
|
if (body) {
|
|
ListSortFun f = { cs, xval, yval, body };
|
|
ostd::sort_cmp(ostd::iter(items), f);
|
|
if (!cs_code_is_empty(unique)) {
|
|
f.body = unique;
|
|
totaluniq = items[0].quote.size();
|
|
nuniq = 1;
|
|
for (size_t i = 1; i < items.size(); i++) {
|
|
ListSortItem &item = items[i];
|
|
if (f(items[i - 1], item)) {
|
|
item.quote = nullptr;
|
|
} else {
|
|
totaluniq += item.quote.size();
|
|
++nuniq;
|
|
}
|
|
}
|
|
}
|
|
} else {
|
|
ListSortFun f = { cs, xval, yval, unique };
|
|
totaluniq = items[0].quote.size();
|
|
nuniq = 1;
|
|
for (size_t i = 1; i < items.size(); i++) {
|
|
ListSortItem &item = items[i];
|
|
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;
|
|
}
|
|
}
|
|
}
|
|
|
|
xval.pop();
|
|
yval.pop();
|
|
|
|
cs_string sorted;
|
|
sorted.reserve(totaluniq + std::max(nuniq - 1, size_t(0)));
|
|
for (size_t i = 0; i < items.size(); ++i) {
|
|
ListSortItem &item = items[i];
|
|
if (item.quote.empty()) {
|
|
continue;
|
|
}
|
|
if (i) {
|
|
sorted += ' ';
|
|
}
|
|
sorted += item.quote;
|
|
}
|
|
res.set_str(std::move(sorted));
|
|
}
|
|
|
|
static void cs_init_lib_list_sort(cs_state &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 */
|