Array<> wraps std::vector<> in COWReference<> adding ref counting and copy on write capability. More...

#include <Array.hpp>

Inheritance diagram for BLOCXX_NAMESPACE::Array< T >:

Public Types
typedef V::value_type	value_type

typedef V::pointer	pointer

typedef V::const_pointer	const_pointer

typedef V::iterator	iterator

typedef V::const_iterator	const_iterator

typedef V::reference	reference

typedef V::const_reference	const_reference

typedef V::size_type	size_type

typedef V::difference_type	difference_type

typedef V::reverse_iterator	reverse_iterator

typedef V::const_reverse_iterator	const_reverse_iterator

Public Member Functions
	Array ()
	Default Constructor. More...

	~Array ()
	Destructor. More...

	Array (V *toWrap)
	Constructor. More...

	Array (size_type n, const T &value)
	Construct an Array that consist of a specified number of elements that are copies of a given object. More...

	Array (int n, const T &value)
	Construct an Array that consist of a specified number of elements that are copies of a given object. More...

	Array (long n, const T &value)
	Construct an Array that consist of a specified number of elements that are copies of a given object. More...

	Array (size_type n)
	Construct an Array that consist of a specified number of elements that have be constructed using the default constructor of class T. More...

template<class InputIterator >
	Array (InputIterator first, InputIterator last)
	Construct an Array from a range specified with InputIterators. More...

iterator	begin ()

const_iterator	begin () const

iterator	end ()

const_iterator	end () const

reverse_iterator	rbegin ()

const_reverse_iterator	rbegin () const

reverse_iterator	rend ()

const_reverse_iterator	rend () const

size_type	size () const

size_type	max_size () const

size_type	capacity () const

bool	empty () const

reference	operator[] (size_type n)
	Retrieve A read/write reference to an object in the Array at a given index. More...

const_reference	operator[] (size_type n) const
	Retrieve A read only reference to an object in the Array at a given index. More...

Array< T > &	operator+= (const T &x)
	Append an object to the end of the Array. More...

void	reserve (size_type n)
	Ensure the capacity is at least the size of a given value. More...

reference	front ()

const_reference	front () const

reference	back ()

const_reference	back () const

void	push_back (const T &x)
	Append an element to the end of the Array. More...

void	append (const T &x)
	Append an element to the end of the Array. More...

void	swap (Array< T > &x)
	Swap the elements of this Array with the elements of another. More...

iterator	insert (iterator position, const T &x)
	Insert an element in the Array before an element specified by an iterator. More...

void	insert (size_type position, const T &x)
	Insert an element in the Array before an element specified by an index. More...

void	remove (size_type index)
	Remove an element from the Array at a given index. More...

void	remove (size_type begin, size_type end)
	Remove an element specified by a range. More...

template<class InputIterator >
void	insert (iterator position, InputIterator first, InputIterator last)
	Insert a range of elements before a given position in the Array. More...

void	appendArray (const Array< T > &x)
	Append the elements of another Array to the end of this Array. More...

void	pop_back ()
	Remove the last element of the Array. More...

iterator	erase (iterator position)
	Remove an element of the Array specified with an iterator. More...

iterator	erase (iterator first, iterator last)
	Remove elements of the Array specified by a beginning and ending iterator. More...

void	resize (size_type new_size, const T &x)
	Ensure the Array is a given size. More...

void	resize (size_type new_size)
	Ensure the Array is a given size. More...

void	clear ()
	Remove all items from the Array. More...

const_iterator	find (const T &x, const_iterator first, const_iterator last) const
	Find element x in the array range specified by the first and last iterators. More...

const_iterator	find (const T &x) const
	Find element x in the array. More...

iterator	find (const T &x, iterator first, iterator last)
	Find element x in the array range specified by the first and last iterators. More...

iterator	find (const T &x)
	Find element x in the array. More...

bool	contains (const T &x, const_iterator first, const_iterator last) const
	Determine if element x is contained in the array range specified by the first and last iterators. More...

