#include <RandomAccessContainer.h>

Inheritance diagram for dyno::RandomAccessContainer< T >:

Collaboration diagram for dyno::RandomAccessContainer< T >:

Public Types
typedef T	value_type

typedef T *	pointer

typedef const T *	const_pointer

typedef T &	reference

typedef const T &	const_reference

typedef T *	iterator

typedef const T *	const_iterator

typedef long long	difference_type

typedef uint	size_type

Public Types inherited from dyno::STLBuffer< T >
using	iterator = T *

Public Member Functions
DYN_FUNC	RandomAccessContainer ()=default

DYN_FUNC	RandomAccessContainer (const this_type &c)

DYN_FUNC	~RandomAccessContainer ()

DYN_FUNC void	assign (size_type n, const value_type &value)

template<typename InputIterator>
DYN_FUNC void	assign (InputIterator first, InputIterator last)

DYN_FUNC iterator	begin () noexcept

DYN_FUNC const_iterator	begin () const noexcept

DYN_FUNC iterator	end () noexcept

DYN_FUNC const_iterator	end () const noexcept

DYN_FUNC bool	empty () const noexcept

DYN_FUNC size_type	size () const noexcept

DYN_FUNC size_type	capacity () const noexcept

DYN_FUNC void	resize (size_type n)

DYN_FUNC void	reserve (iterator beg, size_type buffer_size)

DYN_FUNC void	reserve (iterator beg, iterator end, size_type buffer_size=0)

DYN_FUNC pointer	data () noexcept

DYN_FUNC const_pointer	data () const noexcept

DYN_FUNC reference	operator[] (size_type n)

DYN_FUNC const_reference	operator[] (size_type n) const

DYN_FUNC reference	at (size_type n)

DYN_FUNC const_reference	at (size_type n) const

DYN_FUNC reference	front ()

DYN_FUNC const_reference	front () const

DYN_FUNC reference	back ()

DYN_FUNC const_reference	back () const

DYN_FUNC void	push_back (const value_type &value)

DYN_FUNC void	push_back (value_type &&value)

DYN_FUNC reference	push_back ()

DYN_FUNC void	pop_back ()

DYN_FUNC iterator	find (iterator first, iterator last, const value_type &value)

template<typename Predicate = dyno::predicate<value_type>>
DYN_FUNC iterator	find (iterator first, iterator last, const value_type &value, Predicate pre)

DYN_FUNC iterator	insert (const_iterator position, const value_type &value)

DYN_FUNC iterator	insert (const_iterator position, size_type n, const value_type &value)

DYN_FUNC iterator	insert (const_iterator position, value_type &&value)

template<typename InputIterator>
DYN_FUNC iterator	insert (const_iterator position, InputIterator first, InputIterator last)

DYN_FUNC iterator	erase_first (const T &value)

DYN_FUNC iterator	erase_first_unsorted (const T &value)

DYN_FUNC iterator	erase (const_iterator position)

DYN_FUNC iterator	erase (const_iterator first, const_iterator last)

DYN_FUNC iterator	erase_unsorted (const_iterator position)

DYN_FUNC void	clear () noexcept

Public Member Functions inherited from dyno::STLBuffer< T >
DYN_FUNC	STLBuffer ()

DYN_FUNC void	reserve (T *beg, uint buffer_size)

DYN_FUNC uint	max_size ()

Private Types
typedef STLBuffer< T >	base_type

typedef RandomAccessContainer< T >	this_type

Private Attributes
size_type	m_size = 0

iterator	m_bufferEnd = nullptr

iterator	m_End = nullptr

iterator	m_Begin = nullptr

Additional Inherited Members
Protected Member Functions inherited from dyno::STLBuffer< T >
DYN_FUNC T *	bufferEnd ()

Protected Attributes inherited from dyno::STLBuffer< T >
uint	m_maxSize = 0

T *	m_startLoc = nullptr

Detailed Description

