Add example for doubly linked list
This commit is contained in:
parent
6f2cdd8d62
commit
b7264e20f2
@ -1,5 +1,6 @@
|
|||||||
from .codegen import test_str8, test_typed_array
|
from .codegen import test_str8, test_doubly_linked_list, test_typed_array
|
||||||
|
|
||||||
if __name__ == "__main__":
|
if __name__ == "__main__":
|
||||||
test_str8()
|
test_str8()
|
||||||
test_typed_array()
|
test_typed_array()
|
||||||
|
test_doubly_linked_list()
|
||||||
|
@ -1,5 +1,6 @@
|
|||||||
from pathlib import Path
|
from pathlib import Path
|
||||||
from .datatypes import (
|
from .datatypes import (
|
||||||
|
CDataType,
|
||||||
CStruct,
|
CStruct,
|
||||||
CEnum,
|
CEnum,
|
||||||
CEnumVal,
|
CEnumVal,
|
||||||
@ -13,6 +14,7 @@ from .datatypes import (
|
|||||||
CQualifier,
|
CQualifier,
|
||||||
CInclude,
|
CInclude,
|
||||||
CUserType,
|
CUserType,
|
||||||
|
get_datatype_string,
|
||||||
)
|
)
|
||||||
|
|
||||||
|
|
||||||
@ -149,3 +151,196 @@ def test_typed_array():
|
|||||||
|
|
||||||
header.save(Path("."))
|
header.save(Path("."))
|
||||||
source.save(Path("."))
|
source.save(Path("."))
|
||||||
|
|
||||||
|
|
||||||
|
def test_doubly_linked_list():
|
||||||
|
datatypes: dict[CDataType, list[CInclude]] = {"Str8": [CInclude(header="str8.h", local=True)]}
|
||||||
|
snippets_dir = Path("snippets")
|
||||||
|
|
||||||
|
for _type, includes in datatypes.items():
|
||||||
|
type_string = get_datatype_string(_type)
|
||||||
|
|
||||||
|
node = CStruct(
|
||||||
|
name=f"{type_string}Node",
|
||||||
|
cargs=[
|
||||||
|
CArg(name="string", _type=type_string, pointer=CPointer(_type=CPointerType.SINGLE)),
|
||||||
|
CArg(name="prev", _type=f"{type_string}Node", pointer=CPointer(_type=CPointerType.SINGLE)),
|
||||||
|
CArg(name="next", _type=f"{type_string}Node", pointer=CPointer(_type=CPointerType.SINGLE)),
|
||||||
|
],
|
||||||
|
)
|
||||||
|
|
||||||
|
dl_list = CStruct(
|
||||||
|
name=f"{type_string}List",
|
||||||
|
cargs=[
|
||||||
|
CArg(name="first", _type=node, pointer=CPointer(_type=CPointerType.SINGLE)),
|
||||||
|
CArg(name="last", _type=node, pointer=CPointer(_type=CPointerType.SINGLE)),
|
||||||
|
CArg(name="total_size", _type=CType.U64),
|
||||||
|
CArg(name="node_count", _type=CType.U64),
|
||||||
|
],
|
||||||
|
)
|
||||||
|
|
||||||
|
get_func = CFunc(
|
||||||
|
name=f"wapp_{type_string.lower()}_list_get",
|
||||||
|
ret_type=node,
|
||||||
|
args=[
|
||||||
|
CArg(name="list", _type=dl_list, pointer=CPointer(CPointerType.SINGLE), qualifier=CQualifier.CONST),
|
||||||
|
CArg(name="index", _type=CType.U64),
|
||||||
|
],
|
||||||
|
body=load_func_body_from_file(Path(__file__).parent / snippets_dir / "list_get").format(
|
||||||
|
T=type_string,
|
||||||
|
Tupper=type_string.upper(),
|
||||||
|
Tlower=type_string.lower()
|
||||||
|
),
|
||||||
|
pointer=CPointer(CPointerType.SINGLE),
|
||||||
|
)
|
||||||
|
|
||||||
|
push_front_func = CFunc(
|
||||||
|
name=f"wapp_{type_string.lower()}_list_push_front",
|
||||||
|
ret_type=CType.VOID,
|
||||||
|
args=[
|
||||||
|
CArg(name="list", _type=dl_list, pointer=CPointer(CPointerType.SINGLE)),
|
||||||
|
CArg(name="node", _type=node, pointer=CPointer(CPointerType.SINGLE)),
|
||||||
|
],
|
||||||
|
body=load_func_body_from_file(Path(__file__).parent / snippets_dir / "list_push_front").format(
|
||||||
|
T=type_string,
|
||||||
|
Tupper=type_string.upper(),
|
||||||
|
Tlower=type_string.lower()
|
||||||
|
),
|
||||||
|
)
|
||||||
|
|
||||||
|
push_back_func = CFunc(
|
||||||
|
name=f"wapp_{type_string.lower()}_list_push_back",
|
||||||
|
ret_type=CType.VOID,
|
||||||
|
args=[
|
||||||
|
CArg(name="list", _type=dl_list, pointer=CPointer(CPointerType.SINGLE)),
|
||||||
|
CArg(name="node", _type=node, pointer=CPointer(CPointerType.SINGLE)),
|
||||||
|
],
|
||||||
|
body=load_func_body_from_file(Path(__file__).parent / snippets_dir / "list_push_back").format(
|
||||||
|
T=type_string,
|
||||||
|
Tupper=type_string.upper(),
|
||||||
|
Tlower=type_string.lower()
|
||||||
|
),
|
||||||
|
)
|
||||||
|
|
||||||
|
insert_func = CFunc(
|
||||||
|
name=f"wapp_{type_string.lower()}_list_insert",
|
||||||
|
ret_type=CType.VOID,
|
||||||
|
args=[
|
||||||
|
CArg(name="list", _type=dl_list, pointer=CPointer(CPointerType.SINGLE)),
|
||||||
|
CArg(name="node", _type=node, pointer=CPointer(CPointerType.SINGLE)),
|
||||||
|
CArg(name="index", _type=CType.U64),
|
||||||
|
],
|
||||||
|
body=load_func_body_from_file(Path(__file__).parent / snippets_dir / "list_insert").format(
|
||||||
|
T=type_string,
|
||||||
|
Tupper=type_string.upper(),
|
||||||
|
Tlower=type_string.lower()
|
||||||
|
),
|
||||||
|
)
|
||||||
|
|
||||||
|
pop_front_func = CFunc(
|
||||||
|
name=f"wapp_{type_string.lower()}_list_pop_front",
|
||||||
|
ret_type=node,
|
||||||
|
args=[
|
||||||
|
CArg(name="list", _type=dl_list, pointer=CPointer(CPointerType.SINGLE)),
|
||||||
|
],
|
||||||
|
body=load_func_body_from_file(Path(__file__).parent / snippets_dir / "list_pop_front").format(
|
||||||
|
T=type_string,
|
||||||
|
Tupper=type_string.upper(),
|
||||||
|
Tlower=type_string.lower()
|
||||||
|
),
|
||||||
|
pointer=CPointer(CPointerType.SINGLE),
|
||||||
|
)
|
||||||
|
|
||||||
|
pop_back_func = CFunc(
|
||||||
|
name=f"wapp_{type_string.lower()}_list_pop_back",
|
||||||
|
ret_type=node,
|
||||||
|
args=[
|
||||||
|
CArg(name="list", _type=dl_list, pointer=CPointer(CPointerType.SINGLE)),
|
||||||
|
],
|
||||||
|
body=load_func_body_from_file(Path(__file__).parent / snippets_dir / "list_pop_back").format(
|
||||||
|
T=type_string,
|
||||||
|
Tupper=type_string.upper(),
|
||||||
|
Tlower=type_string.lower()
|
||||||
|
),
|
||||||
|
pointer=CPointer(CPointerType.SINGLE),
|
||||||
|
)
|
||||||
|
|
||||||
|
remove_func = CFunc(
|
||||||
|
name=f"wapp_{type_string.lower()}_list_remove",
|
||||||
|
ret_type=node,
|
||||||
|
args=[
|
||||||
|
CArg(name="list", _type=dl_list, pointer=CPointer(CPointerType.SINGLE)),
|
||||||
|
CArg(name="index", _type=CType.U64),
|
||||||
|
],
|
||||||
|
body=load_func_body_from_file(Path(__file__).parent / snippets_dir / "list_remove").format(
|
||||||
|
T=type_string,
|
||||||
|
Tupper=type_string.upper(),
|
||||||
|
Tlower=type_string.lower()
|
||||||
|
),
|
||||||
|
pointer=CPointer(CPointerType.SINGLE),
|
||||||
|
)
|
||||||
|
|
||||||
|
empty_func = CFunc(
|
||||||
|
name=f"wapp_{type_string.lower()}_list_empty",
|
||||||
|
ret_type=CType.VOID,
|
||||||
|
args=[
|
||||||
|
CArg(name="list", _type=dl_list, pointer=CPointer(CPointerType.SINGLE)),
|
||||||
|
],
|
||||||
|
body=load_func_body_from_file(Path(__file__).parent / snippets_dir / "list_empty").format(
|
||||||
|
T=type_string,
|
||||||
|
Tupper=type_string.upper(),
|
||||||
|
Tlower=type_string.lower()
|
||||||
|
),
|
||||||
|
)
|
||||||
|
|
||||||
|
node_to_list_func = CFunc(
|
||||||
|
name=f"{type_string.lower()}_node_to_list",
|
||||||
|
ret_type=dl_list,
|
||||||
|
args=[
|
||||||
|
CArg(name="node", _type=node, pointer=CPointer(CPointerType.SINGLE)),
|
||||||
|
],
|
||||||
|
body=load_func_body_from_file(Path(__file__).parent / snippets_dir / "node_to_list").format(
|
||||||
|
T=type_string,
|
||||||
|
Tupper=type_string.upper(),
|
||||||
|
Tlower=type_string.lower(),
|
||||||
|
),
|
||||||
|
qualifiers=[CQualifier.INTERNAL],
|
||||||
|
)
|
||||||
|
|
||||||
|
header = CHeader(
|
||||||
|
name=f"{type_string.lower()}_list",
|
||||||
|
includes=[CInclude(header="aliases.h", local=True)],
|
||||||
|
types=[node, dl_list],
|
||||||
|
funcs=[
|
||||||
|
get_func,
|
||||||
|
push_front_func,
|
||||||
|
push_back_func,
|
||||||
|
insert_func,
|
||||||
|
pop_front_func,
|
||||||
|
pop_back_func,
|
||||||
|
remove_func,
|
||||||
|
empty_func,
|
||||||
|
]
|
||||||
|
)
|
||||||
|
|
||||||
|
source = CSource(
|
||||||
|
name=header.name,
|
||||||
|
includes=[CInclude(header="aliases.h", local=True), CInclude(header, local=True), CInclude(header="stddef.h")],
|
||||||
|
internal_funcs=[node_to_list_func],
|
||||||
|
funcs=header.funcs
|
||||||
|
)
|
||||||
|
|
||||||
|
if len(includes) > 0:
|
||||||
|
header.includes.extend(includes)
|
||||||
|
source.includes.extend(includes)
|
||||||
|
|
||||||
|
header.includes = sorted(header.includes, key=lambda inc: inc.local, reverse=True)
|
||||||
|
source.includes = sorted(source.includes, key=lambda inc: inc.local, reverse=True)
|
||||||
|
|
||||||
|
header.save(Path("."))
|
||||||
|
source.save(Path("."))
|
||||||
|
|
||||||
|
|
||||||
|
def load_func_body_from_file(filename: Path) -> str:
|
||||||
|
with open(filename, "r") as infile:
|
||||||
|
return infile.read()
|
||||||
|
8
codegen/snippets/list_empty
Normal file
8
codegen/snippets/list_empty
Normal file
@ -0,0 +1,8 @@
|
|||||||
|
if (!list) {{
|
||||||
|
return;
|
||||||
|
}}
|
||||||
|
|
||||||
|
u64 count = list->node_count;
|
||||||
|
for (u64 i = 0; i < count; ++i) {{
|
||||||
|
wapp_str8_list_pop_back(list);
|
||||||
|
}}
|
13
codegen/snippets/list_get
Normal file
13
codegen/snippets/list_get
Normal file
@ -0,0 +1,13 @@
|
|||||||
|
if (index >= list->node_count) {{
|
||||||
|
return NULL;
|
||||||
|
}}
|
||||||
|
|
||||||
|
{T}Node *output = NULL;
|
||||||
|
{T}Node *current = list->first;
|
||||||
|
for (u64 i = 1; i <= index; ++i) {{
|
||||||
|
current = current->next;
|
||||||
|
}}
|
||||||
|
|
||||||
|
output = current;
|
||||||
|
|
||||||
|
return output;
|
29
codegen/snippets/list_insert
Normal file
29
codegen/snippets/list_insert
Normal file
@ -0,0 +1,29 @@
|
|||||||
|
if (!list || !node || !(node->string)) {{
|
||||||
|
return;
|
||||||
|
}}
|
||||||
|
|
||||||
|
if (index == 0) {{
|
||||||
|
wapp_str8_list_push_front(list, node);
|
||||||
|
return;
|
||||||
|
}} else if (index == list->node_count) {{
|
||||||
|
wapp_str8_list_push_back(list, node);
|
||||||
|
return;
|
||||||
|
}}
|
||||||
|
|
||||||
|
{T}Node *dst_node = wapp_str8_list_get(list, index);
|
||||||
|
if (!dst_node) {{
|
||||||
|
return;
|
||||||
|
}}
|
||||||
|
|
||||||
|
{T}List node_list = {Tlower}_node_to_list(node);
|
||||||
|
|
||||||
|
list->total_size += node_list.total_size;
|
||||||
|
list->node_count += node_list.node_count;
|
||||||
|
|
||||||
|
{T}Node *prev = dst_node->prev;
|
||||||
|
|
||||||
|
dst_node->prev = node_list.last;
|
||||||
|
prev->next = node_list.first;
|
||||||
|
|
||||||
|
node_list.first->prev = prev;
|
||||||
|
node_list.last->next = dst_node;
|
21
codegen/snippets/list_pop_back
Normal file
21
codegen/snippets/list_pop_back
Normal file
@ -0,0 +1,21 @@
|
|||||||
|
{T}Node *output = NULL;
|
||||||
|
|
||||||
|
if (!list || list->node_count == 0) {{
|
||||||
|
goto RETURN_{Tupper}_LIST_POP_BACK;
|
||||||
|
}}
|
||||||
|
|
||||||
|
output = list->last;
|
||||||
|
|
||||||
|
if (list->node_count == 1) {{
|
||||||
|
*list = ({T}List){{0}};
|
||||||
|
goto RETURN_{Tupper}_LIST_POP_BACK;
|
||||||
|
}}
|
||||||
|
|
||||||
|
--(list->node_count);
|
||||||
|
list->total_size -= output->string->size;
|
||||||
|
list->last = output->prev;
|
||||||
|
|
||||||
|
output->prev = output->next = NULL;
|
||||||
|
|
||||||
|
RETURN_{Tupper}_LIST_POP_BACK:
|
||||||
|
return output;
|
21
codegen/snippets/list_pop_front
Normal file
21
codegen/snippets/list_pop_front
Normal file
@ -0,0 +1,21 @@
|
|||||||
|
{T}Node *output = NULL;
|
||||||
|
|
||||||
|
if (!list || list->node_count == 0) {{
|
||||||
|
goto RETURN_{Tupper}_LIST_POP_FRONT;
|
||||||
|
}}
|
||||||
|
|
||||||
|
output = list->first;
|
||||||
|
|
||||||
|
if (list->node_count == 1) {{
|
||||||
|
*list = ({T}List){{0}};
|
||||||
|
goto RETURN_{Tupper}_LIST_POP_FRONT;
|
||||||
|
}}
|
||||||
|
|
||||||
|
--(list->node_count);
|
||||||
|
list->total_size -= output->string->size;
|
||||||
|
list->first = output->next;
|
||||||
|
|
||||||
|
output->prev = output->next = NULL;
|
||||||
|
|
||||||
|
RETURN_{Tupper}_LIST_POP_FRONT:
|
||||||
|
return output;
|
21
codegen/snippets/list_push_back
Normal file
21
codegen/snippets/list_push_back
Normal file
@ -0,0 +1,21 @@
|
|||||||
|
if (!list || !node || !(node->string)) {{
|
||||||
|
return;
|
||||||
|
}}
|
||||||
|
|
||||||
|
{T}List node_list = {Tlower}_node_to_list(node);
|
||||||
|
|
||||||
|
if (list->node_count == 0) {{
|
||||||
|
*list = node_list;
|
||||||
|
return;
|
||||||
|
}}
|
||||||
|
|
||||||
|
list->total_size += node_list.total_size;
|
||||||
|
list->node_count += node_list.node_count;
|
||||||
|
|
||||||
|
{T}Node *last = list->last;
|
||||||
|
if (last) {{
|
||||||
|
last->next = node_list.first;
|
||||||
|
}}
|
||||||
|
|
||||||
|
list->last = node_list.last;
|
||||||
|
node_list.first->prev = last;
|
21
codegen/snippets/list_push_front
Normal file
21
codegen/snippets/list_push_front
Normal file
@ -0,0 +1,21 @@
|
|||||||
|
if (!list || !node || !(node->string)) {{
|
||||||
|
return;
|
||||||
|
}}
|
||||||
|
|
||||||
|
{T}List node_list = {Tlower}_node_to_list(node);
|
||||||
|
|
||||||
|
if (list->node_count == 0) {{
|
||||||
|
*list = node_list;
|
||||||
|
return;
|
||||||
|
}}
|
||||||
|
|
||||||
|
list->total_size += node_list.total_size;
|
||||||
|
list->node_count += node_list.node_count;
|
||||||
|
|
||||||
|
{T}Node *first = list->first;
|
||||||
|
if (first) {{
|
||||||
|
first->prev = node_list.last;
|
||||||
|
}}
|
||||||
|
|
||||||
|
list->first = node_list.first;
|
||||||
|
node_list.last->next = first;
|
28
codegen/snippets/list_remove
Normal file
28
codegen/snippets/list_remove
Normal file
@ -0,0 +1,28 @@
|
|||||||
|
{T}Node *output = NULL;
|
||||||
|
if (!list) {{
|
||||||
|
goto RETURN_{Tupper}_LIST_REMOVE;
|
||||||
|
}}
|
||||||
|
|
||||||
|
if (index == 0) {{
|
||||||
|
output = wapp_str8_list_pop_front(list);
|
||||||
|
goto RETURN_{Tupper}_LIST_REMOVE;
|
||||||
|
}} else if (index == list->node_count) {{
|
||||||
|
output = wapp_str8_list_pop_back(list);
|
||||||
|
goto RETURN_{Tupper}_LIST_REMOVE;
|
||||||
|
}}
|
||||||
|
|
||||||
|
output = wapp_str8_list_get(list, index);
|
||||||
|
if (!output) {{
|
||||||
|
goto RETURN_{Tupper}_LIST_REMOVE;
|
||||||
|
}}
|
||||||
|
|
||||||
|
output->prev->next = output->next;
|
||||||
|
output->next->prev = output->prev;
|
||||||
|
|
||||||
|
--(list->node_count);
|
||||||
|
list->total_size -= output->string->size;
|
||||||
|
|
||||||
|
output->prev = output->next = NULL;
|
||||||
|
|
||||||
|
RETURN_{Tupper}_LIST_REMOVE:
|
||||||
|
return output;
|
15
codegen/snippets/node_to_list
Normal file
15
codegen/snippets/node_to_list
Normal file
@ -0,0 +1,15 @@
|
|||||||
|
{T}List output = {{.first = node, .last = node, .total_size = node->string->size, .node_count = 1}};
|
||||||
|
|
||||||
|
while (output.first->prev != NULL) {{
|
||||||
|
output.total_size += output.first->prev->string->size;
|
||||||
|
output.first = output.first->prev;
|
||||||
|
++(output.node_count);
|
||||||
|
}}
|
||||||
|
|
||||||
|
while (output.last->next != NULL) {{
|
||||||
|
output.total_size += output.last->next->string->size;
|
||||||
|
output.last = output.last->next;
|
||||||
|
++(output.node_count);
|
||||||
|
}}
|
||||||
|
|
||||||
|
return output;
|
Loading…
Reference in New Issue
Block a user