Implements a doubly-linked list with an overhead of just a single pointer per element. More...

#include <ADT.hpp>

Collaboration diagram for m::doubly_linked_list< T, Allocator >:

Data Structures
struct	node_type

struct	the_iterator

Public Types
using	value_type = T

using	size_type = std::size_t

using	allocator_type = Allocator

using	reference_type = T &

using	const_reference_type = const T &

using	iterator = the_iterator< false >

using	const_iterator = the_iterator< true >

Public Member Functions
	doubly_linked_list ()

template<is_allocator A = allocator_type>
	doubly_linked_list (A &&allocator)

template<typename InputIt >
	doubly_linked_list (InputIt begin, InputIt end, allocator_type &&allocator=allocator_type())

	~doubly_linked_list ()

	doubly_linked_list (const doubly_linked_list &other)

	doubly_linked_list (doubly_linked_list &&other)

doubly_linked_list &	operator= (doubly_linked_list other)

allocator_type &	get_allocator () const noexcept

reference_type	front ()

const_reference_type	front () const

reference_type	back ()

const_reference_type	back () const

iterator	begin ()

iterator	end ()

const_iterator	begin () const

const_iterator	end () const

const_iterator	cbegin () const

const_iterator	cend () const

iterator	rbegin ()

iterator	rend ()

const_iterator	rbegin () const

const_iterator	rend () const

const_iterator	crbegin () const

const_iterator	crend () const

bool	empty () const

size_type	size () const

size_type	max_size () const

template<typename... Args>
iterator	emplace (const_iterator pos, Args &&... args)

template<typename... Args>
reference_type	emplace_back (Args &&... args)

template<typename... Args>
reference_type	emplace_front (Args &&... args)

void	push_back (const value_type &value)

void	push_back (value_type &&value)

void	push_front (const value_type &value)

void	push_front (value_type &&value)

iterator	insert (const_iterator pos, const value_type &value)

iterator	insert (const_iterator pos, value_type &&value)

iterator	insert (const_iterator pos, size_type count, const value_type &value)

template<typename InputIt , typename = decltype(*std::declval<InputIt&>(), std::declval<InputIt&>()++, void())>
iterator	insert (const_iterator pos, InputIt first, InputIt last)

iterator	insert (const_iterator pos, std::initializer_list< value_type > ilist)

iterator	erase (iterator pos)

iterator	erase (const_iterator pos)

value_type	pop_back ()

value_type	pop_front ()

void	clear ()

void	reverse ()

void	dump (std::ostream &out) const

void	dump () const

Private Member Functions
node_type *	allocate_node ()

void	deallocate_node (node_type *ptr)

Private Attributes
allocator_type	allocator_
	‍the memory allocator

node_type *	head_ = nullptr
	‍points to the first node

node_type *	tail_ = nullptr
	‍points to the last node

size_type	size_ = 0
	‍the number of elements/nodes in the list

Friends
void	swap (doubly_linked_list &first, doubly_linked_list &second)

M_LCOV_EXCL_START friend std::ostream &	operator<< (std::ostream &out, const doubly_linked_list &L)

std::string	to_string (const doubly_linked_list &L)

Detailed Description

template<typename T, is_allocator Allocator = malloc_allocator>
struct m::doubly_linked_list< T, Allocator >

Implements a doubly-linked list with an overhead of just a single pointer per element.

Definition at line 384 of file ADT.hpp.

Member Typedef Documentation

◆ allocator_type

template<typename T , is_allocator Allocator = malloc_allocator>

using m::doubly_linked_list< T, Allocator >::allocator_type = Allocator

Definition at line 388 of file ADT.hpp.

◆ const_iterator

template<typename T , is_allocator Allocator = malloc_allocator>

using m::doubly_linked_list< T, Allocator >::const_iterator = the_iterator<true>

Definition at line 463 of file ADT.hpp.

◆ const_reference_type

template<typename T , is_allocator Allocator = malloc_allocator>

using m::doubly_linked_list< T, Allocator >::const_reference_type = const T&

Definition at line 391 of file ADT.hpp.

◆ iterator

template<typename T , is_allocator Allocator = malloc_allocator>

using m::doubly_linked_list< T, Allocator >::iterator = the_iterator<false>

Definition at line 462 of file ADT.hpp.

◆ reference_type

template<typename T , is_allocator Allocator = malloc_allocator>

using m::doubly_linked_list< T, Allocator >::reference_type = T&