bool	contains (const T &x) const
	Determine if element x is contained in the array. More...

Private Types
typedef std::vector< T, std::allocator< T > >	V

Private Attributes
COWReference< V >	m_impl

Friends
bool	operator== (const Array< T > &x, const Array< T > &y)
	Determine equality of two Arrays. More...

bool	operator< (const Array< T > &x, const Array< T > &y)
	Determine if one Array is less than another. More...

Detailed Description

template<class T>
class BLOCXX_NAMESPACE::Array< T >

Array<> wraps std::vector<> in COWReference<> adding ref counting and copy on write capability.

It also adds valid range checks to operator[] if BLOCXX_CHECK_ARRAY_INDEXING is defined.

Invariants: See std::vector<> Thread safety: read Copy semantics: Copy On Write Exception safety: same as std::vector<T>

Definition at line 95 of file Array.hpp.

Member Typedef Documentation

◆ const_iterator

template<class T >

typedef V::const_iterator BLOCXX_NAMESPACE::Array< T >::const_iterator

Definition at line 115 of file Array.hpp.

◆ const_pointer

template<class T >

typedef V::const_pointer BLOCXX_NAMESPACE::Array< T >::const_pointer

Definition at line 113 of file Array.hpp.

◆ const_reference

template<class T >

typedef V::const_reference BLOCXX_NAMESPACE::Array< T >::const_reference

Definition at line 117 of file Array.hpp.

◆ const_reverse_iterator

template<class T >

typedef V::const_reverse_iterator BLOCXX_NAMESPACE::Array< T >::const_reverse_iterator

Definition at line 121 of file Array.hpp.

◆ difference_type

template<class T >

typedef V::difference_type BLOCXX_NAMESPACE::Array< T >::difference_type

Definition at line 119 of file Array.hpp.

◆ iterator

template<class T >

typedef V::iterator BLOCXX_NAMESPACE::Array< T >::iterator

Definition at line 114 of file Array.hpp.

◆ pointer

template<class T >

typedef V::pointer BLOCXX_NAMESPACE::Array< T >::pointer

Definition at line 112 of file Array.hpp.

◆ reference

template<class T >

typedef V::reference BLOCXX_NAMESPACE::Array< T >::reference

Definition at line 116 of file Array.hpp.

◆ reverse_iterator

template<class T >

typedef V::reverse_iterator BLOCXX_NAMESPACE::Array< T >::reverse_iterator

Definition at line 120 of file Array.hpp.

◆ size_type

template<class T >

typedef V::size_type BLOCXX_NAMESPACE::Array< T >::size_type

Definition at line 118 of file Array.hpp.

◆ V

template<class T >

typedef std::vector<T, std::allocator<T> > BLOCXX_NAMESPACE::Array< T >::V

private

Definition at line 97 of file Array.hpp.

◆ value_type

template<class T >

typedef V::value_type BLOCXX_NAMESPACE::Array< T >::value_type

Definition at line 111 of file Array.hpp.

Constructor & Destructor Documentation

◆ Array() [1/7]

template<typename T >

BLOCXX_NAMESPACE::Array< T >::Array

inline

Default Constructor.

Definition at line 85 of file ArrayImpl.hpp.

◆ ~Array()

template<typename T >

BLOCXX_NAMESPACE::Array< T >::~Array

inline

Destructor.

Definition at line 91 of file ArrayImpl.hpp.

◆ Array() [2/7]

template<typename T >

BLOCXX_NAMESPACE::Array< T >::Array ( V * toWrap )

inlineexplicit

Constructor.

Parameters

toWrap The std::vector to wrap with this Array object.

Definition at line 96 of file ArrayImpl.hpp.

◆ Array() [3/7]

template<typename T >

BLOCXX_NAMESPACE::Array< T >::Array	(	size_type	n,
		const T &	value
	)

inline

Construct an Array that consist of a specified number of elements that are copies of a given object.

Parameters

n	Number of elements the Array will contain.
value	The value every element of the array will be initialized to.

Definition at line 102 of file ArrayImpl.hpp.

