v8
V8 is Google’s open source high-performance JavaScript and WebAssembly engine, written in C++.
Loading...
Searching...
No Matches
v8::internal::heap::List< T > Class Template Reference

#include <list.h>

Collaboration diagram for v8::internal::heap::List< T >:

Public Member Functions

 List ()=default
 
 List (List &&other) V8_NOEXCEPT
 
Listoperator= (List &&other) V8_NOEXCEPT
 
void PushBack (T *element)
 
void PushFront (T *element)
 
void Remove (T *element)
 
bool Contains (const T *element) const
 
bool Empty () const
 
Tfront ()
 
Tback ()
 
const Tfront () const
 
const Tback () const
 
size_t size () const
 

Private Member Functions

void AddFirstElement (T *element)
 
void InsertAfter (T *element, T *other)
 
void InsertBefore (T *element, T *other)
 

Private Attributes

Tfront_ {nullptr}
 
Tback_ {nullptr}
 
size_t size_ {0}
 

Detailed Description

template<class T>
class v8::internal::heap::List< T >

Definition at line 17 of file list.h.

Constructor & Destructor Documentation

◆ List() [1/2]

template<class T >
v8::internal::heap::List< T >::List ( )
default

◆ List() [2/2]

template<class T >
v8::internal::heap::List< T >::List ( List< T > && other)
inline

Definition at line 20 of file list.h.

Member Function Documentation

◆ AddFirstElement()

template<class T >
void v8::internal::heap::List< T >::AddFirstElement ( T * element)
inlineprivate

Definition at line 95 of file list.h.

Here is the caller graph for this function:

◆ back() [1/2]

template<class T >
T * v8::internal::heap::List< T >::back ( )
inline

Definition at line 87 of file list.h.

◆ back() [2/2]

template<class T >
const T * v8::internal::heap::List< T >::back ( ) const
inline

Definition at line 90 of file list.h.

◆ Contains()

template<class T >
bool v8::internal::heap::List< T >::Contains ( const T * element) const
inline

Definition at line 71 of file list.h.

Here is the caller graph for this function:

◆ Empty()

template<class T >
bool v8::internal::heap::List< T >::Empty ( ) const
inline

Definition at line 80 of file list.h.

◆ front() [1/2]

template<class T >
T * v8::internal::heap::List< T >::front ( )
inline

Definition at line 86 of file list.h.

◆ front() [2/2]

template<class T >
const T * v8::internal::heap::List< T >::front ( ) const
inline

Definition at line 89 of file list.h.

◆ InsertAfter()

template<class T >
void v8::internal::heap::List< T >::InsertAfter ( T * element,
T * other )
inlineprivate

Definition at line 106 of file list.h.

Here is the caller graph for this function:

◆ InsertBefore()

template<class T >
void v8::internal::heap::List< T >::InsertBefore ( T * element,
T * other )
inlineprivate

Definition at line 117 of file list.h.

Here is the caller graph for this function:

◆ operator=()

template<class T >
List & v8::internal::heap::List< T >::operator= ( List< T > && other)
inline

Definition at line 23 of file list.h.

◆ PushBack()

template<class T >
void v8::internal::heap::List< T >::PushBack ( T * element)
inline

Definition at line 30 of file list.h.

Here is the call graph for this function:

◆ PushFront()

template<class T >
void v8::internal::heap::List< T >::PushFront ( T * element)
inline

Definition at line 42 of file list.h.

Here is the call graph for this function:

◆ Remove()

template<class T >
void v8::internal::heap::List< T >::Remove ( T * element)
inline

Definition at line 54 of file list.h.

Here is the call graph for this function:

◆ size()

template<class T >
size_t v8::internal::heap::List< T >::size ( ) const
inline

Definition at line 92 of file list.h.

Member Data Documentation

◆ back_

template<class T >
T* v8::internal::heap::List< T >::back_ {nullptr}
private

Definition at line 130 of file list.h.

◆ front_

template<class T >
T* v8::internal::heap::List< T >::front_ {nullptr}
private

Definition at line 129 of file list.h.

◆ size_

template<class T >
size_t v8::internal::heap::List< T >::size_ {0}
private

Definition at line 131 of file list.h.


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