FArray< T, S, I > Class Template Reference

An array class that attempts to minimize unnecessary heap access. More...

#include <farray.h>

Public Types
using	size_type = uint64
	Typedef to assist in STL compatibility.
using	value_type = T
	Typedef to assist in STL compatibility.
using	iterator = T *
	Typedef to assist in STL compatibility.
using	const_iterator = const T *
	Typedef to assist in STL compatibility.

Public Member Functions
constexpr	FArray ()
	Default constructor - the array size is zero.
	FArray (size_type s, const T &t=T())
template<uint64 S2>
	FArray (const FArray< T, S2, I > &f)
	Copy constructor, valid for FArrays of the same data type but different stack lengths.
constexpr	FArray (const FArray< T, S, I > &f)
	Specialized copy constructor, for the special case of when the stack lengths are the same.
	FArray (std::initializer_list< T > l)
	~FArray ()
	Destructor.
constexpr const FArray< T, S, I > &	operator= (const FArray< T, S, I > &f)
template<uint64 S2>
constexpr const FArray< T, S, I > &	operator= (const FArray< T, S2, I > &f)
	Assignment operator, valid for FArrays of the same data type but different stack lengths.
template<uint64 S2>
bool	operator== (const FArray< T, S2, I > &f) const
I	size () const
size_type	stackSize () const
	Returns the size of the array pre-allocated on the stack.
size_type	allocated () const
bool	empty () const
T *	data ()
const T *	data () const
T &	front ()
const T &	front () const
T &	back ()
const T &	back () const
I	find (const T &t) const
size_type	capacity () const
void	push_back (const T &t)
	Adds a new element to the end of the array, increasing the array size by one.
T *	emplace_back ()
T *	emplace_n_back (size_type n)
void	pop_back ()
	Removes the last element in the array. The results are undefined if the array is of zero length.
void	resize (I i, const T &t=T())
iterator	insert (I i, const T &t)
void	put (I i, const T &t)
	Adds a value to the array, first making certain it is big enough to hold it.
template<class C >
void	append (const C &in)
	Appends the contents of one FArray onto another.
iterator	insert (iterator it, const T &t)
bool	remove (I i)
size_type	removeAll (const T &t)
void	clear ()
void	reset ()
void	reserve (size_type s)
void	clip ()
iterator	begin ()
const_iterator	begin () const
const_iterator	constBegin () const
iterator	end ()
const_iterator	end () const
const_iterator	constEnd () const
T &	at (I i)
const T &	at (I i) const
T &	operator[] (I i)
const T &	operator[] (I i) const
T	value (I i, const T &t={}) const

Detailed Description

template<typename T, uint64 S = 32, typename I = uint64>
class FArray< T, S, I >

An array class that attempts to minimize unnecessary heap access.

T is the data type.
S is the stack length.
This class attempts to provide a speed-optimized array for use in plot generation.
It does this in two ways.
First, it attempts to minimize heap churn by not deallocating memory.
Second, it has a second template argument that indicates how much memory to create ON THE STACK. Only if the array size needs to exceed S, does it actually use memory from the heap.

Member Function Documentation

allocated()

template<typename T , uint64 S = 32, typename I = uint64>

size_type FArray< T, S, I >::allocated ( ) const

inline

Returns

the size allocated internally – this will be S (the stack length) unless the array has been made large enough to force heap access.

at() [1/2]

template<typename T , uint64 S = 32, typename I = uint64>

T & FArray< T, S, I >::at ( I i )

inline

Returns

A reference to the element at the ith location in the array. Undefined if the array length is less than or equal to i. No bounds checking is performed, even in a debug compile.

at() [2/2]

template<typename T , uint64 S = 32, typename I = uint64>

const T & FArray< T, S, I >::at ( I i ) const

inline

Returns

A const reference to the element at the ith location in the array. Undefined if the array length is less than or equal to i. No bounds checking is performed, even in a debug compile.

back() [1/2]

template<typename T , uint64 S = 32, typename I = uint64>

T & FArray< T, S, I >::back ( )

inline

Returns

a reference to the last element in the array. This is undefined if the array is of zero length.

back() [2/2]

template<typename T , uint64 S = 32, typename I = uint64>

const T & FArray< T, S, I >::back ( ) const

inline

Returns

a const reference to the last element in the array. This is undefined if the array is of zero length.

