1
0
mirror of https://github.com/janet-lang/janet synced 2024-06-17 02:40:00 +00:00
janet/core/value.c

305 lines
11 KiB
C
Raw Normal View History

/*
* Copyright (c) 2017 Calvin Rose
2017-07-02 01:51:16 +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
*
* 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
*
* 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.
*/
#include <dst/dst.h>
2017-02-09 20:02:59 +00:00
2017-11-01 21:53:43 +00:00
/*
* Define a number of functions that can be used internally on ANY DstValue.
*/
2017-02-09 20:02:59 +00:00
/* Check if two values are equal. This is strict equality with no conversion. */
2017-11-01 21:53:43 +00:00
int dst_equals(DstValue x, DstValue y) {
int result = 0;
if (dst_type(x) != dst_type(y)) {
2017-02-09 20:02:59 +00:00
result = 0;
} else {
switch (dst_type(x)) {
case DST_NIL:
case DST_TRUE:
case DST_FALSE:
2017-04-15 20:05:59 +00:00
result = 1;
break;
case DST_REAL:
result = (dst_unwrap_real(x) == dst_unwrap_real(y));
break;
case DST_INTEGER:
result = (dst_unwrap_integer(x) == dst_unwrap_integer(y));
2017-04-15 20:05:59 +00:00
break;
case DST_STRING:
result = dst_string_equal(dst_unwrap_string(x), dst_unwrap_string(y));
break;
case DST_STRUCT:
result = dst_struct_equal(dst_unwrap_struct(x), dst_unwrap_struct(y));
break;
2017-04-15 20:05:59 +00:00
default:
/* compare pointers */
result = (dst_unwrap_pointer(x) == dst_unwrap_pointer(y));
2017-04-15 20:05:59 +00:00
break;
2017-02-09 20:02:59 +00:00
}
}
return result;
}
/* Computes a hash value for a function */
int32_t dst_hash(DstValue x) {
int32_t hash = 0;
switch (dst_type(x)) {
case DST_NIL:
case DST_FALSE:
case DST_TRUE:
hash = dst_type(x);
2017-04-15 20:05:59 +00:00
break;
case DST_STRING:
case DST_SYMBOL:
hash = dst_string_hash(dst_unwrap_string(x));
2017-04-15 20:05:59 +00:00
break;
case DST_TUPLE:
2017-11-29 20:17:56 +00:00
hash = dst_tuple_hash(dst_unwrap_tuple(x));
2017-04-15 20:05:59 +00:00
break;
case DST_STRUCT:
2017-11-29 20:17:56 +00:00
hash = dst_struct_hash(dst_unwrap_struct(x));
2017-04-15 20:05:59 +00:00
break;
default:
if (sizeof(double) == sizeof(void *)) {
/* Assuming 8 byte pointer */
uint64_t i = dst_u64(x);
hash = (int32_t)(i >> 32) ^ (int32_t)(i & 0xFFFFFFFF);
} else {
/* Assuming 4 byte pointer (or smaller) */
hash = (int32_t) (dst_unwrap_pointer(x) - NULL);
}
2017-04-15 20:05:59 +00:00
break;
2017-02-09 20:02:59 +00:00
}
return hash;
}
/* Compares x to y. If they are equal retuns 0. If x is less, returns -1.
* If y is less, returns 1. All types are comparable
* and should have strict ordering. */
2017-11-01 21:53:43 +00:00
int dst_compare(DstValue x, DstValue y) {
if (dst_type(x) == dst_type(y)) {
switch (dst_type(x)) {
case DST_NIL:
case DST_FALSE:
case DST_TRUE:
2017-02-09 20:02:59 +00:00
return 0;
case DST_REAL:
/* Check for nans to ensure total order */
if (dst_unwrap_real(x) != dst_unwrap_real(x))
return dst_unwrap_real(y) != dst_unwrap_real(y)
? 0
: -1;
if (dst_unwrap_real(y) != dst_unwrap_real(y))
return 1;
if (dst_unwrap_real(x) == dst_unwrap_real(y)) {
2017-02-09 20:02:59 +00:00
return 0;
} else {
return dst_unwrap_real(x) > dst_unwrap_real(y) ? 1 : -1;
}
case DST_INTEGER:
if (dst_unwrap_integer(x) == dst_unwrap_integer(y)) {
return 0;
} else {
return dst_unwrap_integer(x) > dst_unwrap_integer(y) ? 1 : -1;
2017-02-09 20:02:59 +00:00
}
case DST_STRING:
return dst_string_compare(dst_unwrap_string(x), dst_unwrap_string(y));
case DST_TUPLE:
return dst_tuple_compare(dst_unwrap_tuple(x), dst_unwrap_tuple(y));
case DST_STRUCT:
return dst_struct_compare(dst_unwrap_struct(x), dst_unwrap_struct(y));
2017-02-19 16:19:39 +00:00
default:
if (dst_unwrap_string(x) == dst_unwrap_string(y)) {
2017-02-09 20:02:59 +00:00
return 0;
} else {
return dst_unwrap_string(x) > dst_unwrap_string(y) ? 1 : -1;
2017-02-09 20:02:59 +00:00
}
}
} else if (dst_type(x) < dst_type(y)) {
2017-02-09 20:02:59 +00:00
return -1;
}
return 1;
}
/* Get a value out af an associated data structure. For invalid
* data structure or invalid key, returns nil. */
DstValue dst_get(DstValue ds, DstValue key) {
switch (dst_type(ds)) {
case DST_ARRAY:
if (dst_checktype(key, DST_INTEGER) &&
dst_unwrap_integer(key) >= 0 &&
dst_unwrap_integer(key) < dst_unwrap_array(ds)->count)
return dst_unwrap_array(ds)->data[dst_unwrap_integer(key)];
break;
case DST_TUPLE:
if (dst_checktype(key, DST_INTEGER) &&
dst_unwrap_integer(key) >= 0 &&
dst_unwrap_integer(key) < dst_tuple_length(dst_unwrap_tuple(ds)))
return dst_unwrap_tuple(ds)[dst_unwrap_integer(key)];
break;
case DST_BUFFER:
if (dst_checktype(key, DST_INTEGER) &&
dst_unwrap_integer(key) >= 0 &&
dst_unwrap_integer(key) < dst_unwrap_buffer(ds)->count)
return dst_wrap_integer(dst_unwrap_buffer(ds)->data[dst_unwrap_integer(key)]);
break;
case DST_STRING:
case DST_SYMBOL:
if (dst_checktype(key, DST_INTEGER) &&
dst_unwrap_integer(key) >= 0 &&
dst_unwrap_integer(key) < dst_string_length(dst_unwrap_string(ds)))
return dst_wrap_integer(dst_unwrap_string(ds)[dst_unwrap_integer(key)]);
break;
case DST_STRUCT:
return dst_struct_get(dst_unwrap_struct(ds), key);
case DST_TABLE:
return dst_table_get(dst_unwrap_table(ds), key);
default:
break;
}
return dst_wrap_nil();
}
/* Set a value in an associative data structure. Returns possible
* error message, and NULL if no error. */
void dst_put(DstValue ds, DstValue key, DstValue value) {
switch (dst_type(ds)) {
case DST_ARRAY:
if (dst_checktype(key, DST_INTEGER) &&
dst_unwrap_integer(key) >= 0 &&
dst_unwrap_integer(key) < dst_unwrap_array(ds)->count)
dst_unwrap_array(ds)->data[dst_unwrap_integer(key)] = value;
return;
case DST_BUFFER:
if (dst_checktype(key, DST_INTEGER) &&
dst_checktype(value, DST_INTEGER) &&
dst_unwrap_integer(key) >= 0 &&
dst_unwrap_integer(key) < dst_unwrap_buffer(ds)->count)
dst_unwrap_buffer(ds)->data[dst_unwrap_integer(key)] = dst_unwrap_integer(value);
return;
case DST_TABLE:
dst_table_put(dst_unwrap_table(ds), key, value);
return;
default:
return;
}
}
/* Get the next key in an associative data structure. Used for iterating through an
* associative data structure. */
DstValue dst_next(DstValue ds, DstValue key) {
switch(dst_type(ds)) {
default:
return dst_wrap_nil();
case DST_TABLE:
return dst_table_next(dst_unwrap_table(ds), key);
case DST_STRUCT:
return dst_struct_next(dst_unwrap_struct(ds), key);
}
}
/* Get the length of an object. Returns errors for invalid types */
int32_t dst_length(DstValue x) {
switch (dst_type(x)) {
default:
return 0;
case DST_STRING:
return dst_string_length(dst_unwrap_string(x));
case DST_ARRAY:
return dst_unwrap_array(x)->count;
case DST_BUFFER:
return dst_unwrap_buffer(x)->count;
case DST_TUPLE:
return dst_tuple_length(dst_unwrap_tuple(x));
case DST_STRUCT:
return dst_struct_length(dst_unwrap_struct(x));
case DST_TABLE:
return dst_unwrap_table(x)->count;
}
}
/* Get the capacity of an object. Returns 0 for invalid types */
int32_t dst_capacity(DstValue x) {
switch (dst_type(x)) {
default:
return 0;
case DST_STRING:
return dst_string_length(dst_unwrap_string(x));
case DST_ARRAY:
return dst_unwrap_array(x)->capacity;
case DST_BUFFER:
return dst_unwrap_buffer(x)->capacity;
case DST_TUPLE:
return dst_tuple_length(dst_unwrap_tuple(x));
case DST_STRUCT:
return dst_struct_length(dst_unwrap_struct(x));
case DST_TABLE:
return dst_unwrap_table(x)->capacity;
}
}
/* Index into a data structure. Returns nil for out of bounds or invliad data structure */
DstValue dst_getindex(DstValue ds, int32_t index) {
switch (dst_type(ds)) {
default:
return dst_wrap_nil();
case DST_STRING:
if (index >= dst_string_length(dst_unwrap_string(ds))) return dst_wrap_nil();
return dst_wrap_integer(dst_unwrap_string(ds)[index]);
case DST_ARRAY:
if (index >= dst_unwrap_array(ds)->count) return dst_wrap_nil();
return dst_unwrap_array(ds)->data[index];
case DST_BUFFER:
if (index >= dst_unwrap_buffer(ds)->count) return dst_wrap_nil();
return dst_wrap_integer(dst_unwrap_buffer(ds)->data[index]);
case DST_TUPLE:
if (index >= dst_tuple_length(dst_unwrap_tuple(ds))) return dst_wrap_nil();
return dst_unwrap_tuple(ds)[index];
}
}
/* Set an index in a linear data structure. Does nothing if data structure
* is invalid */
void dst_setindex(DstValue ds, DstValue value, int32_t index) {
switch (dst_type(ds)) {
default:
return;
case DST_ARRAY:
if (index >= dst_unwrap_array(ds)->count) {
dst_array_ensure(dst_unwrap_array(ds), 2 * index);
dst_unwrap_array(ds)->count = index + 1;
}
dst_unwrap_array(ds)->data[index] = value;
return;
case DST_BUFFER:
if (!dst_checktype(value, DST_INTEGER)) return;
if (index >= dst_unwrap_buffer(ds)->count) {
dst_buffer_ensure(dst_unwrap_buffer(ds), 2 * index);
dst_unwrap_buffer(ds)->count = index + 1;
}
dst_unwrap_buffer(ds)->data[index] = dst_unwrap_integer(value);
return;
}
}