{"id":23631024,"url":"https://github.com/donomii/liststack","last_synced_at":"2026-05-15T18:34:46.131Z","repository":{"id":95812927,"uuid":"262864315","full_name":"donomii/listStack","owner":"donomii","description":"A linked list implemented as stack","archived":false,"fork":false,"pushed_at":"2020-05-12T06:27:26.000Z","size":28,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-10-08T01:53:24.024Z","etag":null,"topics":["arduino","c","embedded","embedded-c","linked-list","linked-lists","linkedlist","malloc-free","stack","stacks"],"latest_commit_sha":null,"homepage":null,"language":"C","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"gpl-3.0","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/donomii.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,"zenodo":null}},"created_at":"2020-05-10T19:53:01.000Z","updated_at":"2021-11-24T03:04:34.000Z","dependencies_parsed_at":"2023-07-26T08:16:22.855Z","dependency_job_id":null,"html_url":"https://github.com/donomii/listStack","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/donomii/listStack","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/donomii%2FlistStack","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/donomii%2FlistStack/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/donomii%2FlistStack/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/donomii%2FlistStack/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/donomii","download_url":"https://codeload.github.com/donomii/listStack/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/donomii%2FlistStack/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":33074872,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-05-15T11:35:32.926Z","status":"ssl_error","status_checked_at":"2026-05-15T11:35:31.362Z","response_time":103,"last_error":"SSL_connect returned=1 errno=0 peeraddr=140.82.121.5:443 state=error: unexpected eof while reading","robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":false,"can_crawl_api":true,"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":["arduino","c","embedded","embedded-c","linked-list","linked-lists","linkedlist","malloc-free","stack","stacks"],"created_at":"2024-12-28T02:48:17.957Z","updated_at":"2026-05-15T18:34:46.108Z","avatar_url":"https://github.com/donomii.png","language":"C","funding_links":[],"categories":[],"sub_categories":[],"readme":"# listStack\n A linked list implemented sequentially in memory\n \n## Features\n A linked list where all the elements are laid out sequentially in memory,                                               to avoid malloc and free.  The elements can be variable size.\n\n Why?  To provide a linked list implementation that works in embedded systems, without needing                           memory management.\n\n To use this, you must first allocate a chunk of memory, then pass it\n to new_list_stack.  new_list_stack creates a small header structure at\n the start of that memory, and the rest is used for the list.         \n\n # Example\n\n\t  char mem[1000];\n\t  list_stack ls   = new_list_stack(mem, 1000);\n\t  const char  hello_world[]  = \"Hello World.   \";\n\t  const char  greet[] =        \"How are you today? \";\n\n\t  //Allocate list element, we write into the empty space \n\t  char * target = (char *)ls_cons_blank(strlen(greet)+1, ls);\n\t  strcpy(target, greet);\n\n\t  //Allocate new list element, and automatically copy the source data into the list_stack\n\t  ls_cons((void *)hello_world, strlen(hello_world) + 1, ls);\n\n\t  for (ptr i = ls_start(ls); !ls_is_end(i); i=ls_tail(i)){\n\t    //ls_head returns a pointer to the data for element i\n\t    warn(\"%s\", (char *)ls_head(i));\n\t  }\n\t  warn(\"\\n\");\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fdonomii%2Fliststack","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fdonomii%2Fliststack","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fdonomii%2Fliststack/lists"}