References m_impl.

◆ Array() [4/7]

template<typename T >

BLOCXX_NAMESPACE::Array< T >::Array	(	int	n,
		const T &	value
	)

inline

Construct an Array that consist of a specified number of elements that are copies of a given object.

Parameters

n	Number of elements the Array will contain.
value	The value every element of the array will be initialized to.

Definition at line 108 of file ArrayImpl.hpp.

◆ Array() [5/7]

template<typename T >

BLOCXX_NAMESPACE::Array< T >::Array	(	long	n,
		const T &	value
	)

inline

Construct an Array that consist of a specified number of elements that are copies of a given object.

Parameters

n	Number of elements the Array will contain.
value	The value every element of the array will be initialized to.

Definition at line 114 of file ArrayImpl.hpp.

◆ Array() [6/7]

template<typename T >

BLOCXX_NAMESPACE::Array< T >::Array ( size_type n )

inlineexplicit

Construct an Array that consist of a specified number of elements that have be constructed using the default constructor of class T.

Parameters

n	Number of elements the Array will contain.

Definition at line 120 of file ArrayImpl.hpp.

◆ Array() [7/7]

template<typename T >

template<class InputIterator >

BLOCXX_NAMESPACE::Array< T >::Array	(	InputIterator	first,
		InputIterator	last
	)

inline

Construct an Array from a range specified with InputIterators.

Parameters

first	The iterator for the beginning of the range.
last	The iterator for the end of the range.

Definition at line 127 of file ArrayImpl.hpp.

Member Function Documentation

◆ append()

template<typename T >

void BLOCXX_NAMESPACE::Array< T >::append ( const T & x )

inline

Append an element to the end of the Array.

This is identical to push_back.

Parameters

x	The element to append to the end of the Array.

Definition at line 288 of file ArrayImpl.hpp.

Referenced by BLOCXX_NAMESPACE::FileSystem::getDirectoryContents(), and BLOCXX_NAMESPACE::String::tokenize().

◆ appendArray()

template<typename T >

void BLOCXX_NAMESPACE::Array< T >::appendArray ( const Array< T > & x )

inline

Append the elements of another Array to the end of this Array.

Parameters

x	The Array the elements will be copied from.

Definition at line 345 of file ArrayImpl.hpp.

◆ back() [1/2]

template<typename T >

Array< T >::reference BLOCXX_NAMESPACE::Array< T >::back

inline

Returns: A read/write reference to the last element of the Array.

Definition at line 267 of file ArrayImpl.hpp.

◆ back() [2/2]

template<typename T >

Array< T >::const_reference BLOCXX_NAMESPACE::Array< T >::back

inline

Returns: A read only reference to the last element of the Array.

Definition at line 274 of file ArrayImpl.hpp.

◆ begin() [1/2]

template<typename T >

Array< T >::iterator BLOCXX_NAMESPACE::Array< T >::begin

inline

Returns: A read/write iterator that points to the first element in the Array. Iteration is done in the normal order (1st to last) with the returned iterator.

Definition at line 134 of file ArrayImpl.hpp.

Referenced by BLOCXX_NAMESPACE::Cstr::CstrArr< SA >::CstrArr(), BLOCXX_NAMESPACE::DateTime::DateTime(), and BLOCXX_NAMESPACE::Array< T >::remove().

◆ begin() [2/2]

template<typename T >

Array< T >::const_iterator BLOCXX_NAMESPACE::Array< T >::begin

inline

Returns: A read only iterator that points to the first element in the Array. Iteration is done in the normal order (1st to last) with the returned iterator.

Definition at line 141 of file ArrayImpl.hpp.

◆ capacity()

template<typename T >

Array< T >::size_type BLOCXX_NAMESPACE::Array< T >::capacity

inline

Returns: The space that is currently allocated to hold the elements. This value will be >= size()

Definition at line 204 of file ArrayImpl.hpp.

◆ clear()

template<typename T >

void BLOCXX_NAMESPACE::Array< T >::clear

inline

Remove all items from the Array.