Definition at line 390 of file ADT.hpp.

◆ size_type

template<typename T , is_allocator Allocator = malloc_allocator>

using m::doubly_linked_list< T, Allocator >::size_type = std::size_t

Definition at line 387 of file ADT.hpp.

◆ value_type

template<typename T , is_allocator Allocator = malloc_allocator>

using m::doubly_linked_list< T, Allocator >::value_type = T

Definition at line 386 of file ADT.hpp.

Constructor & Destructor Documentation

◆ doubly_linked_list() [1/5]

template<typename T , is_allocator Allocator = malloc_allocator>

m::doubly_linked_list< T, Allocator >::doubly_linked_list ( )

inline

Definition at line 474 of file ADT.hpp.

◆ doubly_linked_list() [2/5]

template<typename T , is_allocator Allocator = malloc_allocator>

template<is_allocator A = allocator_type>

m::doubly_linked_list< T, Allocator >::doubly_linked_list ( A && allocator )

inlineexplicit

Definition at line 477 of file ADT.hpp.

◆ doubly_linked_list() [3/5]

template<typename T , is_allocator Allocator = malloc_allocator>

template<typename InputIt >

m::doubly_linked_list< T, Allocator >::doubly_linked_list	(	InputIt	begin,
		InputIt	end,
		allocator_type &&	allocator = `allocator_type()`
	)

inline

Definition at line 482 of file ADT.hpp.

References m::doubly_linked_list< T, Allocator >::begin(), m::doubly_linked_list< T, Allocator >::end(), and m::doubly_linked_list< T, Allocator >::push_back().

◆ ~doubly_linked_list()

template<typename T , is_allocator Allocator = malloc_allocator>

m::doubly_linked_list< T, Allocator >::~doubly_linked_list ( )

inline

Definition at line 489 of file ADT.hpp.

References m::doubly_linked_list< T, Allocator >::clear().

◆ doubly_linked_list() [4/5]

template<typename T , is_allocator Allocator = malloc_allocator>

m::doubly_linked_list< T, Allocator >::doubly_linked_list ( const doubly_linked_list< T, Allocator > & other )

inlineexplicit

Definition at line 491 of file ADT.hpp.

References m::doubly_linked_list< T, Allocator >::begin(), m::doubly_linked_list< T, Allocator >::cbegin(), m::doubly_linked_list< T, Allocator >::cend(), and m::doubly_linked_list< T, Allocator >::insert().

◆ doubly_linked_list() [5/5]

template<typename T , is_allocator Allocator = malloc_allocator>

m::doubly_linked_list< T, Allocator >::doubly_linked_list ( doubly_linked_list< T, Allocator > && other )

inline

Definition at line 495 of file ADT.hpp.

References m::doubly_linked_list< T, Allocator >::swap.

Member Function Documentation

◆ allocate_node()

template<typename T , is_allocator Allocator = malloc_allocator>

node_type * m::doubly_linked_list< T, Allocator >::allocate_node ( )

inlineprivate

Definition at line 660 of file ADT.hpp.

References m::doubly_linked_list< T, Allocator >::allocator_.

Referenced by m::doubly_linked_list< T, Allocator >::emplace().

◆ back() [1/2]

template<typename T , is_allocator Allocator = malloc_allocator>

reference_type m::doubly_linked_list< T, Allocator >::back ( )

inline

Definition at line 504 of file ADT.hpp.

References M_insist, m::doubly_linked_list< T, Allocator >::tail_, and m::doubly_linked_list< T, Allocator >::node_type::value_.

◆ back() [2/2]

template<typename T , is_allocator Allocator = malloc_allocator>

const_reference_type m::doubly_linked_list< T, Allocator >::back ( ) const

inline

Definition at line 505 of file ADT.hpp.

References M_insist, m::doubly_linked_list< T, Allocator >::tail_, and m::doubly_linked_list< T, Allocator >::node_type::value_.

◆ begin() [1/2]

template<typename T , is_allocator Allocator = malloc_allocator>

iterator m::doubly_linked_list< T, Allocator >::begin ( )

inline

Definition at line 508 of file ADT.hpp.

References m::doubly_linked_list< T, Allocator >::head_.

