{"id":17796297,"url":"https://github.com/munificent/lisp2-gc","last_synced_at":"2025-03-17T01:31:49.198Z","repository":{"id":23552371,"uuid":"26919645","full_name":"munificent/lisp2-gc","owner":"munificent","description":"A simple implementation of the LISP2 mark-compact GC algorithm","archived":false,"fork":false,"pushed_at":"2014-11-20T15:54:58.000Z","size":104,"stargazers_count":41,"open_issues_count":0,"forks_count":4,"subscribers_count":2,"default_branch":"master","last_synced_at":"2025-03-16T08:02:27.671Z","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/munificent.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null}},"created_at":"2014-11-20T15:54:42.000Z","updated_at":"2025-03-02T19:28:14.000Z","dependencies_parsed_at":"2022-07-19T04:02:16.590Z","dependency_job_id":null,"html_url":"https://github.com/munificent/lisp2-gc","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/munificent%2Flisp2-gc","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/munificent%2Flisp2-gc/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/munificent%2Flisp2-gc/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/munificent%2Flisp2-gc/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/munificent","download_url":"https://codeload.github.com/munificent/lisp2-gc/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":243958341,"owners_count":20374842,"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-10-27T11:43:06.498Z","updated_at":"2025-03-17T01:31:48.855Z","avatar_url":"https://github.com/munificent.png","language":"C","funding_links":[],"categories":[],"sub_categories":[],"readme":"A toy implementation of the [LISP2][] [mark-compact][] garbage collection algorithm.\n\nIt contains two versions. `lisp2.c` is the simpler of the two and is well-documented. It implements the garbage collector using a single fixed-size heap. `lisp2-reallocate.c` extends that by growing and shrinking the heap as needed.\n\n[lisp2]: http://en.wikipedia.org/wiki/Mark-compact_algorithm#LISP2_Algorithm\n[mark-compact]: http://en.wikipedia.org/wiki/Mark-compact_algorithm","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmunificent%2Flisp2-gc","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fmunificent%2Flisp2-gc","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmunificent%2Flisp2-gc/lists"}