return first_link;
}
+link_t* list_insert(link_t* head, unsigned index, int value) {
+ link_t* link_insrt = list_new(value);
+ link_t* head_first = head;
+ //link_t* head_prev = NULL;
+ link_t* head_next = NULL;
+
+ for (unsigned i = 0; i < index; i++) {
+ head = head->next;
+ }
+ //head_prev = head;
+ head->next = link_insrt;
+ head_next = head->next;
+ head = link_insrt;
+ head->next = head_next;
+ return head_first;
+}
+
+link_t* list_delete(link_t* head, unsigned index) {
+ link_t* head_first = head;
+ link_t* head_prev = NULL;
+ link_t* head_next = NULL;
+
+ if (index == 0) {
+ head_next = head->next;
+ free(head);
+ head = head_next;
+ return head;
+ } else {
+ for (unsigned i = 0; i < index-1; i++) {
+ head = head->next;
+ }
+ head_prev = head;
+ head = head->next;
+ head_next = head->next;
+ free(head);
+ head = head_prev;
+ head->next = head_next;
+ return head_first;
+ }
+}
+
unsigned list_count(link_t* head) {
- int count = 1;
+ int count = 0;
- if (head == NULL) { return 0; }
+ if (head == NULL) { return count; }
+ count = 1;
while (head->next != NULL) {
++count;
head = head->next;
void list_set(link_t* head, unsigned index, int value) {
- // FIXME: check for the index value validity
+ //FIXME: check for the index value validity
for (unsigned count = 0; count < index; count++) {
head = head->next;
}