cs140e-24win/notes/generic-data-structures at main · hieu0902/cs140e-24win · GitHub

Name		Name	Last commit message	Last commit date
parent directory ..
Makefile		Makefile
README.md		README.md
backslash.c		backslash.c
circ-test		circ-test
circ-test.c		circ-test.c
circ-test.d		circ-test.d
circ-test.o		circ-test.o
list-test		list-test
list-test.c		list-test.c
list-test.d		list-test.d
list-test.o		list-test.o
notes.txt		notes.txt
queue-test		queue-test
queue-test.c		queue-test.c
queue-test.d		queue-test.d
queue-test.o		queue-test.o
stack-test		stack-test
stack-test.c		stack-test.c
stack-test.d		stack-test.d
stack-test.o		stack-test.o

README.md

Using `cpp` to make generic data structures.

Simple-minded example uses of our generic data structure implementations. These are all in libpi:

circular-T.h: an interrupt-safe, lock-free circular queue implementation.
list-T.h: singly-linked list, head only.
queue-T.h: singe-linked list with head and tail.
stack-T.h: generic fixed sized stack implementation.

TODO:

Go through and regularize the uses. Should have a common pattern.