2017-04-18 02:40:39 +00:00
|
|
|
/*
|
2019-01-06 08:23:03 +00:00
|
|
|
* Copyright (c) 2019 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.
|
|
|
|
*/
|
|
|
|
|
2019-01-24 05:15:58 +00:00
|
|
|
#ifndef JANET_AMALG
|
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"
|
2019-01-24 05:15:58 +00:00
|
|
|
#endif
|
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) {
|
2019-02-08 20:49:28 +00:00
|
|
|
char *data = janet_gcalloc(JANET_MEMORY_TUPLE, 5 * sizeof(int32_t) + length * sizeof(Janet));
|
|
|
|
Janet *tuple = (Janet *)(data + (5 * sizeof(int32_t)));
|
2018-09-06 02:18:42 +00:00
|
|
|
janet_tuple_length(tuple) = length;
|
2018-12-13 23:46:53 +00:00
|
|
|
janet_tuple_sm_start(tuple) = -1;
|
|
|
|
janet_tuple_sm_end(tuple) = -1;
|
2019-02-08 20:49:28 +00:00
|
|
|
janet_tuple_flag(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 */
|
|
|
|
|
2019-01-24 05:15:58 +00:00
|
|
|
static Janet cfun_tuple_slice(int32_t argc, Janet *argv) {
|
2019-01-06 01:09:03 +00:00
|
|
|
JanetRange range = janet_getslice(argc, argv);
|
|
|
|
JanetView view = janet_getindexed(argv, 0);
|
|
|
|
return janet_wrap_tuple(janet_tuple_n(view.items + range.start, range.end - range.start));
|
2018-01-27 20:15:09 +00:00
|
|
|
}
|
|
|
|
|
2019-01-24 05:15:58 +00:00
|
|
|
static Janet cfun_tuple_prepend(int32_t argc, Janet *argv) {
|
2019-01-06 01:09:03 +00:00
|
|
|
janet_arity(argc, 1, -1);
|
|
|
|
JanetView view = janet_getindexed(argv, 0);
|
|
|
|
Janet *n = janet_tuple_begin(view.len - 1 + argc);
|
|
|
|
memcpy(n - 1 + argc, view.items, sizeof(Janet) * view.len);
|
|
|
|
for (int32_t i = 1; i < argc; i++) {
|
|
|
|
n[argc - i - 1] = argv[i];
|
2018-11-16 21:24:10 +00:00
|
|
|
}
|
2019-01-06 01:09:03 +00:00
|
|
|
return janet_wrap_tuple(janet_tuple_end(n));
|
2018-01-28 20:29:47 +00:00
|
|
|
}
|
|
|
|
|
2019-01-24 05:15:58 +00:00
|
|
|
static Janet cfun_tuple_append(int32_t argc, Janet *argv) {
|
2019-01-06 01:09:03 +00:00
|
|
|
janet_arity(argc, 1, -1);
|
|
|
|
JanetView view = janet_getindexed(argv, 0);
|
|
|
|
Janet *n = janet_tuple_begin(view.len - 1 + argc);
|
|
|
|
memcpy(n, view.items, sizeof(Janet) * view.len);
|
|
|
|
memcpy(n + view.len, argv + 1, sizeof(Janet) * (argc - 1));
|
|
|
|
return janet_wrap_tuple(janet_tuple_end(n));
|
2018-01-28 20:29:47 +00:00
|
|
|
}
|
|
|
|
|
2019-02-09 17:21:11 +00:00
|
|
|
static Janet cfun_tuple_type(int32_t argc, Janet *argv) {
|
|
|
|
janet_fixarity(argc, 1);
|
|
|
|
const Janet *tup = janet_gettuple(argv, 0);
|
|
|
|
if (janet_tuple_flag(tup) & JANET_TUPLE_FLAG_BRACKETCTOR) {
|
|
|
|
return janet_ckeywordv("brackets");
|
|
|
|
} else {
|
|
|
|
return janet_ckeywordv("parens");
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2019-01-24 05:15:58 +00:00
|
|
|
static const JanetReg tuple_cfuns[] = {
|
2019-01-06 06:49:56 +00:00
|
|
|
{
|
2019-01-24 05:15:58 +00:00
|
|
|
"tuple/slice", cfun_tuple_slice,
|
2019-01-06 06:49:56 +00:00
|
|
|
JDOC("(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.")
|
2018-11-16 21:24:10 +00:00
|
|
|
},
|
2019-01-06 06:49:56 +00:00
|
|
|
{
|
2019-01-24 05:15:58 +00:00
|
|
|
"tuple/append", cfun_tuple_append,
|
2019-01-06 06:49:56 +00:00
|
|
|
JDOC("(tuple/append tup & items)\n\n"
|
|
|
|
"Returns a new tuple that is the result of appending "
|
|
|
|
"each element in items to tup.")
|
2018-11-16 21:24:10 +00:00
|
|
|
},
|
2019-01-06 06:49:56 +00:00
|
|
|
{
|
2019-01-24 05:15:58 +00:00
|
|
|
"tuple/prepend", cfun_tuple_prepend,
|
2019-01-06 06:49:56 +00:00
|
|
|
JDOC("(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-16 21:24:10 +00:00
|
|
|
},
|
2019-02-09 17:21:11 +00:00
|
|
|
{
|
|
|
|
"tuple/type", cfun_tuple_type,
|
|
|
|
JDOC("(tuple/type tup)\n\n"
|
|
|
|
"Checks how the tuple was constructed. Will return the keyword "
|
|
|
|
":brackets if the tuple was parsed with brackets, and :parens "
|
|
|
|
"otherwise. The two types of tuples will behave the same most of "
|
|
|
|
"the time, but will print differently and be treated differently by "
|
|
|
|
"the compiler.")
|
|
|
|
},
|
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 */
|
2019-01-06 01:09:03 +00:00
|
|
|
void janet_lib_tuple(JanetTable *env) {
|
2019-02-08 05:44:30 +00:00
|
|
|
janet_core_cfuns(env, NULL, tuple_cfuns);
|
2018-01-27 20:15:09 +00:00
|
|
|
}
|