{"id":19163331,"url":"https://github.com/programmer-ke/c-list","last_synced_at":"2025-10-25T09:02:10.685Z","repository":{"id":142051105,"uuid":"81654097","full_name":"programmer-ke/c-list","owner":"programmer-ke","description":"A doubly linked list implementation in C","archived":false,"fork":false,"pushed_at":"2017-02-13T14:23:52.000Z","size":92,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-01-03T21:43:39.918Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":null,"language":"C","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"other","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/programmer-ke.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2017-02-11T13:17:58.000Z","updated_at":"2020-10-09T17:35:22.000Z","dependencies_parsed_at":null,"dependency_job_id":"c9150475-9491-44b6-bf46-c4f98c0deab2","html_url":"https://github.com/programmer-ke/c-list","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/programmer-ke%2Fc-list","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/programmer-ke%2Fc-list/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/programmer-ke%2Fc-list/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/programmer-ke%2Fc-list/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/programmer-ke","download_url":"https://codeload.github.com/programmer-ke/c-list/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":240245887,"owners_count":19771029,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":[],"created_at":"2024-11-09T09:14:51.886Z","updated_at":"2025-10-25T09:02:05.647Z","avatar_url":"https://github.com/programmer-ke.png","language":"C","funding_links":[],"categories":[],"sub_categories":[],"readme":"# NAME\n\nList_create, List_destroy, List_clear, List_clear_destroy, List_push, List_pop,\nList_unshift, List_shift, List_remove - manipulate a doubly linked list\n\n# SYNOPSIS\n\n\\#include \"list.h\"\n\nList *List_create()\n\nvoid List_destroy(List *list)\n\nvoid List_clear(List *list)\n\nvoid List_clear_destroy(List *list)\n\nvoid List_push(List *list, void *value)\n\nvoid *List_pop(List *list)\n\nvoid List_unshift(List *list, void *value)\n\nvoid *List_shift(List *list)\n\nvoid *List_remove(List *list, ListNode *node)\n\n# DESCRIPTION\n\n`list *list_create()` returns a pointer to a newly created list\n\n`void list_destroy(list *list)` destroys the list and all nodes in it. ignores the\nfact that the nodes may have values\n\n`void list_clear(list *list)` clears the values of all nodes in the list\n\n`void list_clear_destroy(list *list)` first clears the values in all the list \nnodes, then destroys the list and all its nodes\n\n`void list_push(list *list, void *value)` creates a node at the end of the list \nand assigns value to it\n\n`void *list_pop(list *list)` removes the last node in the list and returns its \nvalue\n\n`void list_unshift(list *list, void *value)` creates a new node at the beginning \nof the list and gives it the specified value\n\n`void *list_shift(list *list)` removes the first node if it exists and returns its\nvalue\n\n`void *list_remove(list *list, listnode *node)` removes the given node from the \nlist and returns its value\n\nThe the list node structure is defined as:\n\n     typedef struct ListNode {\n       struct ListNode *next;\n       struct ListNode *prev;\n       void *value;\n     } ListNode;\n\nThe structure of the list itself is:\n\n     typedef struct List {\n       int count;\n       ListNode *first;\n       ListNode *last;\n     } List;\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fprogrammer-ke%2Fc-list","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fprogrammer-ke%2Fc-list","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fprogrammer-ke%2Fc-list/lists"}