template<typename T>
class dyno::RandomAccessContainer< T >

Definition at line 57 of file RandomAccessContainer.h.

Member Typedef Documentation

◆ base_type

template<typename T>

typedef STLBuffer<T> dyno::RandomAccessContainer< T >::base_type

private

Definition at line 59 of file RandomAccessContainer.h.

◆ const_iterator

template<typename T>

typedef const T* dyno::RandomAccessContainer< T >::const_iterator

Definition at line 69 of file RandomAccessContainer.h.

◆ const_pointer

template<typename T>

typedef const T* dyno::RandomAccessContainer< T >::const_pointer

Definition at line 65 of file RandomAccessContainer.h.

◆ const_reference

template<typename T>

typedef const T& dyno::RandomAccessContainer< T >::const_reference

Definition at line 67 of file RandomAccessContainer.h.

◆ difference_type

template<typename T>

typedef long long dyno::RandomAccessContainer< T >::difference_type

Definition at line 70 of file RandomAccessContainer.h.

◆ iterator

template<typename T>

typedef T* dyno::RandomAccessContainer< T >::iterator

Definition at line 68 of file RandomAccessContainer.h.

◆ pointer

template<typename T>

typedef T* dyno::RandomAccessContainer< T >::pointer

Definition at line 64 of file RandomAccessContainer.h.

◆ reference

template<typename T>

typedef T& dyno::RandomAccessContainer< T >::reference

Definition at line 66 of file RandomAccessContainer.h.

◆ size_type

template<typename T>

typedef uint dyno::RandomAccessContainer< T >::size_type

Definition at line 71 of file RandomAccessContainer.h.

◆ this_type

template<typename T>

typedef RandomAccessContainer<T> dyno::RandomAccessContainer< T >::this_type

private

Definition at line 60 of file RandomAccessContainer.h.

◆ value_type

template<typename T>

typedef T dyno::RandomAccessContainer< T >::value_type

Definition at line 63 of file RandomAccessContainer.h.

Constructor & Destructor Documentation

◆ RandomAccessContainer() [1/2]

template<typename T>

DYN_FUNC dyno::RandomAccessContainer< T >::RandomAccessContainer ( )

default

◆ RandomAccessContainer() [2/2]

template<typename T>

DYN_FUNC dyno::RandomAccessContainer< T >::RandomAccessContainer ( const this_type & c )

inline

Definition at line 76 of file RandomAccessContainer.h.

Here is the call graph for this function:

◆ ~RandomAccessContainer()

template<typename T>

DYN_FUNC dyno::RandomAccessContainer< T >::~RandomAccessContainer ( )

inline

Definition at line 84 of file RandomAccessContainer.h.

Member Function Documentation

◆ assign() [1/2]

template<typename T>

template<typename InputIterator>

DYN_FUNC void dyno::RandomAccessContainer< T >::assign	(	InputIterator	first,
		InputIterator	last )

Definition at line 6 of file RandomAccessContainer.inl.

Here is the call graph for this function:

◆ assign() [2/2]

template<typename T>

DYN_FUNC void dyno::RandomAccessContainer< T >::assign	(	size_type	n,
		const value_type &	value )

Definition at line 24 of file RandomAccessContainer.inl.

Here is the call graph for this function:

◆ at() [1/2]

template<typename T>

DYN_FUNC RandomAccessContainer< T >::reference dyno::RandomAccessContainer< T >::at ( size_type n )

inline

Definition at line 97 of file RandomAccessContainer.inl.

Here is the call graph for this function:

◆ at() [2/2]

template<typename T>

DYN_FUNC RandomAccessContainer< T >::const_reference dyno::RandomAccessContainer< T >::at ( size_type n ) const

inline

Definition at line 104 of file RandomAccessContainer.inl.

Here is the call graph for this function:

◆ back() [1/2]

template<typename T>

DYN_FUNC RandomAccessContainer< T >::reference dyno::RandomAccessContainer< T >::back ( )