The size() of the Array should be zero after calling this method.

Definition at line 387 of file ArrayImpl.hpp.

Referenced by BLOCXX_NAMESPACE::FileSystem::getDirectoryContents().

◆ contains() [1/2]

template<typename T >

bool BLOCXX_NAMESPACE::Array< T >::contains ( const T & x ) const

inline

Determine if element x is contained in the array.

Parameters

x	The element to seach for.

Returns: true if the element x is contained in the array.

Definition at line 443 of file ArrayImpl.hpp.

References BLOCXX_NAMESPACE::Array< T >::swap().

◆ contains() [2/2]

template<typename T >

bool BLOCXX_NAMESPACE::Array< T >::contains	(	const T &	x,
		const_iterator	first,
		const_iterator	last
	)		const

inline

Determine if element x is contained in the array range specified by the first and last iterators.

Parameters

x	The element to seach for.
first	The first position iterator; begin of the range.
last	The last position iterator; end of the range.

Returns: true if the element x is contained in the specified range of the array.

Definition at line 436 of file ArrayImpl.hpp.

◆ empty()

template<typename T >

bool BLOCXX_NAMESPACE::Array< T >::empty

inline

Returns: true if the Array is empty (contains zero elements)

Definition at line 211 of file ArrayImpl.hpp.

Referenced by BLOCXX_NAMESPACE::UTF8Utils::StringToUCS2().

◆ end() [1/2]

template<typename T >

Array< T >::iterator BLOCXX_NAMESPACE::Array< T >::end

inline

Returns: A read/write iterator that points one past the last element in the Array. Iteration is done in the normal order (1st to last) with the returned iterator.

Definition at line 148 of file ArrayImpl.hpp.

Referenced by BLOCXX_NAMESPACE::Cstr::CstrArr< SA >::CstrArr(), BLOCXX_NAMESPACE::DateTime::DateTime(), and BLOCXX_NAMESPACE::Array< T >::remove().

◆ end() [2/2]

template<typename T >

Array< T >::const_iterator BLOCXX_NAMESPACE::Array< T >::end

inline

Returns: A read only iterator that points one past the last element in the Array. Iteration is done in the normal order (1st to last) with the returned iterator.

Definition at line 155 of file ArrayImpl.hpp.

◆ erase() [1/2]

template<typename T >

Array< T >::iterator BLOCXX_NAMESPACE::Array< T >::erase	(	iterator	first,
		iterator	last
	)

inline

Remove elements of the Array specified by a beginning and ending iterator.

Parameters

first	An iterator that specifies the first element to remove.
last	An iterator that specifies the last element to remove.

Returns: An iterator that points to the element in the Array following the removed elements.

Definition at line 366 of file ArrayImpl.hpp.

◆ erase() [2/2]

template<typename T >

Array< T >::iterator BLOCXX_NAMESPACE::Array< T >::erase ( iterator position )

inline

Remove an element of the Array specified with an iterator.

Parameters

position An iterator that points to the element to be removed.

Returns: An iterator that points to the element in the Array following the removed element.

Definition at line 359 of file ArrayImpl.hpp.

◆ find() [1/4]

template<typename T >

Array< T >::iterator BLOCXX_NAMESPACE::Array< T >::find ( const T & x )

inline

Find element x in the array.

Parameters

x	The element to seach for.

Returns: An read/write iterator pointing to the found element or the end iterator pointing one past the last element in the array.

Definition at line 429 of file ArrayImpl.hpp.

◆ find() [2/4]

template<typename T >

Array< T >::const_iterator BLOCXX_NAMESPACE::Array< T >::find ( const T & x ) const

inline

Find element x in the array.

Parameters

x	The element to seach for.

Returns: An read only iterator pointing to the found element or the end iterator pointing one past the last element in the array.

Definition at line 408 of file ArrayImpl.hpp.

◆ find() [3/4]

template<typename T >

Array< T >::const_iterator BLOCXX_NAMESPACE::Array< T >::find	(	const T &	x,
		const_iterator	first,
		const_iterator	last
	)		const