Referenced by m::list_allocator::allocate(), m::doubly_linked_list< T, Allocator >::cbegin(), m::doubly_linked_list< T, Allocator >::doubly_linked_list(), m::doubly_linked_list< T, Allocator >::emplace_front(), m::doubly_linked_list< T, Allocator >::insert(), m::list_allocator::insert_chunk_sorted(), m::doubly_linked_list< T, Allocator >::pop_front(), m::list_allocator::reclaim_chunk(), and m::list_allocator::~list_allocator().

◆ begin() [2/2]

template<typename T , is_allocator Allocator = malloc_allocator>

const_iterator m::doubly_linked_list< T, Allocator >::begin ( ) const

inline

Definition at line 510 of file ADT.hpp.

References m::doubly_linked_list< T, Allocator >::head_.

◆ cbegin()

template<typename T , is_allocator Allocator = malloc_allocator>

const_iterator m::doubly_linked_list< T, Allocator >::cbegin ( ) const

inline

Definition at line 512 of file ADT.hpp.

References m::doubly_linked_list< T, Allocator >::begin().

Referenced by m::doubly_linked_list< T, Allocator >::doubly_linked_list().

◆ cend()

template<typename T , is_allocator Allocator = malloc_allocator>

const_iterator m::doubly_linked_list< T, Allocator >::cend ( ) const

inline

Definition at line 513 of file ADT.hpp.

References m::doubly_linked_list< T, Allocator >::end().

Referenced by m::doubly_linked_list< T, Allocator >::doubly_linked_list().

◆ clear()

template<typename T , is_allocator Allocator = malloc_allocator>

void m::doubly_linked_list< T, Allocator >::clear ( )

inline

Definition at line 627 of file ADT.hpp.

References m::doubly_linked_list< T, Allocator >::head_, M_insist, m::doubly_linked_list< T, Allocator >::pop_front(), and m::doubly_linked_list< T, Allocator >::size_.

Referenced by m::doubly_linked_list< T, Allocator >::~doubly_linked_list().

◆ crbegin()

template<typename T , is_allocator Allocator = malloc_allocator>

const_iterator m::doubly_linked_list< T, Allocator >::crbegin ( ) const

inline

Definition at line 519 of file ADT.hpp.

References m::doubly_linked_list< T, Allocator >::rbegin().

◆ crend()

template<typename T , is_allocator Allocator = malloc_allocator>

const_iterator m::doubly_linked_list< T, Allocator >::crend ( ) const

inline

Definition at line 520 of file ADT.hpp.

References m::doubly_linked_list< T, Allocator >::rend().

◆ deallocate_node()

template<typename T , is_allocator Allocator = malloc_allocator>

void m::doubly_linked_list< T, Allocator >::deallocate_node ( node_type * ptr )

inlineprivate

Definition at line 661 of file ADT.hpp.

References m::doubly_linked_list< T, Allocator >::allocator_.

Referenced by m::doubly_linked_list< T, Allocator >::erase().

◆ dump() [1/2]

template<typename T , is_allocator Allocator = malloc_allocator>

void m::doubly_linked_list< T, Allocator >::dump ( ) const

inline

Definition at line 656 of file ADT.hpp.

References m::doubly_linked_list< T, Allocator >::dump().

Referenced by m::doubly_linked_list< T, Allocator >::dump().

◆ dump() [2/2]

template<typename T , is_allocator Allocator = malloc_allocator>

void m::doubly_linked_list< T, Allocator >::dump ( std::ostream & out ) const

inline

Definition at line 655 of file ADT.hpp.

◆ emplace()

template<typename T , is_allocator Allocator = malloc_allocator>

template<typename... Args>

iterator m::doubly_linked_list< T, Allocator >::emplace	(	const_iterator	pos,
		Args &&...	args
	)

inline

Definition at line 529 of file ADT.hpp.

References m::doubly_linked_list< T, Allocator >::allocate_node(), args, m::doubly_linked_list< T, Allocator >::head_, m::doubly_linked_list< T, Allocator >::the_iterator< C >::node_, m::doubly_linked_list< T, Allocator >::the_iterator< C >::prev_, m::doubly_linked_list< T, Allocator >::node_type::ptrxor_, m::doubly_linked_list< T, Allocator >::size_, m::doubly_linked_list< T, Allocator >::tail_, and m::doubly_linked_list< T, Allocator >::node_type::value_.

Referenced by m::doubly_linked_list< T, Allocator >::emplace_back(), m::doubly_linked_list< T, Allocator >::emplace_front(), and m::doubly_linked_list< T, Allocator >::insert().

◆ emplace_back()

