mirror of
https://github.com/janet-lang/janet
synced 2024-12-25 07:50:27 +00:00
605848b217
util.c and make public API smaller. Pad strings and symbols with extra 0 byte for better interop with C.
105 lines
3.1 KiB
C
105 lines
3.1 KiB
C
/*
|
|
* Copyright (c) 2017 Calvin Rose
|
|
*
|
|
* 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:
|
|
*
|
|
* The above copyright notice and this permission notice shall be included in
|
|
* all copies or substantial portions of the Software.
|
|
*
|
|
* 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>
|
|
#include "gc.h"
|
|
|
|
/* Iniializes an array */
|
|
DstArray *dst_array_init(DstArray *array, int32_t capacity) {
|
|
Dst *data = NULL;
|
|
if (capacity > 0) {
|
|
data = (Dst *) malloc(sizeof(Dst) * capacity);
|
|
if (NULL == data) {
|
|
DST_OUT_OF_MEMORY;
|
|
}
|
|
}
|
|
array->count = 0;
|
|
array->capacity = capacity;
|
|
array->data = data;
|
|
return array;
|
|
}
|
|
|
|
void dst_array_deinit(DstArray *array) {
|
|
free(array->data);
|
|
}
|
|
|
|
/* Creates a new array */
|
|
DstArray *dst_array(int32_t capacity) {
|
|
DstArray *array = dst_gcalloc(DST_MEMORY_ARRAY, sizeof(DstArray));
|
|
return dst_array_init(array, capacity);
|
|
}
|
|
|
|
/* Ensure the array has enough capacity for elements */
|
|
void dst_array_ensure(DstArray *array, int32_t capacity) {
|
|
Dst *newData;
|
|
Dst *old = array->data;
|
|
if (capacity <= array->capacity) return;
|
|
newData = realloc(old, capacity * sizeof(Dst));
|
|
if (NULL == newData) {
|
|
DST_OUT_OF_MEMORY;
|
|
}
|
|
array->data = newData;
|
|
array->capacity = capacity;
|
|
}
|
|
|
|
/* Set the count of an array. Extend with nil if needed. */
|
|
void dst_array_setcount(DstArray *array, int32_t count) {
|
|
if (count < 0)
|
|
return;
|
|
if (count > array->count) {
|
|
int32_t i;
|
|
dst_array_ensure(array, count + 1);
|
|
for (i = array->count; i < count; i++) {
|
|
array->data[i] = dst_wrap_nil();
|
|
}
|
|
}
|
|
array->count = count;
|
|
}
|
|
|
|
/* Push a value to the top of the array */
|
|
void dst_array_push(DstArray *array, Dst x) {
|
|
int32_t newcount = array->count + 1;
|
|
if (newcount >= array->capacity) {
|
|
dst_array_ensure(array, newcount * 2);
|
|
}
|
|
array->data[array->count] = x;
|
|
array->count = newcount;
|
|
}
|
|
|
|
/* Pop a value from the top of the array */
|
|
Dst dst_array_pop(DstArray *array) {
|
|
if (array->count) {
|
|
return array->data[--array->count];
|
|
} else {
|
|
return dst_wrap_nil();
|
|
}
|
|
}
|
|
|
|
/* Look at the last value in the array */
|
|
Dst dst_array_peek(DstArray *array) {
|
|
if (array->count) {
|
|
return array->data[array->count - 1];
|
|
} else {
|
|
return dst_wrap_nil();
|
|
}
|
|
}
|