inline

Find element x in the array range specified by the first and last iterators.

Parameters

x	The element to seach for.
first	The first position iterator; begin of the range.
last	The last position iterator; end of the range.

Returns: An read only iterator pointing to the found element or the end iterator pointing one past the last element in the array.

Definition at line 394 of file ArrayImpl.hpp.

◆ find() [4/4]

template<typename T >

Array< T >::iterator BLOCXX_NAMESPACE::Array< T >::find	(	const T &	x,
		iterator	first,
		iterator	last
	)

inline

Find element x in the array range specified by the first and last iterators.

Parameters

x	The element to seach for.
first	The first position iterator; begin of the range.
last	The last position iterator; end of the range.

Returns: An read/write iterator pointing to the found element or the end iterator pointing one past the last element in the array.

Definition at line 415 of file ArrayImpl.hpp.

◆ front() [1/2]

template<typename T >

Array< T >::reference BLOCXX_NAMESPACE::Array< T >::front

inline

Returns: A read/write reference to the first element of the Array.

Definition at line 253 of file ArrayImpl.hpp.

◆ front() [2/2]

template<typename T >

Array< T >::const_reference BLOCXX_NAMESPACE::Array< T >::front

inline

Returns: A read only reference to the first element of the Array.

Definition at line 260 of file ArrayImpl.hpp.

◆ insert() [1/3]

template<typename T >

Array< T >::iterator BLOCXX_NAMESPACE::Array< T >::insert	(	iterator	position,
		const T &	x
	)

inline

Insert an element in the Array before an element specified by an iterator.

Parameters

position	An iterator that points to the insertion point. The element will be inserted before this point.
x	The element to insert into the Array.

Returns: An iterator that points to the newly inserted element in the Array.

Definition at line 302 of file ArrayImpl.hpp.

◆ insert() [2/3]

template<typename T >

template<class InputIterator >

void BLOCXX_NAMESPACE::Array< T >::insert	(	iterator	position,
		InputIterator	first,
		InputIterator	last
	)

inline

Insert a range of elements before a given position in the Array.

Parameters

position	The position to insert the elements at. The insertion will be done before this position.
first	The beginning of the range of elements to insert.
last	The end of the range of elements to insert.

Definition at line 338 of file ArrayImpl.hpp.

◆ insert() [3/3]

template<typename T >

void BLOCXX_NAMESPACE::Array< T >::insert	(	size_type	position,
		const T &	x
	)

inline

Insert an element in the Array before an element specified by an index.

Parameters

position	An index that specifies where the element will be inserted.
x	The element to insert into the Array.

Definition at line 309 of file ArrayImpl.hpp.

References m_impl.

◆ max_size()

template<typename T >

Array< T >::size_type BLOCXX_NAMESPACE::Array< T >::max_size

inline

Returns: The maximum number of elements the Array can hold.

Definition at line 197 of file ArrayImpl.hpp.

◆ operator+=()

template<typename T >

Array< T > & BLOCXX_NAMESPACE::Array< T >::operator+= ( const T & x )

inline

Append an object to the end of the Array.

Parameters

x	The object to append to the end of the Array.

Returns: A reference to this Array object.

Definition at line 238 of file ArrayImpl.hpp.

References m_impl.

◆ operator[]() [1/2]

template<typename T >

Array< T >::reference BLOCXX_NAMESPACE::Array< T >::operator[] ( size_type n )

inline

Retrieve A read/write reference to an object in the Array at a given index.

Parameters

n	The index of the element to retrieve the reference for.

Returns: A read/write reference to the object at the given index.

Definition at line 218 of file ArrayImpl.hpp.

◆ operator[]() [2/2]

template<typename T >

Array< T >::const_reference BLOCXX_NAMESPACE::Array< T >::operator[] ( size_type n ) const

inline

Retrieve A read only reference to an object in the Array at a given index.

Parameters

n	The index of the element to retrieve the reference for.

Returns: A read only reference to the object at the given index.

Definition at line 228 of file ArrayImpl.hpp.

