{"id":23629693,"url":"https://github.com/vrtgs/heap-array","last_synced_at":"2026-01-02T16:47:25.002Z","repository":{"id":188324650,"uuid":"678566653","full_name":"Vrtgs/heap-array","owner":"Vrtgs","description":"An Implementation of a variable length array, with its main benefit over `Vec` is taking up less space","archived":false,"fork":false,"pushed_at":"2024-07-07T23:22:05.000Z","size":82,"stargazers_count":3,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2024-12-13T17:52:01.096Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":null,"language":"Rust","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/Vrtgs.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}},"created_at":"2023-08-14T21:19:51.000Z","updated_at":"2024-09-26T03:52:26.000Z","dependencies_parsed_at":null,"dependency_job_id":"d840ed03-b5f3-4722-b4b7-28bebabde8aa","html_url":"https://github.com/Vrtgs/heap-array","commit_stats":null,"previous_names":["nightmare-vortex/heap-array"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Vrtgs%2Fheap-array","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Vrtgs%2Fheap-array/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Vrtgs%2Fheap-array/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Vrtgs%2Fheap-array/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/Vrtgs","download_url":"https://codeload.github.com/Vrtgs/heap-array/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":231573636,"owners_count":18394559,"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-12-28T01:16:59.334Z","updated_at":"2025-12-12T13:38:43.855Z","avatar_url":"https://github.com/Vrtgs.png","language":"Rust","funding_links":[],"categories":[],"sub_categories":[],"readme":"# HeapArray\nAn Implementation of a variable length array, with its main benefit over `Vec` is taking up less space\nas `HeapArray` is represented as (pointer, len) while Vec is a (pointer, len, capacity)\nand is meant as a replacement for `Box\u003c[T]\u003e`\n\nnice to have: compatible with serde\n\n# Example\n```rust\nuse heap_array::{heap_array, HeapArray};\n\nfn main() {\n    let arr = heap_array![1, 2, 5, 8];\n\n    assert_eq!(arr[0], 1);\n    assert_eq!(arr[1], 2);\n    assert_eq!(arr[2], 5);\n    assert_eq!(arr[3], 8);\n    assert_eq!(arr.len(), 4);\n\n    let arr = HeapArray::from_fn(10, |i| i);\n    assert_eq!(*arr, [0, 1, 2, 3, 4, 5, 6, 7, 8, 9])\n}\n```","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fvrtgs%2Fheap-array","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fvrtgs%2Fheap-array","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fvrtgs%2Fheap-array/lists"}