2017-04-18 02:40:39 +00:00
|
|
|
/*
|
2018-05-18 03:41:20 +00:00
|
|
|
* Copyright (c) 2018 Calvin Rose
|
2017-07-02 01:51:16 +00:00
|
|
|
*
|
2017-04-18 02:40:39 +00:00
|
|
|
* Permission is hereby granted, free of charge, to any person obtaining a copy
|
|
|
|
* of this software and associated documentation files (the "Software"), to
|
|
|
|
* deal in the Software without restriction, including without limitation the
|
|
|
|
* rights to use, copy, modify, merge, publish, distribute, sublicense, and/or
|
|
|
|
* sell copies of the Software, and to permit persons to whom the Software is
|
|
|
|
* furnished to do so, subject to the following conditions:
|
2017-07-02 01:51:16 +00:00
|
|
|
*
|
2017-04-18 02:40:39 +00:00
|
|
|
* The above copyright notice and this permission notice shall be included in
|
|
|
|
* all copies or substantial portions of the Software.
|
2017-07-02 01:51:16 +00:00
|
|
|
*
|
2017-04-18 02:40:39 +00:00
|
|
|
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
|
|
|
|
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
|
|
|
|
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
|
|
|
|
* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
|
|
|
|
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
|
|
|
|
* FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS
|
|
|
|
* IN THE SOFTWARE.
|
|
|
|
*/
|
|
|
|
|
2018-09-06 02:18:42 +00:00
|
|
|
#include <janet/janet.h>
|
2017-11-27 19:03:34 +00:00
|
|
|
#include "symcache.h"
|
2017-12-21 04:03:34 +00:00
|
|
|
#include "gc.h"
|
2018-01-06 16:09:15 +00:00
|
|
|
#include "util.h"
|
2017-04-15 20:05:59 +00:00
|
|
|
|
2017-11-01 21:53:43 +00:00
|
|
|
/* Create a new empty tuple of the given size. This will return memory
|
2018-09-06 02:18:42 +00:00
|
|
|
* which should be filled with Janets. The memory will not be collected until
|
|
|
|
* janet_tuple_end is called. */
|
|
|
|
Janet *janet_tuple_begin(int32_t length) {
|
|
|
|
char *data = janet_gcalloc(JANET_MEMORY_TUPLE, 4 * sizeof(int32_t) + length * sizeof(Janet));
|
|
|
|
Janet *tuple = (Janet *)(data + (4 * sizeof(int32_t)));
|
|
|
|
janet_tuple_length(tuple) = length;
|
|
|
|
janet_tuple_sm_line(tuple) = 0;
|
|
|
|
janet_tuple_sm_col(tuple) = 0;
|
2017-11-01 21:53:43 +00:00
|
|
|
return tuple;
|
|
|
|
}
|
2017-04-15 20:05:59 +00:00
|
|
|
|
2017-11-01 21:53:43 +00:00
|
|
|
/* Finish building a tuple */
|
2018-09-06 02:18:42 +00:00
|
|
|
const Janet *janet_tuple_end(Janet *tuple) {
|
|
|
|
janet_tuple_hash(tuple) = janet_array_calchash(tuple, janet_tuple_length(tuple));
|
|
|
|
return (const Janet *)tuple;
|
2017-11-01 21:53:43 +00:00
|
|
|
}
|
2017-04-15 20:05:59 +00:00
|
|
|
|
2017-11-06 03:05:47 +00:00
|
|
|
/* Build a tuple with n values */
|
2018-09-06 02:18:42 +00:00
|
|
|
const Janet *janet_tuple_n(const Janet *values, int32_t n) {
|
|
|
|
Janet *t = janet_tuple_begin(n);
|
|
|
|
memcpy(t, values, sizeof(Janet) * n);
|
|
|
|
return janet_tuple_end(t);
|
2017-11-01 21:53:43 +00:00
|
|
|
}
|
2017-11-27 19:03:34 +00:00
|
|
|
|
|
|
|
/* Check if two tuples are equal */
|
2018-09-06 02:18:42 +00:00
|
|
|
int janet_tuple_equal(const Janet *lhs, const Janet *rhs) {
|
2017-11-28 23:27:55 +00:00
|
|
|
int32_t index;
|
2018-09-06 02:18:42 +00:00
|
|
|
int32_t llen = janet_tuple_length(lhs);
|
|
|
|
int32_t rlen = janet_tuple_length(rhs);
|
|
|
|
int32_t lhash = janet_tuple_hash(lhs);
|
|
|
|
int32_t rhash = janet_tuple_hash(rhs);
|
2017-11-27 19:03:34 +00:00
|
|
|
if (lhash == 0)
|
2018-09-06 02:18:42 +00:00
|
|
|
lhash = janet_tuple_hash(lhs) = janet_array_calchash(lhs, llen);
|
2017-11-27 19:03:34 +00:00
|
|
|
if (rhash == 0)
|
2018-09-06 02:18:42 +00:00
|
|
|
rhash = janet_tuple_hash(rhs) = janet_array_calchash(rhs, rlen);
|
2017-11-27 19:03:34 +00:00
|
|
|
if (lhash != rhash)
|
|
|
|
return 0;
|
2017-11-29 20:17:56 +00:00
|
|
|
if (llen != rlen)
|
|
|
|
return 0;
|
2017-11-27 19:03:34 +00:00
|
|
|
for (index = 0; index < llen; index++) {
|
2018-09-06 02:18:42 +00:00
|
|
|
if (!janet_equals(lhs[index], rhs[index]))
|
2017-11-27 19:03:34 +00:00
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Compare tuples */
|
2018-09-06 02:18:42 +00:00
|
|
|
int janet_tuple_compare(const Janet *lhs, const Janet *rhs) {
|
2017-11-28 23:27:55 +00:00
|
|
|
int32_t i;
|
2018-09-06 02:18:42 +00:00
|
|
|
int32_t llen = janet_tuple_length(lhs);
|
|
|
|
int32_t rlen = janet_tuple_length(rhs);
|
2017-11-28 23:27:55 +00:00
|
|
|
int32_t count = llen < rlen ? llen : rlen;
|
2017-11-27 19:03:34 +00:00
|
|
|
for (i = 0; i < count; ++i) {
|
2018-09-06 02:18:42 +00:00
|
|
|
int comp = janet_compare(lhs[i], rhs[i]);
|
2017-11-27 19:03:34 +00:00
|
|
|
if (comp != 0) return comp;
|
|
|
|
}
|
|
|
|
if (llen < rlen)
|
|
|
|
return -1;
|
|
|
|
else if (llen > rlen)
|
|
|
|
return 1;
|
|
|
|
return 0;
|
|
|
|
}
|
2018-01-27 20:15:09 +00:00
|
|
|
|
|
|
|
/* C Functions */
|
|
|
|
|
2018-09-06 02:18:42 +00:00
|
|
|
static int cfun_slice(JanetArgs args) {
|
|
|
|
const Janet *vals;
|
2018-01-27 20:15:09 +00:00
|
|
|
int32_t len;
|
2018-09-06 02:18:42 +00:00
|
|
|
Janet *ret;
|
2018-01-27 20:15:09 +00:00
|
|
|
int32_t start, end;
|
2018-09-06 02:18:42 +00:00
|
|
|
JANET_MINARITY(args, 1);
|
|
|
|
if (!janet_indexed_view(args.v[0], &vals, &len)) JANET_THROW(args, "expected array/tuple");
|
2018-01-27 20:15:09 +00:00
|
|
|
/* Get start */
|
|
|
|
if (args.n < 2) {
|
|
|
|
start = 0;
|
2018-09-06 02:18:42 +00:00
|
|
|
} else if (janet_checktype(args.v[1], JANET_INTEGER)) {
|
|
|
|
start = janet_unwrap_integer(args.v[1]);
|
2018-01-27 20:15:09 +00:00
|
|
|
} else {
|
2018-09-06 02:18:42 +00:00
|
|
|
JANET_THROW(args, "expected integer");
|
2018-01-27 20:15:09 +00:00
|
|
|
}
|
|
|
|
/* Get end */
|
|
|
|
if (args.n < 3) {
|
|
|
|
end = -1;
|
2018-09-06 02:18:42 +00:00
|
|
|
} else if (janet_checktype(args.v[2], JANET_INTEGER)) {
|
|
|
|
end = janet_unwrap_integer(args.v[2]);
|
2018-01-27 20:15:09 +00:00
|
|
|
} else {
|
2018-09-06 02:18:42 +00:00
|
|
|
JANET_THROW(args, "expected integer");
|
2018-01-27 20:15:09 +00:00
|
|
|
}
|
|
|
|
if (start < 0) start = len + start;
|
|
|
|
if (end < 0) end = len + end + 1;
|
|
|
|
if (end >= start) {
|
2018-09-06 02:18:42 +00:00
|
|
|
ret = janet_tuple_begin(end - start);
|
2018-09-07 20:27:57 +00:00
|
|
|
memcpy(ret, vals + start, sizeof(Janet) * (end - start));
|
2018-01-27 20:15:09 +00:00
|
|
|
} else {
|
2018-09-06 02:18:42 +00:00
|
|
|
ret = janet_tuple_begin(0);
|
2018-01-27 20:15:09 +00:00
|
|
|
}
|
2018-09-06 02:18:42 +00:00
|
|
|
JANET_RETURN_TUPLE(args, janet_tuple_end(ret));
|
2018-01-27 20:15:09 +00:00
|
|
|
}
|
|
|
|
|
2018-09-06 02:18:42 +00:00
|
|
|
static int cfun_prepend(JanetArgs args) {
|
|
|
|
const Janet *t;
|
2018-11-16 21:24:10 +00:00
|
|
|
int32_t len, i;
|
2018-09-06 02:18:42 +00:00
|
|
|
Janet *n;
|
2018-11-16 21:24:10 +00:00
|
|
|
JANET_MINARITY(args, 1);
|
|
|
|
if (!janet_indexed_view(args.v[0], &t, &len))
|
|
|
|
JANET_THROW(args, "expected tuple/array");
|
|
|
|
n = janet_tuple_begin(len - 1 + args.n);
|
|
|
|
memcpy(n - 1 + args.n, t, sizeof(Janet) * len);
|
|
|
|
for (i = 1; i < args.n; i++) {
|
|
|
|
n[args.n - i - 1] = args.v[i];
|
|
|
|
}
|
2018-09-06 02:18:42 +00:00
|
|
|
JANET_RETURN_TUPLE(args, janet_tuple_end(n));
|
2018-01-28 20:29:47 +00:00
|
|
|
}
|
|
|
|
|
2018-09-06 02:18:42 +00:00
|
|
|
static int cfun_append(JanetArgs args) {
|
|
|
|
const Janet *t;
|
2018-03-25 22:51:31 +00:00
|
|
|
int32_t len;
|
2018-09-06 02:18:42 +00:00
|
|
|
Janet *n;
|
2018-11-16 21:24:10 +00:00
|
|
|
JANET_MINARITY(args, 1);
|
|
|
|
if (!janet_indexed_view(args.v[0], &t, &len))
|
|
|
|
JANET_THROW(args, "expected tuple/array");
|
|
|
|
n = janet_tuple_begin(len - 1 + args.n);
|
2018-09-06 02:18:42 +00:00
|
|
|
memcpy(n, t, sizeof(Janet) * len);
|
2018-11-16 21:24:10 +00:00
|
|
|
memcpy(n + len, args.v + 1, sizeof(Janet) * (args.n - 1));
|
2018-09-06 02:18:42 +00:00
|
|
|
JANET_RETURN_TUPLE(args, janet_tuple_end(n));
|
2018-01-28 20:29:47 +00:00
|
|
|
}
|
|
|
|
|
2018-09-06 02:18:42 +00:00
|
|
|
static const JanetReg cfuns[] = {
|
2018-11-16 21:24:10 +00:00
|
|
|
{"tuple.slice", cfun_slice,
|
|
|
|
"(tuple.slice arrtup [,start=0 [,end=(length arrtup)]])\n\n"
|
|
|
|
"Take a sub sequence of an array or tuple from index start "
|
|
|
|
"inclusive to index end exclusive. If start or end are not provided, "
|
|
|
|
"they default to 0 and the length of arrtup respectively."
|
|
|
|
"Returns the new tuple."
|
|
|
|
},
|
|
|
|
{"tuple.append", cfun_append,
|
|
|
|
"(tuple.append tup & items)\n\n"
|
|
|
|
"Returns a new tuple that is the result of appending "
|
|
|
|
"each element in items to tup."
|
|
|
|
},
|
|
|
|
{"tuple.prepend", cfun_prepend,
|
|
|
|
"(tuple.prepend tup & items)\n\n"
|
|
|
|
"Prepends each element in items to tuple and "
|
|
|
|
"returns a new tuple. Items are prepended such that the "
|
|
|
|
"last element in items is the first element in the new tuple."
|
|
|
|
},
|
2018-11-15 20:45:41 +00:00
|
|
|
{NULL, NULL, NULL}
|
2018-08-26 18:35:01 +00:00
|
|
|
};
|
|
|
|
|
2018-01-27 20:15:09 +00:00
|
|
|
/* Load the tuple module */
|
2018-09-06 02:18:42 +00:00
|
|
|
int janet_lib_tuple(JanetArgs args) {
|
|
|
|
JanetTable *env = janet_env(args);
|
|
|
|
janet_cfuns(env, NULL, cfuns);
|
2018-01-27 20:15:09 +00:00
|
|
|
return 0;
|
|
|
|
}
|