{"id":22965753,"url":"https://github.com/mirror4s/deque","last_synced_at":"2025-04-02T04:25:35.081Z","repository":{"id":263792151,"uuid":"891318766","full_name":"MirRoR4s/deque","owner":"MirRoR4s","description":"A double ended queue implementation based on linked list and array.","archived":false,"fork":false,"pushed_at":"2024-11-21T01:13:50.000Z","size":8,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-02-07T19:16:54.380Z","etag":null,"topics":["data-structures-and-algorithms","deque","java"],"latest_commit_sha":null,"homepage":"","language":"Java","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/MirRoR4s.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":"2024-11-20T05:47:29.000Z","updated_at":"2024-11-21T01:13:53.000Z","dependencies_parsed_at":"2024-11-20T11:51:07.975Z","dependency_job_id":null,"html_url":"https://github.com/MirRoR4s/deque","commit_stats":null,"previous_names":["mirror4s/deque"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/MirRoR4s%2Fdeque","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/MirRoR4s%2Fdeque/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/MirRoR4s%2Fdeque/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/MirRoR4s%2Fdeque/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/MirRoR4s","download_url":"https://codeload.github.com/MirRoR4s/deque/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":246754518,"owners_count":20828365,"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":["data-structures-and-algorithms","deque","java"],"created_at":"2024-12-14T20:16:21.477Z","updated_at":"2025-04-02T04:25:35.059Z","avatar_url":"https://github.com/MirRoR4s.png","language":"Java","funding_links":[],"categories":[],"sub_categories":[],"readme":"# deque\n\nA double ended queue implementation based on list and array.\n\n## prior acknowledge\n\n- [CS61B lecture 4 and lecture 5 and lecture 6](https://sp18.datastructur.es/index.html)\n\n## reference\n\n- [CS61B project 1A: Data Structures](https://sp18.datastructur.es/materials/proj/proj1a/proj1a)\n- [gradescope](https://www.gradescope.com/courses/20666/assignments/85897/submissions/226366558)\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmirror4s%2Fdeque","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fmirror4s%2Fdeque","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmirror4s%2Fdeque/lists"}