template<typename T , is_allocator Allocator = malloc_allocator>

template<typename... Args>

reference_type m::doubly_linked_list< T, Allocator >::emplace_back ( Args &&... args )

inline

Definition at line 549 of file ADT.hpp.

References args, m::doubly_linked_list< T, Allocator >::emplace(), and m::doubly_linked_list< T, Allocator >::end().

Referenced by m::doubly_linked_list< T, Allocator >::push_back().

◆ emplace_front()

template<typename T , is_allocator Allocator = malloc_allocator>

template<typename... Args>

reference_type m::doubly_linked_list< T, Allocator >::emplace_front ( Args &&... args )

inline

Definition at line 555 of file ADT.hpp.

References args, m::doubly_linked_list< T, Allocator >::begin(), and m::doubly_linked_list< T, Allocator >::emplace().

Referenced by m::doubly_linked_list< T, Allocator >::push_front().

◆ empty()

template<typename T , is_allocator Allocator = malloc_allocator>

bool m::doubly_linked_list< T, Allocator >::empty ( ) const

inline

Definition at line 523 of file ADT.hpp.

References m::doubly_linked_list< T, Allocator >::size_.

Referenced by m::list_allocator::list_allocator(), and m::list_allocator::~list_allocator().

◆ end() [1/2]

template<typename T , is_allocator Allocator = malloc_allocator>

iterator m::doubly_linked_list< T, Allocator >::end ( )

inline

Definition at line 509 of file ADT.hpp.

References m::doubly_linked_list< T, Allocator >::tail_.

Referenced by m::list_allocator::allocate(), m::doubly_linked_list< T, Allocator >::cend(), m::list_allocator::coalesce(), m::doubly_linked_list< T, Allocator >::doubly_linked_list(), m::doubly_linked_list< T, Allocator >::emplace_back(), m::doubly_linked_list< T, Allocator >::insert(), m::list_allocator::insert_chunk_sorted(), m::list_allocator::link_chunk(), and m::list_allocator::reclaim_chunk().

◆ end() [2/2]

template<typename T , is_allocator Allocator = malloc_allocator>

const_iterator m::doubly_linked_list< T, Allocator >::end ( ) const

inline

Definition at line 511 of file ADT.hpp.

References m::doubly_linked_list< T, Allocator >::tail_.

◆ erase() [1/2]

template<typename T , is_allocator Allocator = malloc_allocator>

iterator m::doubly_linked_list< T, Allocator >::erase ( const_iterator pos )

inline

Definition at line 609 of file ADT.hpp.

References m::doubly_linked_list< T, Allocator >::erase(), m::doubly_linked_list< T, Allocator >::the_iterator< C >::node_, and m::doubly_linked_list< T, Allocator >::the_iterator< C >::prev_.

Referenced by m::doubly_linked_list< T, Allocator >::erase().

◆ erase() [2/2]

template<typename T , is_allocator Allocator = malloc_allocator>

iterator m::doubly_linked_list< T, Allocator >::erase ( iterator pos )

inline

Definition at line 591 of file ADT.hpp.

References m::doubly_linked_list< T, Allocator >::deallocate_node(), m::doubly_linked_list< T, Allocator >::head_, M_insist, m::doubly_linked_list< T, Allocator >::the_iterator< C >::node_, m::doubly_linked_list< T, Allocator >::the_iterator< C >::prev_, m::doubly_linked_list< T, Allocator >::node_type::ptrxor_, m::doubly_linked_list< T, Allocator >::size_, and m::doubly_linked_list< T, Allocator >::tail_.

Referenced by m::doubly_linked_list< T, Allocator >::pop_front(), m::list_allocator::unlink_chunk(), and m::list_allocator::~list_allocator().

◆ front() [1/2]

template<typename T , is_allocator Allocator = malloc_allocator>

reference_type m::doubly_linked_list< T, Allocator >::front ( )

inline

Definition at line 502 of file ADT.hpp.

References m::doubly_linked_list< T, Allocator >::head_, M_insist, and m::doubly_linked_list< T, Allocator >::node_type::value_.

◆ front() [2/2]

template<typename T , is_allocator Allocator = malloc_allocator>

const_reference_type m::doubly_linked_list< T, Allocator >::front ( ) const

inline

Definition at line 503 of file ADT.hpp.

References m::doubly_linked_list< T, Allocator >::head_, M_insist, and m::doubly_linked_list< T, Allocator >::node_type::value_.