◆ pop_back()

template<typename T >

void BLOCXX_NAMESPACE::Array< T >::pop_back

inline

Remove the last element of the Array.

Definition at line 352 of file ArrayImpl.hpp.

◆ push_back()

template<typename T >

void BLOCXX_NAMESPACE::Array< T >::push_back ( const T & x )

inline

Append an element to the end of the Array.

Parameters

x	The element to append to the end of the Array.

Definition at line 281 of file ArrayImpl.hpp.

Referenced by BLOCXX_NAMESPACE::Exec::processInputOutput().

◆ rbegin() [1/2]

template<typename T >

Array< T >::reverse_iterator BLOCXX_NAMESPACE::Array< T >::rbegin

inline

Returns: A read/write reverse iterator that points to the last element in the Array. Iteration is done in reverse order with the returned iterator.

Definition at line 162 of file ArrayImpl.hpp.

◆ rbegin() [2/2]

template<typename T >

Array< T >::const_reverse_iterator BLOCXX_NAMESPACE::Array< T >::rbegin

inline

Returns: A read only reverse iterator that points to the last element in the Array. Iteration is done in reverse order with the returned iterator.

Definition at line 169 of file ArrayImpl.hpp.

◆ remove() [1/2]

template<typename T >

void BLOCXX_NAMESPACE::Array< T >::remove	(	size_type	begin,
		size_type	end
	)

inline

Remove an element specified by a range.

Parameters

begin	An iterator that specifies the beginning of the range to remove.
end	An iterator that specifies the end of the range to remove.

Definition at line 326 of file ArrayImpl.hpp.

◆ remove() [2/2]

template<typename T >

void BLOCXX_NAMESPACE::Array< T >::remove ( size_type index )

inline

Remove an element from the Array at a given index.

Definition at line 316 of file ArrayImpl.hpp.

References BLOCXX_NAMESPACE::Array< T >::begin(), and BLOCXX_NAMESPACE::Array< T >::end().

◆ rend() [1/2]

template<typename T >

Array< T >::reverse_iterator BLOCXX_NAMESPACE::Array< T >::rend

inline

Returns: A read/write reverse iterator that points one before the first element of the Array. Iteration is done in reverse order with the returned iterator.

Definition at line 176 of file ArrayImpl.hpp.

◆ rend() [2/2]

template<typename T >

Array< T >::const_reverse_iterator BLOCXX_NAMESPACE::Array< T >::rend

inline

Returns: A read only reverse iterator that points one before the first element of the Array. Iteration is done in reverse order with the returned iterator.

Definition at line 183 of file ArrayImpl.hpp.

◆ reserve()

template<typename T >

void BLOCXX_NAMESPACE::Array< T >::reserve ( size_type n )

inline

Ensure the capacity is at least the size of a given value.

If the given value is > max_size() the method with throw an std::length_error exception.

Parameters

n	- The minimum size this Array can be.

Definition at line 246 of file ArrayImpl.hpp.

◆ resize() [1/2]

template<typename T >

void BLOCXX_NAMESPACE::Array< T >::resize ( size_type new_size )

inline

Ensure the Array is a given size.

If the Array needs to be larger that what it already is, this method will append items that have been initialized using the default constructor of class T.

Parameters

new_size The new size of the Array.

Definition at line 380 of file ArrayImpl.hpp.

◆ resize() [2/2]

template<typename T >

void BLOCXX_NAMESPACE::Array< T >::resize	(	size_type	new_size,
		const T &	x
	)

inline

Ensure the Array is a given size.

Parameters

new_size	The new size of the Array.
x	An object to append to the end of the Array if it needs to be larger than what it already is.

Definition at line 373 of file ArrayImpl.hpp.

◆ size()

template<typename T >

Array< T >::size_type BLOCXX_NAMESPACE::Array< T >::size

inline

Returns: The number of elements in the Array

Definition at line 190 of file ArrayImpl.hpp.