inline

Definition at line 127 of file RandomAccessContainer.inl.

Here is the call graph for this function:

◆ back() [2/2]

template<typename T>

DYN_FUNC RandomAccessContainer< T >::const_reference dyno::RandomAccessContainer< T >::back ( ) const

inline

Definition at line 134 of file RandomAccessContainer.inl.

Here is the call graph for this function:

◆ begin() [1/2]

template<typename T>

DYN_FUNC const_iterator dyno::RandomAccessContainer< T >::begin ( ) const

inlinenoexcept

Definition at line 97 of file RandomAccessContainer.h.

◆ begin() [2/2]

template<typename T>

DYN_FUNC iterator dyno::RandomAccessContainer< T >::begin ( )

inlinenoexcept

Definition at line 96 of file RandomAccessContainer.h.

Here is the caller graph for this function:

◆ capacity()

template<typename T>

DYN_FUNC size_type dyno::RandomAccessContainer< T >::capacity ( ) const

inlinenoexcept

Definition at line 104 of file RandomAccessContainer.h.

◆ clear()

template<typename T>

DYN_FUNC void dyno::RandomAccessContainer< T >::clear ( )

noexcept

Definition at line 345 of file RandomAccessContainer.inl.

Here is the call graph for this function:

◆ data() [1/2]

template<typename T>

DYN_FUNC const_pointer dyno::RandomAccessContainer< T >::data ( ) const

inlinenoexcept

Definition at line 112 of file RandomAccessContainer.h.

◆ data() [2/2]

template<typename T>

DYN_FUNC pointer dyno::RandomAccessContainer< T >::data ( )

inlinenoexcept

Definition at line 111 of file RandomAccessContainer.h.

◆ empty()

template<typename T>

DYN_FUNC bool dyno::RandomAccessContainer< T >::empty ( ) const

inlinenoexcept

Definition at line 102 of file RandomAccessContainer.h.

Here is the caller graph for this function:

◆ end() [1/2]

template<typename T>

DYN_FUNC const_iterator dyno::RandomAccessContainer< T >::end ( ) const

inlinenoexcept

Definition at line 100 of file RandomAccessContainer.h.

◆ end() [2/2]

template<typename T>

DYN_FUNC iterator dyno::RandomAccessContainer< T >::end ( )

inlinenoexcept

Definition at line 99 of file RandomAccessContainer.h.

Here is the caller graph for this function:

◆ erase() [1/2]

template<typename T>

DYN_FUNC RandomAccessContainer< T >::iterator dyno::RandomAccessContainer< T >::erase	(	const_iterator	first,
		const_iterator	last )

Definition at line 317 of file RandomAccessContainer.inl.

Here is the call graph for this function:

◆ erase() [2/2]

template<typename T>

DYN_FUNC RandomAccessContainer< T >::iterator dyno::RandomAccessContainer< T >::erase ( const_iterator position )

Definition at line 303 of file RandomAccessContainer.inl.

Here is the call graph for this function:

Here is the caller graph for this function:

◆ erase_first()

template<typename T>

DYN_FUNC RandomAccessContainer< T >::iterator dyno::RandomAccessContainer< T >::erase_first ( const T & value )

Definition at line 281 of file RandomAccessContainer.inl.

Here is the call graph for this function:

◆ erase_first_unsorted()

template<typename T>

DYN_FUNC RandomAccessContainer< T >::iterator dyno::RandomAccessContainer< T >::erase_first_unsorted ( const T & value )

Definition at line 292 of file RandomAccessContainer.inl.

Here is the call graph for this function:

◆ erase_unsorted()

template<typename T>

DYN_FUNC RandomAccessContainer< T >::iterator dyno::RandomAccessContainer< T >::erase_unsorted ( const_iterator position )

Definition at line 335 of file RandomAccessContainer.inl.

Here is the call graph for this function:

Here is the caller graph for this function:

◆ find() [1/2]

template<typename T>

DYN_FUNC RandomAccessContainer< T >::iterator dyno::RandomAccessContainer< T >::find	(	iterator	first,
		iterator	last,
		const value_type &	value )

inline

Definition at line 264 of file RandomAccessContainer.inl.

Here is the caller graph for this function:

◆ find() [2/2]

template<typename T>

template<typename Predicate>

DYN_FUNC RandomAccessContainer< T >::iterator dyno::RandomAccessContainer< T >::find	(	iterator	first,
		iterator	last,
		const value_type &	value,
		Predicate	pre )

inline

Definition at line 273 of file RandomAccessContainer.inl.

◆ front() [1/2]

template<typename T>

DYN_FUNC RandomAccessContainer< T >::reference dyno::RandomAccessContainer< T >::front ( )

inline

Definition at line 111 of file RandomAccessContainer.inl.

Here is the call graph for this function:

◆ front() [2/2]

template<typename T>

DYN_FUNC RandomAccessContainer< T >::const_reference dyno::RandomAccessContainer< T >::front ( ) const

inline

Definition at line 120 of file RandomAccessContainer.inl.

Here is the call graph for this function:

◆ insert() [1/4]

template<typename T>

DYN_FUNC RandomAccessContainer< T >::iterator dyno::RandomAccessContainer< T >::insert	(	const_iterator	position,
		const value_type &	value )

Definition at line 193 of file RandomAccessContainer.inl.

Here is the call graph for this function:

Here is the caller graph for this function:

◆ insert() [2/4]

template<typename T>

template<typename InputIterator>

DYN_FUNC RandomAccessContainer< T >::iterator dyno::RandomAccessContainer< T >::insert	(	const_iterator	position,
		InputIterator	first,
		InputIterator	last )

Definition at line 241 of file RandomAccessContainer.inl.

Here is the call graph for this function:

◆ insert() [3/4]

template<typename T>

DYN_FUNC RandomAccessContainer< T >::iterator dyno::RandomAccessContainer< T >::insert	(	const_iterator	position,
		size_type	n,
		const value_type &	value )

Definition at line 221 of file RandomAccessContainer.inl.

Here is the call graph for this function:

◆ insert() [4/4]

template<typename T>

DYN_FUNC RandomAccessContainer< T >::iterator dyno::RandomAccessContainer< T >::insert	(	const_iterator	position,
		value_type &&	value )

Definition at line 207 of file RandomAccessContainer.inl.

Here is the call graph for this function:

◆ operator[]() [1/2]

template<typename T>

DYN_FUNC RandomAccessContainer< T >::reference dyno::RandomAccessContainer< T >::operator[] ( size_type n )

inline

Definition at line 83 of file RandomAccessContainer.inl.

Here is the call graph for this function:

◆ operator[]() [2/2]

template<typename T>

DYN_FUNC RandomAccessContainer< T >::const_reference dyno::RandomAccessContainer< T >::operator[] ( size_type n ) const

inline

Definition at line 90 of file RandomAccessContainer.inl.

Here is the call graph for this function:

◆ pop_back()

template<typename T>

DYN_FUNC void dyno::RandomAccessContainer< T >::pop_back ( )

Definition at line 166 of file RandomAccessContainer.inl.

Here is the call graph for this function:

◆ push_back() [1/3]

template<typename T>

DYN_FUNC RandomAccessContainer< T >::reference dyno::RandomAccessContainer< T >::push_back ( )

Definition at line 158 of file RandomAccessContainer.inl.

Here is the call graph for this function:

◆ push_back() [2/3]

template<typename T>

DYN_FUNC void dyno::RandomAccessContainer< T >::push_back ( const value_type & value )

Definition at line 140 of file RandomAccessContainer.inl.

Here is the call graph for this function:

Here is the caller graph for this function:

◆ push_back() [3/3]