◆ get_allocator()

template<typename T , is_allocator Allocator = malloc_allocator>

allocator_type & m::doubly_linked_list< T, Allocator >::get_allocator ( ) const

inlinenoexcept

Definition at line 499 of file ADT.hpp.

References m::doubly_linked_list< T, Allocator >::allocator_.

◆ insert() [1/5]

template<typename T , is_allocator Allocator = malloc_allocator>

iterator m::doubly_linked_list< T, Allocator >::insert	(	const_iterator	pos,
		const value_type &	value
	)

inline

Definition at line 565 of file ADT.hpp.

References m::doubly_linked_list< T, Allocator >::emplace().

Referenced by m::doubly_linked_list< T, Allocator >::doubly_linked_list(), m::doubly_linked_list< T, Allocator >::insert(), and m::list_allocator::link_chunk().

◆ insert() [2/5]

template<typename T , is_allocator Allocator = malloc_allocator>

template<typename InputIt , typename = decltype(*std::declval<InputIt&>(), std::declval<InputIt&>()++, void())>

iterator m::doubly_linked_list< T, Allocator >::insert	(	const_iterator	pos,
		InputIt	first,
		InputIt	last
	)

inline

Definition at line 575 of file ADT.hpp.

References m::doubly_linked_list< T, Allocator >::begin(), m::doubly_linked_list< T, Allocator >::end(), m::doubly_linked_list< T, Allocator >::insert(), M_insist, m::doubly_linked_list< T, Allocator >::the_iterator< C >::node_, and m::doubly_linked_list< T, Allocator >::the_iterator< C >::prev_.

◆ insert() [3/5]

template<typename T , is_allocator Allocator = malloc_allocator>

iterator m::doubly_linked_list< T, Allocator >::insert	(	const_iterator	pos,
		size_type	count,
		const value_type &	value
	)

inline

Definition at line 567 of file ADT.hpp.

References m::doubly_linked_list< T, Allocator >::insert(), m::doubly_linked_list< T, Allocator >::the_iterator< C >::node_, and m::doubly_linked_list< T, Allocator >::the_iterator< C >::prev_.

◆ insert() [4/5]

template<typename T , is_allocator Allocator = malloc_allocator>

iterator m::doubly_linked_list< T, Allocator >::insert	(	const_iterator	pos,
		std::initializer_list< value_type >	ilist
	)

inline

Definition at line 587 of file ADT.hpp.

References m::doubly_linked_list< T, Allocator >::insert().

◆ insert() [5/5]

template<typename T , is_allocator Allocator = malloc_allocator>

iterator m::doubly_linked_list< T, Allocator >::insert	(	const_iterator	pos,
		value_type &&	value
	)

inline

Definition at line 566 of file ADT.hpp.

References m::doubly_linked_list< T, Allocator >::emplace().

◆ max_size()

template<typename T , is_allocator Allocator = malloc_allocator>

size_type m::doubly_linked_list< T, Allocator >::max_size ( ) const

inline

Definition at line 525 of file ADT.hpp.

◆ operator=()

template<typename T , is_allocator Allocator = malloc_allocator>

doubly_linked_list & m::doubly_linked_list< T, Allocator >::operator= ( doubly_linked_list< T, Allocator > other )

inline

Definition at line 497 of file ADT.hpp.

References m::doubly_linked_list< T, Allocator >::swap.

◆ pop_back()

template<typename T , is_allocator Allocator = malloc_allocator>

value_type m::doubly_linked_list< T, Allocator >::pop_back ( )

inline

Definition at line 611 of file ADT.hpp.

References m::doubly_linked_list< T, Allocator >::pop_front(), and m::doubly_linked_list< T, Allocator >::reverse().

◆ pop_front()

template<typename T , is_allocator Allocator = malloc_allocator>

value_type m::doubly_linked_list< T, Allocator >::pop_front ( )

inline

Definition at line 618 of file ADT.hpp.

References m::doubly_linked_list< T, Allocator >::begin(), m::doubly_linked_list< T, Allocator >::erase(), m::doubly_linked_list< T, Allocator >::head_, M_insist, m::doubly_linked_list< T, Allocator >::size_, m::doubly_linked_list< T, Allocator >::tail_, and m::doubly_linked_list< T, Allocator >::node_type::value_.

Referenced by m::doubly_linked_list< T, Allocator >::clear(), and m::doubly_linked_list< T, Allocator >::pop_back().

