[MIRROR] Data structures course 2024-2025 materials. https://git.syndamia.com/edu/FMI/Data-structures-and-algorithms/atom/Seminar05?h=upstream%2Fmain 2024-11-20T22:58:46Z 2024-11-20T22:58:46Z Hristo Partenov 146854527+ico12319@users.noreply.github.com 2024-11-20T22:58:46Z urn:sha1:9c60ee9f795138f85409ca302f5ee61a68746ee1 In the remove_after function, I added a check if (!it.currentElementPtr->next) because if we have a list with two elements and move an iterator to the end of the list, it will try to access to_delete->next, which would result in an error. This check also handles the case when the size is equal to 1. In the insert_after function, if we insert after the tail and then try to push_back another element, we might lose data. Therefore, if itNode == _tail, we should update _tail to point to the new node. 2024-11-12T22:20:20Z Stoycho Kyosev stoycho.kk@gmail.com 2024-11-12T22:20:20Z urn:sha1:ad40e20b8983831400502fa9617f4c842ae23b78 2024-10-06T11:04:44Z Stoycho Kyosev skyosev@192.168.100.17 2024-10-06T11:04:44Z urn:sha1:7eee5a78005a9a569186d2c8b4b645a818ab9bf1 2022-12-25T16:47:17Z Syndamia kamen@syndamia.com 2022-12-25T16:47:17Z urn:sha1:84e86c5d4cbe0215635461c5a0c08bb7c87b599e 2022-12-25T16:19:37Z Syndamia kamen@syndamia.com 2022-12-25T16:19:37Z urn:sha1:48823638dcdd59fc4ff4820393aee833208155e4 2022-11-22T21:57:23Z Stoycho Kyosev stoycho.kk@gmail.com 2022-11-22T21:57:23Z urn:sha1:8c1753a1a200cbe0c23c2178a35e1b8b8c57bf64 2022-11-12T16:37:07Z Stoycho Kyosev stoycho.kk@gmail.com 2022-11-12T16:37:07Z urn:sha1:7fbf4ea0b5679b83e637006b48ca1a287ebf3302 2022-11-12T16:35:12Z Stoycho Kyosev stoycho.kk@gmail.com 2022-11-12T16:35:12Z urn:sha1:e51e5e5fdb8fed6969aa6f608663fac9c4ac8bba 2022-11-08T23:20:01Z Stoycho Kyosev 68247567+stoychoX@users.noreply.github.com 2022-11-08T23:20:01Z urn:sha1:16a916c1fc7ecf89bfbf910445740fb4596aae8f 2022-11-06T17:24:47Z Stoycho Kyosev stoycho.kk@gmail.com 2022-11-06T17:24:47Z urn:sha1:fa1a9b5a698bbc0d282697cbc6e57f11a8ba687f