This repository contains a header-only reimplementation of std::list using the memory constructs introduced in C++11. The goals of this project is as follows:

• Have a delete-free implementation of a linked list
• Prevent use-after-free memory errors
• Prevent dangling pointers
• Prevent memory leaks

Other problems, such as null-pointer dereferencing are still very much possible and will still occur, but will be more predictable.

The safelist is designed as a drop-in replacement for std::list, so replacing it should not be a problem. Include safelist.hpp wherever you would normally include list, and change your types accordingly.

Not everything is implemented exactly as it is in std::list. Key differences are:

• Allocator is not specifiable, and is the default allocator
• Features are lacking according to what it says in Progress
• Not all typedefs are implemented
• Not all undefined behaviour works the same way. For instance, iterating past the end causes a loop back to the start.
• The move variant of merge() is missing, because there is no real benefit to it in this implementation.
• The move variant of splice() is missing for the same reason.

• Empty constructor
• Count constructor
• Range constructor
• Assignment operators
• Push back/push front
• Emplace back/emplace front
• Pop back/pop front
• Iterators
• Const iterators
• Reverse iterators
• Const reverse iterators
• Insert at iterator
• Emplace at iterator
• Delete at iterator
• Sizing
• Resizing

• Equality/inequality
• Greater than/less than

• sort
• merge
• splice
• remove (if)
• reverse
• unique

I learned about C++ smart pointers but since the main things I write code for are university assignments (not a lot of memory management in general) and programming contest submissions (no need for readable, maintainable code) so I never looked into it.

For the summer I wanted a programming challenge to do, so here it is.