Hash :
1ae6ad0e
Author :
Thomas de Grivel
Date :
2024-07-15T19:59:52
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167
/* kc3
* Copyright 2022,2023,2024 kmx.io <contact@kmx.io>
*
* Permission is hereby granted to use this software granted the above
* copyright notice and this permission paragraph are included in all
* copies and substantial portions of this software.
*
* THIS SOFTWARE IS PROVIDED "AS-IS" WITHOUT ANY GUARANTEE OF
* PURPOSE AND PERFORMANCE. IN NO EVENT WHATSOEVER SHALL THE
* AUTHOR BE CONSIDERED LIABLE FOR THE USE AND PERFORMANCE OF
* THIS SOFTWARE.
*/
#include <string.h>
#include "alloc.h"
#include "assert.h"
#include "buf.h"
#include "buf_inspect.h"
#include "buf_parse.h"
#include "io.h"
#include "sym.h"
#include "tuple.h"
#include "tag.h"
void tuple_clean (s_tuple *tuple)
{
uw i;
assert(tuple);
i = tuple->count;
while (i--)
tag_clean(tuple->tag + i);
free(tuple->tag);
}
void tuple_delete (s_tuple *tuple)
{
tuple_clean(tuple);
free(tuple);
}
s_tuple * tuple_init (s_tuple *tuple, uw count)
{
uw i;
s_tuple tmp;
assert(tuple);
assert(2 <= count);
tmp.count = count;
tmp.tag = alloc(count * sizeof(s_tag));
if (! tmp.tag)
return NULL;
i = count;
while (i--)
tag_init_void(tmp.tag + i);
*tuple = tmp;
return tuple;
}
s_tuple * tuple_init_1 (s_tuple *tuple, const char *p)
{
s_buf buf;
uw len;
sw r;
assert(tuple);
assert(p);
len = strlen(p);
buf_init(&buf, false, len, (char *) p);
buf.wpos = len;
r = buf_parse_tuple(&buf, tuple);
if (r < 0 || (uw) r != len) {
err_write_1("tuple_init_1: invalid tuple: \"");
err_write_1(p);
err_write_1("\", ");
err_inspect_uw(&len);
err_write_1(" != ");
err_inspect_sw(&r);
err_write_1("\n");
assert(! "tuple_init_1: invalid tuple");
return NULL;
}
return tuple;
}
s_tuple * tuple_init_2 (s_tuple *tuple, const s_tag *a, const s_tag *b)
{
tuple_init(tuple, 2);
tag_init_copy(tuple->tag + 0, a);
tag_init_copy(tuple->tag + 1, b);
return tuple;
}
s_tuple * tuple_init_cast (s_tuple *tuple, const s_sym * const *type,
const s_tag *tag)
{
switch (tag->type) {
case TAG_TUPLE:
return tuple_init_copy(tuple, &tag->data.tuple);
default:
break;
}
err_write_1("tuple_init_cast: cannot cast ");
err_write_1(tag_type_to_string(tag->type));
if (*type == &g_sym_Tuple)
err_puts(" to Tuple");
else {
err_write_1(" to ");
err_inspect_sym(type);
err_puts(" aka Tuple");
}
assert(! "tuple_init_cast: cannot cast to Tuple");
return NULL;
}
s_tuple * tuple_init_copy (s_tuple *tuple, const s_tuple *src)
{
uw i = 0;
assert(src);
assert(tuple);
tuple_init(tuple, src->count);
while (i < src->count) {
tag_init_copy(tuple->tag + i, src->tag + i);
i++;
}
return tuple;
}
s_str * tuple_inspect (const s_tuple *x, s_str *dest)
{
s_buf buf;
sw r;
sw size;
size = buf_inspect_tuple_size(x);
buf_init_alloc(&buf, size);
if ((r = buf_inspect_tuple(&buf, x)) < 0)
goto error;
assert(r == size);
if (r != size)
goto error;
return buf_to_str(&buf, dest);
error:
buf_clean(&buf);
return NULL;
}
s_tuple * tuple_new (uw count)
{
s_tuple *tuple;
tuple = alloc(sizeof(s_tuple));
if (! tuple)
return NULL;
if (! tuple_init(tuple, count)) {
free(tuple);
return NULL;
}
return tuple;
}
s_tuple * tuple_new_1 (const char *p)
{
s_tuple *tuple;
tuple = alloc(sizeof(s_tuple));
if (! tuple)
return NULL;
if (! tuple_init_1(tuple, p)) {
free(tuple);
return NULL;
}
return tuple;
}