{"id":24494777,"url":"https://github.com/thisisnotjustin/circular_buffer","last_synced_at":"2026-02-08T12:03:43.958Z","repository":{"id":270200739,"uuid":"909621706","full_name":"ThisIsNotJustin/circular_buffer","owner":"ThisIsNotJustin","description":"Educational Circular (Ring) Buffer Implementation for Real-Time Systems","archived":false,"fork":false,"pushed_at":"2024-12-29T09:39:34.000Z","size":2,"stargazers_count":2,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-05-09T01:47:05.203Z","etag":null,"topics":["c","embedded-systems"],"latest_commit_sha":null,"homepage":"","language":"C","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/ThisIsNotJustin.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,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2024-12-29T09:30:23.000Z","updated_at":"2025-01-16T00:56:56.000Z","dependencies_parsed_at":"2024-12-29T10:25:05.429Z","dependency_job_id":"33c762bd-49f8-4948-b1d6-bfaf5f35c3c0","html_url":"https://github.com/ThisIsNotJustin/circular_buffer","commit_stats":null,"previous_names":["thisisnotjustin/circular_buffer"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/ThisIsNotJustin/circular_buffer","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ThisIsNotJustin%2Fcircular_buffer","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ThisIsNotJustin%2Fcircular_buffer/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ThisIsNotJustin%2Fcircular_buffer/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ThisIsNotJustin%2Fcircular_buffer/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/ThisIsNotJustin","download_url":"https://codeload.github.com/ThisIsNotJustin/circular_buffer/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ThisIsNotJustin%2Fcircular_buffer/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":29229376,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-02-08T12:03:03.049Z","status":"ssl_error","status_checked_at":"2026-02-08T12:02:56.077Z","response_time":57,"last_error":"SSL_connect returned=1 errno=0 peeraddr=140.82.121.6: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":["c","embedded-systems"],"created_at":"2025-01-21T20:17:13.822Z","updated_at":"2026-02-08T12:03:43.938Z","avatar_url":"https://github.com/ThisIsNotJustin.png","language":"C","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Circular Buffer Implementation\n\nThis is a simple implementation of a circular (ring) buffer, allowing for efficient storage and retrieval of data in a fixed-size buffer. The circular buffer follows a FIFO principle, making it ideal for temporary data storage like in a real-time system/producer-consumer scenario.\n\n## Features\n\n- Fixed-size buffer: The buffer has a defined maximum capacity.\n- Efficient Enqueue and Dequeue: Allows constant-time insertion and removal of data.\n- Circular behavior: When the buffer reaches its maximum capacity, new elements overwrite the oldest ones.\n- Error handling: Functions return error codes in cases like overflows or underflows.\n- Simple API: Provides an easy-to-use interface for managing the buffer.","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fthisisnotjustin%2Fcircular_buffer","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fthisisnotjustin%2Fcircular_buffer","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fthisisnotjustin%2Fcircular_buffer/lists"}