◆ push_back() [1/2]

template<typename T , is_allocator Allocator = malloc_allocator>

void m::doubly_linked_list< T, Allocator >::push_back ( const value_type & value )

inline

Definition at line 560 of file ADT.hpp.

References m::doubly_linked_list< T, Allocator >::emplace_back().

Referenced by m::doubly_linked_list< T, Allocator >::doubly_linked_list().

◆ push_back() [2/2]

template<typename T , is_allocator Allocator = malloc_allocator>

void m::doubly_linked_list< T, Allocator >::push_back ( value_type && value )

inline

Definition at line 561 of file ADT.hpp.

References m::doubly_linked_list< T, Allocator >::emplace_back().

◆ push_front() [1/2]

template<typename T , is_allocator Allocator = malloc_allocator>

void m::doubly_linked_list< T, Allocator >::push_front ( const value_type & value )

inline

Definition at line 562 of file ADT.hpp.

References m::doubly_linked_list< T, Allocator >::emplace_front().

◆ push_front() [2/2]

template<typename T , is_allocator Allocator = malloc_allocator>

void m::doubly_linked_list< T, Allocator >::push_front ( value_type && value )

inline

Definition at line 563 of file ADT.hpp.

References m::doubly_linked_list< T, Allocator >::emplace_front().

◆ rbegin() [1/2]

template<typename T , is_allocator Allocator = malloc_allocator>

iterator m::doubly_linked_list< T, Allocator >::rbegin ( )

inline

Definition at line 515 of file ADT.hpp.

References m::doubly_linked_list< T, Allocator >::tail_.

Referenced by m::doubly_linked_list< T, Allocator >::crbegin().

◆ rbegin() [2/2]

template<typename T , is_allocator Allocator = malloc_allocator>

const_iterator m::doubly_linked_list< T, Allocator >::rbegin ( ) const

inline

Definition at line 517 of file ADT.hpp.

References m::doubly_linked_list< T, Allocator >::tail_.

◆ rend() [1/2]

template<typename T , is_allocator Allocator = malloc_allocator>

iterator m::doubly_linked_list< T, Allocator >::rend ( )

inline

Definition at line 516 of file ADT.hpp.

References m::doubly_linked_list< T, Allocator >::head_.

Referenced by m::doubly_linked_list< T, Allocator >::crend().

◆ rend() [2/2]

template<typename T , is_allocator Allocator = malloc_allocator>

const_iterator m::doubly_linked_list< T, Allocator >::rend ( ) const

inline

Definition at line 518 of file ADT.hpp.

References m::doubly_linked_list< T, Allocator >::head_.

◆ reverse()

template<typename T , is_allocator Allocator = malloc_allocator>

void m::doubly_linked_list< T, Allocator >::reverse ( )

inline

Definition at line 630 of file ADT.hpp.

References m::doubly_linked_list< T, Allocator >::head_, and m::doubly_linked_list< T, Allocator >::tail_.

Referenced by m::doubly_linked_list< T, Allocator >::pop_back().

◆ size()

template<typename T , is_allocator Allocator = malloc_allocator>

size_type m::doubly_linked_list< T, Allocator >::size ( ) const

inline

Definition at line 524 of file ADT.hpp.

References m::doubly_linked_list< T, Allocator >::size_.

Referenced by m::list_allocator::list_allocator(), and m::list_allocator::num_chunks_available().

Friends And Related Function Documentation

◆ operator<<

template<typename T , is_allocator Allocator = malloc_allocator>

M_LCOV_EXCL_START friend std::ostream & operator<<	(	std::ostream &	out,
		const doubly_linked_list< T, Allocator > &	L
	)

friend

Definition at line 634 of file ADT.hpp.

◆ swap

template<typename T , is_allocator Allocator = malloc_allocator>

void swap	(	doubly_linked_list< T, Allocator > &	first,
		doubly_linked_list< T, Allocator > &	second
	)

friend

Definition at line 465 of file ADT.hpp.

Referenced by m::doubly_linked_list< T, Allocator >::doubly_linked_list(), and m::doubly_linked_list< T, Allocator >::operator=().

◆ to_string

template<typename T , is_allocator Allocator = malloc_allocator>

std::string to_string ( const doubly_linked_list< T, Allocator > & L )

friend

Definition at line 649 of file ADT.hpp.

Field Documentation

◆ allocator_

