oreodave/alisp
Archived
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Test for tagging integers

Browse Source
This commit is contained in:
Aryadev Chavali
2025-08-19 23:22:12 +01:00
parent 779c4b8305
commit f8c2ec86ae
1 changed files with 7 additions and 24 deletions
Download Patch File Download Diff File Expand all files Collapse all files

31
main.c
View File

@@ -27,33 +27,16 @@ sv_t sv_copy(sv_t old)
int main(void) int main(void)
{ {
sym_table_t table = {0}; i64 numbers[] = {
sym_table_init(&table); 1, 1024, -200, 1LU << 32, INT_MAX, INT_MIN,
// Let's hash the words of lorem ipsum
const char *words[] = {
"aliquam", "erat", "volutpat", "nunc", "eleifend",
"leo", "vitae", "magna", "in", "id",
"erat", "non", "orci", "commodo", "lobortis",
"proin", "neque", "massa", "cursus", "ut",
"gravida", "ut", "lobortis", "eget", "lacus",
"sed", "diam", "praesent", "fermentum", "tempor",
"tellus", "nullam", "tempus", "mauris", "ac",
"felis", "vel", "velit", "tristique", "imperdiet",
"donec", "at", "pede", "etiam", "vel",
"neque", "nec", "dui", "dignissim", "bibendum",
"vivamus", "id", "enim", "phasellus", "neque",
"orci", "porta", "a", "aliquet", "quis",
"semper", "a", "massa", "phasellus", "purus",
"pellentesque", "tristique", "imperdiet", "tortor", "nam",
"euismod", "tellus", "id", "erat",
}; };
for (u64 i = 0; i < ARRSIZE(words); ++i) for (u64 i = 0; i < ARRSIZE(numbers); ++i)
{ {
char *ptr = sym_table_find(&table, SV(words[i], strlen(words[i]))); i64 num = numbers[i];
printf("%s => %p\n", words[i], ptr); lisp_t *lisp = tag_int(num);
i64 ret = as_int(lisp);
printf("%#16lx => %#16lx => %#16lx\n", num, lisp, ret);
} }
sym_table_cleanup(&table);
return 0; return 0;
} }