Referenced by BLOCXX_NAMESPACE::AppenderLogger::AppenderLogger(), BLOCXX_NAMESPACE::DateTime::DateTime(), BLOCXX_NAMESPACE::Exec::processInputOutput(), and BLOCXX_NAMESPACE::String::String().

◆ swap()

template<typename T >

void BLOCXX_NAMESPACE::Array< T >::swap ( Array< T > & x )

inline

Swap the elements of this Array with the elements of another.

Parameters

x	The Array object this Array will swap elements with.

Definition at line 295 of file ArrayImpl.hpp.

Referenced by BLOCXX_NAMESPACE::Array< T >::contains().

Friends And Related Function Documentation

◆ operator<

template<class T >

bool operator<	(	const Array< T > &	x,
		const Array< T > &	y
	)

friend

Determine if one Array is less than another.

This is done by doing a lexicographical compare on the Arrays. a lexicographical compare will compares the Arrays element by element until:

It finds two corresponding elements unequal, and the result of their comparison is taken as the result of the comparison between sequences.
No inequalities are found, but one sequence has more elements than the other, and the shorter sequence is considered less than the longer sequence.
No inequalities are found and the sequences have the same number of elements, and so the sequences are equal and the result of the comparison is false.
Parameters

x The first Array object in the comparison.

y The second Array object in the comparison.

Returns
true if Array x is less than Array y.

Definition at line 469 of file ArrayImpl.hpp.

◆ operator==

template<class T >

bool operator==	(	const Array< T > &	x,
		const Array< T > &	y
	)

friend

Determine equality of two Arrays.

Two Arrays are considered equal if they are of the same size and elements in the same position are equal as defined by the “==” operator of the type in the Array.

Parameters

x	The first Array object in the comparison.
y	The second Array object in the comparison.

Returns: true if Array x is equal to Array y.

Definition at line 464 of file ArrayImpl.hpp.

Member Data Documentation

◆ m_impl

template<class T >

COWReference<V> BLOCXX_NAMESPACE::Array< T >::m_impl

private

Definition at line 104 of file Array.hpp.

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

Public Types

Public Member Functions

Private Types

Private Attributes

Friends

Detailed Description

template<class T> class BLOCXX_NAMESPACE::Array< T >

Member Typedef Documentation

◆ const_iterator

◆ const_pointer

◆ const_reference

◆ const_reverse_iterator

◆ difference_type

◆ iterator

◆ pointer

◆ reference

◆ reverse_iterator

◆ size_type

◆ V

◆ value_type

Constructor & Destructor Documentation

◆ Array() [1/7]

◆ ~Array()

◆ Array() [2/7]

◆ Array() [3/7]

◆ Array() [4/7]

◆ Array() [5/7]

◆ Array() [6/7]

◆ Array() [7/7]

Member Function Documentation

◆ append()

◆ appendArray()

◆ back() [1/2]

◆ back() [2/2]

◆ begin() [1/2]

◆ begin() [2/2]

◆ capacity()

◆ clear()

◆ contains() [1/2]

◆ contains() [2/2]

◆ empty()

◆ end() [1/2]

◆ end() [2/2]

◆ erase() [1/2]

◆ erase() [2/2]

◆ find() [1/4]

◆ find() [2/4]

◆ find() [3/4]

◆ find() [4/4]

◆ front() [1/2]

◆ front() [2/2]

◆ insert() [1/3]

◆ insert() [2/3]

◆ insert() [3/3]

◆ max_size()

◆ operator+=()

◆ operator[]() [1/2]

◆ operator[]() [2/2]

◆ pop_back()

◆ push_back()

◆ rbegin() [1/2]

◆ rbegin() [2/2]

◆ remove() [1/2]

◆ remove() [2/2]

◆ rend() [1/2]

◆ rend() [2/2]

◆ reserve()

◆ resize() [1/2]

◆ resize() [2/2]

◆ size()

◆ swap()

Friends And Related Function Documentation

◆ operator<

◆ operator==

Member Data Documentation

◆ m_impl

template<class T>
class BLOCXX_NAMESPACE::Array< T >