{"id":25171724,"url":"https://github.com/basemax/circularlinkedlistcpp","last_synced_at":"2025-09-19T18:36:43.900Z","repository":{"id":151535253,"uuid":"571586007","full_name":"BaseMax/CircularLinkedListCpp","owner":"BaseMax","description":"This is a simple implementation of a circular linked-list in C++.","archived":false,"fork":false,"pushed_at":"2022-12-07T05:46:01.000Z","size":23,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":2,"default_branch":"main","last_synced_at":"2025-06-30T22:47:36.677Z","etag":null,"topics":["circular","circular-linked-list","cpp","data-structure","datastructure","ds","linked-list","linkedlist"],"latest_commit_sha":null,"homepage":"","language":"C++","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"gpl-3.0","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/BaseMax.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,"zenodo":null}},"created_at":"2022-11-28T13:01:32.000Z","updated_at":"2022-12-07T05:20:14.000Z","dependencies_parsed_at":null,"dependency_job_id":"f3e26833-ae32-4b83-9673-75c56eab3e64","html_url":"https://github.com/BaseMax/CircularLinkedListCpp","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/BaseMax/CircularLinkedListCpp","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/BaseMax%2FCircularLinkedListCpp","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/BaseMax%2FCircularLinkedListCpp/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/BaseMax%2FCircularLinkedListCpp/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/BaseMax%2FCircularLinkedListCpp/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/BaseMax","download_url":"https://codeload.github.com/BaseMax/CircularLinkedListCpp/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/BaseMax%2FCircularLinkedListCpp/sbom","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":263314118,"owners_count":23447293,"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":["circular","circular-linked-list","cpp","data-structure","datastructure","ds","linked-list","linkedlist"],"created_at":"2025-02-09T09:21:45.214Z","updated_at":"2025-09-19T18:36:38.832Z","avatar_url":"https://github.com/BaseMax.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Circular Linked-List C++\r\n\r\nThis is a simple implementation of a circular linked-list in **C++**.\r\n\r\n## Features\r\n\r\n- Add a new node at beginning of list.\r\n- Add a new node at end of list.\r\n- Add a new node after a data.\r\n- Add a new node before a data.\r\n- Add a new node after a index.\r\n- Add a new node before a index.\r\n- Get the index of a data.\r\n- Get the data of a index.\r\n- Check if list is empty.\r\n- Check if list contains a data.\r\n- Check if list contains a index.\r\n- Get the size of list.\r\n- Print the list.\r\n- Print the list in reverse order.\r\n- Reverse the linkedlist (iterative function)\r\n- Recursive function to reverse the linkedlist.\r\n- Delete a node at beginning of list.\r\n- Delete a node at end of list.\r\n- Delete a node after a data.\r\n- Delete a node before a data.\r\n- Delete a node after a index.\r\n- Delete a node before a index.\r\n- Delete a node by data.\r\n- Delete a node by index.\r\n- Delete all nodes by data.\r\n- Delete all nodes by index.\r\n- Delete all nodes.\r\n- Delete the list.\r\n- Clear the list.\r\n- Copy the list.\r\n\r\n## Functions\r\n\r\n- `Node::Node(int data)`: Constructor for the node class.\r\n\r\n- `CircularLinkedList::CircularLinkedList()`: Constructor for the CircularLinkedList class.\r\n- `void CircularLinkedList::addFirst(int data)`: Add a new node at beginning of list.\r\n- `void CircularLinkedList::addLast(int data)`: Add a new node at end of list.\r\n- `void CircularLinkedList::addAfter(int data, int newData)`: Add a new node after a data.\r\n- `void CircularLinkedList::addBefore(int data, int newData)`: Add a new node before a data.\r\n- `void CircularLinkedList::addAfterIndex(int index, int newData)`: Add a new node after a index.\r\n- `void CircularLinkedList::addBeforeIndex(int index, int newData)`: Add a new node before a index.\r\n- `int CircularLinkedList::indexOf(int data)`: Get the index of a data.\r\n- `int CircularLinkedList::get(int index)`: Get the data of a index.\r\n- `bool CircularLinkedList::isEmpty()`: Check if list is empty.\r\n- `bool CircularLinkedList::contains(int data)`: Check if list contains a data.\r\n- `bool CircularLinkedList::containsIndex(int index)`: Check if list contains a index.\r\n- `int CircularLinkedList::getSize()`: Get the size of list.\r\n- `void CircularLinkedList::print()`: Print the list.\r\n- `void CircularLinkedList::printReverse()`: Print the list in reverse order.\r\n- `void CircularLinkedList::reverse()`: Reverse the linkedlist (iterative function)\r\n- `void CircularLinkedList::reverseRecursive(Node* current, Node* prev)`: Recursive function to reverse the linkedlist.\r\n- `CircularLinkedList* CircularLinkedList::copy()`: Copy the list.\r\n- `void removeFirst()`: Delete a node at beginning of list.\r\n- `void removeLast()`: Delete a node at end of list.\r\n- `void remove(int data)`: Delete a node by data.\r\n- `void removeIndex(int index)`: Delete a node by index.\r\n- `void CircularLinkedList::clear()`: Clear the list.\r\n\r\n© Copyright Max Base, 2022\r\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fbasemax%2Fcircularlinkedlistcpp","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fbasemax%2Fcircularlinkedlistcpp","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fbasemax%2Fcircularlinkedlistcpp/lists"}