{"id":24023802,"url":"https://github.com/theo-mestre/dynamic-array","last_synced_at":"2025-02-26T00:49:25.012Z","repository":{"id":239420449,"uuid":"799484069","full_name":"Theo-Mestre/Dynamic-Array","owner":"Theo-Mestre","description":null,"archived":false,"fork":false,"pushed_at":"2024-11-16T16:40:42.000Z","size":23951,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-01-08T14:44:17.564Z","etag":null,"topics":["array","cpp","learning-by-doing"],"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/Theo-Mestre.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-05-12T09:38:51.000Z","updated_at":"2024-12-10T15:51:10.000Z","dependencies_parsed_at":"2024-05-12T10:43:32.478Z","dependency_job_id":null,"html_url":"https://github.com/Theo-Mestre/Dynamic-Array","commit_stats":null,"previous_names":["theo-gamedev/dynamic-array","theo-mestre/dynamic-array"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Theo-Mestre%2FDynamic-Array","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Theo-Mestre%2FDynamic-Array/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Theo-Mestre%2FDynamic-Array/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Theo-Mestre%2FDynamic-Array/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/Theo-Mestre","download_url":"https://codeload.github.com/Theo-Mestre/Dynamic-Array/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":240771898,"owners_count":19854982,"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":["array","cpp","learning-by-doing"],"created_at":"2025-01-08T14:44:42.799Z","updated_at":"2025-02-26T00:49:24.952Z","avatar_url":"https://github.com/Theo-Mestre.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Dynamic Array\n\nThis solution provides a dynamic array implementation in C++ that I made during my first year of programming studies.\nThe solution also contains unit tests.\n\n## DynamicArray.h\n\nThe `DynamicArray.h` file contains the implementation of the `DynamicArray` class, which represents a dynamic array that can grow and shrink as elements are added or removed.\n\n### Class Members\n\n- `DynamicArray()`: Default constructor that initializes an empty dynamic array.\n- `~DynamicArray()`: Destructor that cleans up the dynamic array by deleting the allocated memory.\n- `DynamicArray(const DynamicArray\u0026 _other)`: Copy constructor that creates a deep copy of another dynamic array.\n- `DynamicArray(DynamicArray\u0026\u0026 _other) noexcept`: Move constructor that moves the contents of another dynamic array.\n- `operator=(const DynamicArray\u0026 _other)`: Copy assignment operator that assigns a deep copy of another dynamic array.\n- `operator=(DynamicArray\u0026\u0026 _other) noexcept`: Move assignment operator that moves the contents of another dynamic array.\n- - `PushBack(const T\u0026 _newElement)`: Adds a new element to the end of the array.\n- `PushBack(T\u0026\u0026 _newElement)`: Adds a new element to the end of the array using move semantics.\n- `PopBack()`: Removes the last element from the array.\n- `Clear()`: Removes all elements from the array.\n- `Reserve(size_t _newCapacity)`: Reserves memory for the specified number of elements.\n- `EmplaceBack(Args\u0026\u0026... _args)`: Constructs a new element in-place at the end of the array.\n- `operator[](size_t _index) const`: Accesses the element at the specified index in the array (const version).\n- `operator[](size_t _index)`: Accesses the element at the specified index in the array.\n- `Size() const`: Gets the size of the array.\n- `Capacity() const`: Gets the capacity of the array.\n\n### Usage\n\nTo use the `DynamicArray` class, include the `DynamicArray.h` header file in your C++ program:\nThen, you can create \n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ftheo-mestre%2Fdynamic-array","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Ftheo-mestre%2Fdynamic-array","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ftheo-mestre%2Fdynamic-array/lists"}