template<typename T>

DYN_FUNC void dyno::RandomAccessContainer< T >::push_back ( value_type && value )

Definition at line 149 of file RandomAccessContainer.inl.

Here is the call graph for this function:

◆ reserve() [1/2]

template<typename T>

DYN_FUNC void dyno::RandomAccessContainer< T >::reserve	(	iterator	beg,
		iterator	end,
		size_type	buffer_size = 0 )

inline

Definition at line 52 of file RandomAccessContainer.inl.

Here is the call graph for this function:

◆ reserve() [2/2]

template<typename T>

DYN_FUNC void dyno::RandomAccessContainer< T >::reserve	(	iterator	beg,
		size_type	buffer_size )

inline

Definition at line 42 of file RandomAccessContainer.inl.

Here is the call graph for this function:

Here is the caller graph for this function:

◆ resize()

template<typename T>

DYN_FUNC void dyno::RandomAccessContainer< T >::resize ( size_type n )

Definition at line 62 of file RandomAccessContainer.inl.

Here is the call graph for this function:

◆ size()

template<typename T>

DYN_FUNC size_type dyno::RandomAccessContainer< T >::size ( ) const

inlinenoexcept

Definition at line 103 of file RandomAccessContainer.h.

Here is the caller graph for this function:

Member Data Documentation

◆ m_Begin

template<typename T>

iterator dyno::RandomAccessContainer< T >::m_Begin = nullptr

private

Definition at line 156 of file RandomAccessContainer.h.

◆ m_bufferEnd

template<typename T>

iterator dyno::RandomAccessContainer< T >::m_bufferEnd = nullptr

private

Definition at line 154 of file RandomAccessContainer.h.

◆ m_End

template<typename T>

iterator dyno::RandomAccessContainer< T >::m_End = nullptr

private

Definition at line 155 of file RandomAccessContainer.h.

◆ m_size

template<typename T>

size_type dyno::RandomAccessContainer< T >::m_size = 0

private

Definition at line 153 of file RandomAccessContainer.h.

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

D:/Peridyno/peridyno/src/Core/STL/RandomAccessContainer.h
D:/Peridyno/peridyno/src/Core/STL/RandomAccessContainer.inl

Public Types

Public Member Functions

Private Types

Private Attributes

Additional Inherited Members

Detailed Description

Member Typedef Documentation

◆ base_type

◆ const_iterator

◆ const_pointer

◆ const_reference

◆ difference_type

◆ iterator

◆ pointer

◆ reference

◆ size_type

◆ this_type

◆ value_type

Constructor & Destructor Documentation

◆ RandomAccessContainer() [1/2]

◆ RandomAccessContainer() [2/2]

◆ ~RandomAccessContainer()

Member Function Documentation

◆ assign() [1/2]

◆ assign() [2/2]

◆ at() [1/2]

◆ at() [2/2]

◆ back() [1/2]

◆ back() [2/2]

◆ begin() [1/2]

◆ begin() [2/2]

◆ capacity()

◆ clear()

◆ data() [1/2]

◆ data() [2/2]

◆ empty()

◆ end() [1/2]

◆ end() [2/2]

◆ erase() [1/2]

◆ erase() [2/2]

◆ erase_first()

◆ erase_first_unsorted()

◆ erase_unsorted()

◆ find() [1/2]

◆ find() [2/2]

◆ front() [1/2]

◆ front() [2/2]

◆ insert() [1/4]

◆ insert() [2/4]

◆ insert() [3/4]

◆ insert() [4/4]

◆ operator[]() [1/2]

◆ operator[]() [2/2]

◆ pop_back()

◆ push_back() [1/3]

◆ push_back() [2/3]

◆ push_back() [3/3]

◆ reserve() [1/2]

◆ reserve() [2/2]

◆ resize()

◆ size()

Member Data Documentation

◆ m_Begin

◆ m_bufferEnd

◆ m_End

◆ m_size