operations_research::ssmf_internal::DoubleLinkedList< T > Class Template Reference

Detailed Description

template<typename T>
class operations_research::ssmf_internal::DoubleLinkedList< T >

Definition at line 403 of file space_saving_most_frequent.h.

#include <space_saving_most_frequent.h>

Public Member Functions
	DoubleLinkedList ()=default
	DoubleLinkedList (const DoubleLinkedList &)=delete
	~DoubleLinkedList ()
bool	empty () const
bool	single () const
T *absl_nonnull	front () const
T *absl_nonnull	back () const
T *absl_nonnull	insert_after (T *absl_nonnull node, Ptr< T > new_node)
T *absl_nonnull	insert_before (T *absl_nonnull node, Ptr< T > new_node)
T *absl_nonnull	insert_front (Ptr< T > new_node)
T *absl_nonnull	insert_back (Ptr< T > new_node)
ABSL_MUST_USE_RESULT Ptr< T >	erase (T *absl_nonnull node)
ABSL_MUST_USE_RESULT Ptr< T >	pop_front ()
ABSL_MUST_USE_RESULT Ptr< T >	pop_back ()

Constructor & Destructor Documentation

DoubleLinkedList() [1/2]

template<typename T>

operations_research::ssmf_internal::DoubleLinkedList< T >::DoubleLinkedList ( )

default

DoubleLinkedList() [2/2]

template<typename T>

operations_research::ssmf_internal::DoubleLinkedList< T >::DoubleLinkedList ( const DoubleLinkedList< T > & )

delete

~DoubleLinkedList()

template<typename T>

operations_research::ssmf_internal::DoubleLinkedList< T >::~DoubleLinkedList ( )

inline

Definition at line 407 of file space_saving_most_frequent.h.

Member Function Documentation

back()

template<typename T>

T *absl_nonnull operations_research::ssmf_internal::DoubleLinkedList< T >::back ( ) const

inline

Definition at line 427 of file space_saving_most_frequent.h.

empty()

template<typename T>

bool operations_research::ssmf_internal::DoubleLinkedList< T >::empty ( ) const

inline

Definition at line 412 of file space_saving_most_frequent.h.

erase()

template<typename T>

ABSL_MUST_USE_RESULT Ptr< T > operations_research::ssmf_internal::DoubleLinkedList< T >::erase ( T *absl_nonnull node )

inline

Definition at line 480 of file space_saving_most_frequent.h.

front()

template<typename T>

T *absl_nonnull operations_research::ssmf_internal::DoubleLinkedList< T >::front ( ) const

inline

Definition at line 422 of file space_saving_most_frequent.h.

insert_after()

template<typename T>

T *absl_nonnull operations_research::ssmf_internal::DoubleLinkedList< T >::insert_after ( T *absl_nonnull node, Ptr< T > new_node )

inline

Definition at line 432 of file space_saving_most_frequent.h.

insert_back()

template<typename T>

T *absl_nonnull operations_research::ssmf_internal::DoubleLinkedList< T >::insert_back ( Ptr< T > new_node )

inline

Definition at line 472 of file space_saving_most_frequent.h.

insert_before()

template<typename T>

T *absl_nonnull operations_research::ssmf_internal::DoubleLinkedList< T >::insert_before ( T *absl_nonnull node, Ptr< T > new_node )

inline

Definition at line 446 of file space_saving_most_frequent.h.

insert_front()

template<typename T>

T *absl_nonnull operations_research::ssmf_internal::DoubleLinkedList< T >::insert_front ( Ptr< T > new_node )

inline

Definition at line 460 of file space_saving_most_frequent.h.

pop_back()

template<typename T>

ABSL_MUST_USE_RESULT Ptr< T > operations_research::ssmf_internal::DoubleLinkedList< T >::pop_back ( )

inline

Definition at line 498 of file space_saving_most_frequent.h.

pop_front()

template<typename T>

ABSL_MUST_USE_RESULT Ptr< T > operations_research::ssmf_internal::DoubleLinkedList< T >::pop_front ( )

inline

Definition at line 496 of file space_saving_most_frequent.h.

single()

template<typename T>

bool operations_research::ssmf_internal::DoubleLinkedList< T >::single ( ) const

inline

Definition at line 417 of file space_saving_most_frequent.h.

---

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

• ortools/algorithms/space_saving_most_frequent.h