begin() [1/2]

template<typename T , uint64 S = 32, typename I = uint64>

iterator FArray< T, S, I >::begin ( )

inline

Returns

An iterator representing the first element in the array. Implemented as a pointer. STL compatible as a random-access iterator.

begin() [2/2]

template<typename T , uint64 S = 32, typename I = uint64>

const_iterator FArray< T, S, I >::begin ( ) const

inline

Returns

An iterator representing the first element in the array. Implemented as a pointer. STL compatible as a random-access iterator.

clip()

template<typename T , uint64 S = 32, typename I = uint64>

void FArray< T, S, I >::clip ( )

inline

Reduces the allocated length to the actual length of the array, or the stack length, whichever is greater. This and reset() are the only means of reducing the allocated length of an existing FArray.

constBegin()

template<typename T , uint64 S = 32, typename I = uint64>

const_iterator FArray< T, S, I >::constBegin ( ) const

inline

Returns

An iterator representing the first element in the array. Implemented as a pointer. STL compatible as a random-access iterator.

constEnd()

template<typename T , uint64 S = 32, typename I = uint64>

const_iterator FArray< T, S, I >::constEnd ( ) const

inline

Returns

An iterator representing one past the last element in the array. Implemented as a pointer. STL compatible as a random-access iterator.

data() [1/2]

template<typename T , uint64 S = 32, typename I = uint64>

T * FArray< T, S, I >::data ( )

inline

Returns

a pointer to the beginning of the array data. An FARRAY guarantees that it's internal data is contiguous.

data() [2/2]

template<typename T , uint64 S = 32, typename I = uint64>

const T * FArray< T, S, I >::data ( ) const

inline

Returns

a const pointer to the beginning of the array data. An FARRAY guarantees that it's internal data is contiguous.

emplace_back()

template<typename T , uint64 S = 32, typename I = uint64>

T * FArray< T, S, I >::emplace_back ( )

inline

To avoid creating a temporary object, can call this to get memory location of new lcoation at end of stack and then use it to do an in-place new. new(fa.emplace_back()) Fred(arg1,arg2);

empty()

template<typename T , uint64 S = 32, typename I = uint64>

bool FArray< T, S, I >::empty ( ) const

inline

Returns

true if the array is of zero length.

end() [1/2]

template<typename T , uint64 S = 32, typename I = uint64>

iterator FArray< T, S, I >::end ( )

inline

Returns

An iterator representing one past the last element in the array. Implemented as a pointer. STL compatible as a random-access iterator.

end() [2/2]

template<typename T , uint64 S = 32, typename I = uint64>

const_iterator FArray< T, S, I >::end ( ) const

inline

Returns

An iterator representing one past the last element in the array. Implemented as a pointer. STL compatible as a random-access iterator.

front() [1/2]

template<typename T , uint64 S = 32, typename I = uint64>

T & FArray< T, S, I >::front ( )

inline

Returns

a reference to the first element in the array. This is undefined if the array is of zero length.

front() [2/2]

template<typename T , uint64 S = 32, typename I = uint64>

const T & FArray< T, S, I >::front ( ) const

inline

Returns

a const reference to the first element in the array. This is undefined if the array is of zero length.

operator[]() [1/2]

template<typename T , uint64 S = 32, typename I = uint64>

T & FArray< T, S, I >::operator[] ( I i )

inline

Returns

A reference to the element at the ith location in the array. Undefined if the array length is less than or equal to i. No bounds checking is performed, even in a debug compile.

operator[]() [2/2]

template<typename T , uint64 S = 32, typename I = uint64>

const T & FArray< T, S, I >::operator[] ( I i ) const

inline

Returns

A const reference to the element at the ith location in the array. Undefined if the array length is less than or equal to i. No bounds checking is performed, even in a debug compile.

size()

template<typename T , uint64 S = 32, typename I = uint64>

I FArray< T, S, I >::size ( ) const

inline

Returns

the current size of the array - NOT the stack length OR the size allocated internally.

value()

template<typename T , uint64 S = 32, typename I = uint64>

T FArray< T, S, I >::value ( I i, const T & t = {} ) const

inline

Returns

A copy of the value at the ith location in the array, or t if i is an invalid index.

---

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

• C:/Source/itasca-suite/common/base/src/farray.h