template<typename T , is_allocator Allocator = malloc_allocator>

allocator_type m::doubly_linked_list< T, Allocator >::allocator_

mutableprivate

‍the memory allocator

Definition at line 401 of file ADT.hpp.

Referenced by m::doubly_linked_list< T, Allocator >::allocate_node(), m::doubly_linked_list< T, Allocator >::deallocate_node(), and m::doubly_linked_list< T, Allocator >::get_allocator().

◆ head_

template<typename T , is_allocator Allocator = malloc_allocator>

node_type* m::doubly_linked_list< T, Allocator >::head_ = nullptr

private

‍points to the first node

Definition at line 404 of file ADT.hpp.

Referenced by m::doubly_linked_list< T, Allocator >::begin(), m::doubly_linked_list< T, Allocator >::clear(), m::doubly_linked_list< T, Allocator >::emplace(), m::doubly_linked_list< T, Allocator >::erase(), m::doubly_linked_list< T, Allocator >::front(), m::doubly_linked_list< T, Allocator >::pop_front(), m::doubly_linked_list< T, Allocator >::rend(), and m::doubly_linked_list< T, Allocator >::reverse().

◆ size_

template<typename T , is_allocator Allocator = malloc_allocator>

size_type m::doubly_linked_list< T, Allocator >::size_ = 0

private

‍the number of elements/nodes in the list

Definition at line 408 of file ADT.hpp.

Referenced by m::doubly_linked_list< T, Allocator >::clear(), m::doubly_linked_list< T, Allocator >::emplace(), m::doubly_linked_list< T, Allocator >::empty(), m::doubly_linked_list< T, Allocator >::erase(), m::doubly_linked_list< T, Allocator >::pop_front(), and m::doubly_linked_list< T, Allocator >::size().

◆ tail_

template<typename T , is_allocator Allocator = malloc_allocator>

node_type* m::doubly_linked_list< T, Allocator >::tail_ = nullptr

private

‍points to the last node

Definition at line 406 of file ADT.hpp.

Referenced by m::doubly_linked_list< T, Allocator >::back(), m::doubly_linked_list< T, Allocator >::emplace(), m::doubly_linked_list< T, Allocator >::end(), m::doubly_linked_list< T, Allocator >::erase(), m::doubly_linked_list< T, Allocator >::pop_front(), m::doubly_linked_list< T, Allocator >::rbegin(), and m::doubly_linked_list< T, Allocator >::reverse().

The documentation for this struct was generated from the following file:

include/mutable/util/ADT.hpp

Data Structures

Public Types

Public Member Functions

Private Member Functions

Private Attributes

Friends

Detailed Description

Member Typedef Documentation

◆ allocator_type

◆ const_iterator

◆ const_reference_type

◆ iterator

◆ reference_type

◆ size_type

◆ value_type

Constructor & Destructor Documentation

◆ doubly_linked_list() [1/5]

◆ doubly_linked_list() [2/5]

◆ doubly_linked_list() [3/5]

◆ ~doubly_linked_list()

◆ doubly_linked_list() [4/5]

◆ doubly_linked_list() [5/5]

Member Function Documentation

◆ allocate_node()

◆ back() [1/2]

◆ back() [2/2]

◆ begin() [1/2]

◆ begin() [2/2]

◆ cbegin()

◆ cend()

◆ clear()

◆ crbegin()

◆ crend()

◆ deallocate_node()

◆ dump() [1/2]

◆ dump() [2/2]

◆ emplace()

◆ emplace_back()

◆ emplace_front()

◆ empty()

◆ end() [1/2]

◆ end() [2/2]

◆ erase() [1/2]

◆ erase() [2/2]

◆ front() [1/2]

◆ front() [2/2]

◆ get_allocator()

◆ insert() [1/5]

◆ insert() [2/5]

◆ insert() [3/5]

◆ insert() [4/5]

◆ insert() [5/5]

◆ max_size()

◆ operator=()

◆ pop_back()

◆ pop_front()

◆ push_back() [1/2]

◆ push_back() [2/2]

◆ push_front() [1/2]

◆ push_front() [2/2]

◆ rbegin() [1/2]

◆ rbegin() [2/2]

◆ rend() [1/2]

◆ rend() [2/2]

◆ reverse()

◆ size()

Friends And Related Function Documentation

◆ operator<<

◆ swap

◆ to_string

Field Documentation

◆ allocator_

◆ head_

◆ size_

◆ tail_