/
dlist.c
74 lines (67 loc) · 1.52 KB
/
dlist.c
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
/**
* dlist.c
* Lake Scheme
*
* Copyright 2011 Sami Samhuri
* MIT License
*
*/
#include "dlist.h"
#include "common.h"
#include "lake.h"
static LakeDottedList *dlist_alloc(void)
{
LakeDottedList *dlist = malloc(sizeof(LakeDottedList));
VAL(dlist)->type = TYPE_DLIST;
VAL(dlist)->size = sizeof(LakeDottedList);
return dlist;
}
LakeDottedList *dlist_make(LakeList *head, LakeVal *tail)
{
LakeDottedList *dlist = dlist_alloc();
dlist->head = head;
dlist->tail = tail;
return dlist;
}
LakeList *dlist_head(LakeDottedList *dlist)
{
return dlist->head;
}
LakeVal *dlist_tail(LakeDottedList *dlist)
{
return dlist->tail;
}
char *dlist_repr(LakeDottedList *dlist)
{
char *s = malloc(2);
s[0] = '(';
s[1] = '\0';
int i;
char *s2;
if (dlist->head && LIST_N(dlist->head)) {
for (i = 0; i < LIST_N(dlist->head); ++i) {
s2 = lake_repr(LIST_VAL(dlist->head, i));
s = lake_str_append(s, s2);
free(s2);
if (i != LIST_N(dlist->head) - 1) s = lake_str_append(s, " ");
}
}
else if (dlist->head) {
s2 = lake_repr(dlist->head);
s = lake_str_append(s, s2);
free(s2);
}
s = lake_str_append(s, " . ");
s2 = lake_repr(dlist->tail);
s = lake_str_append(s, s2);
free(s2);
return lake_str_append(s, ")");
}
bool dlist_equal(LakeDottedList *a, LakeDottedList *b)
{
LakeVal *headA = VAL(dlist_head(a));
LakeVal *tailA = dlist_tail(a);
LakeVal *headB = VAL(dlist_head(b));
LakeVal *tailB = dlist_tail(b);
return lake_equal(headA, headB) && lake_equal(tailA, tailB);
}