linked_list.h File Reference

#include "di/container/algorithm/compare.h"
#include "di/container/algorithm/equal.h"
#include "di/container/allocator/allocate_one.h"
#include "di/container/allocator/allocator.h"
#include "di/container/allocator/deallocate_one.h"
#include "di/container/allocator/fallible_allocator.h"
#include "di/container/allocator/infallible_allocator.h"
#include "di/container/concepts/prelude.h"
#include "di/container/intrusive/prelude.h"
#include "di/container/iterator/prelude.h"
#include "di/container/meta/prelude.h"
#include "di/math/numeric_limits.h"
#include "di/platform/prelude.h"
#include "di/util/exchange.h"
#include "di/util/reference_wrapper.h"
#include "di/vocab/expected/prelude.h"
#include "di/vocab/optional/prelude.h"

Go to the source code of this file.

Classes
struct	di::container::detail::LinkedListNode< T >
struct	di::container::detail::LinkedListTag< T >
class	di::container::LinkedList< T, Alloc >
class	di::LinkedList< T, Alloc >

Namespaces
namespace	di
namespace	di::container
namespace	di::container::detail

Functions
template<concepts::InputContainer Con, typename T = meta::ContainerValue<Con>>
auto	di::container::tag_invoke (types::Tag< util::deduce_create >, InPlaceTemplate< LinkedList >, Con &&) -> LinkedList< T >