ON_SimpleArray< T > Class Template Reference

#include <opennurbs_array.h>

Public Member Functions
void	Append (const T &)
void	Append (int, const T *)
T &	AppendNew ()
T *	Array ()
const T *	Array () const
T *	At (int)
const T *	At (int) const
int	BinarySearch (const T *, int(*)(const T *, const T *)) const
int	Capacity () const
int	Count () const
ON__UINT32	DataCRC (ON__UINT32 current_remainder) const
void	Destroy ()
void	EmergencyDestroy (void)
void	Empty ()
T *	First ()
const T *	First () const
bool	HeapSort (int(*)(const T *, const T *))
void	Insert (int, const T &)
T *	KeepArray ()
T *	Last ()
const T *	Last () const
void	MemSet (unsigned char)
int	NewCapacity () const
	ON_SimpleArray ()
	ON_SimpleArray (const ON_SimpleArray< T > &)
	ON_SimpleArray (int)
	operator const T * () const
	operator T* ()
virtual ON_SimpleArray< T > &	operator= (const ON_SimpleArray< T > &)
T &	operator[] (int)
const T &	operator[] (int) const
bool	Permute (const int *)
bool	QuickSort (int(*)(const T *, const T *))
virtual T *	Realloc (T *, int)
void	Remove ()
virtual void	Remove (int)
void	Reserve (int)
void	Reverse ()
int	Search (const T &) const
int	Search (const T *, int(*)(const T *, const T *)) const
void	SetArray (T *)
void	SetCapacity (int)
void	SetCount (int)
void	Shrink ()
unsigned int	SizeOfArray () const
bool	Sort (ON::sort_algorithm, int *, int(*)(const T *, const T *)) const
bool	Sort (ON::sort_algorithm, int *, int(*)(const T *, const T *, void *), void *) const
void	Swap (int, int)
void	Zero ()
virtual	~ON_SimpleArray ()

Protected Member Functions
void	Move (int, int, int)

Protected Attributes
T *	m_a
int	m_capacity
int	m_count

Constructor & Destructor Documentation

ON_SimpleArray() [1/3]

template<class T >

ON_SimpleArray< T >::ON_SimpleArray

(

)

ON_SimpleArray() [2/3]

template<class T >

ON_SimpleArray< T >::ON_SimpleArray

(

int

c

)

ON_SimpleArray() [3/3]

template<class T >

ON_SimpleArray< T >::ON_SimpleArray

(

const ON_SimpleArray< T > &

src

)

~ON_SimpleArray()

template<class T >

ON_SimpleArray< T >::~ON_SimpleArray ( )

virtual

Member Function Documentation

Append() [1/2]

template<class T >

void ON_SimpleArray< T >::Append

(

const T &

x

)

Append() [2/2]

template<class T >

void ON_SimpleArray< T >::Append	(	int	count,
		const T *	p )

AppendNew()

template<class T >

T & ON_SimpleArray< T >::AppendNew

(

)

Array() [1/2]

template<class T >

T * ON_SimpleArray< T >::Array

(

)

Array() [2/2]

template<class T >

const T * ON_SimpleArray< T >::Array

(

)

const

At() [1/2]

template<class T >

T * ON_SimpleArray< T >::At

(

int

i

)

At() [2/2]

template<class T >

const T * ON_SimpleArray< T >::At

(

int

i

)

const

BinarySearch()

template<class T >

int ON_SimpleArray< T >::BinarySearch	(	const T *	key,
		int(*)(const T *, const T *)	compar ) const

Capacity()

template<class T >

int ON_SimpleArray< T >::Capacity

(

)

const

Count()

template<class T >

int ON_SimpleArray< T >::Count

(

)

const

DataCRC()

template<class T >

ON__UINT32 ON_SimpleArray< T >::DataCRC

(

ON__UINT32

current_remainder

)

const

Destroy()

template<class T >

void ON_SimpleArray< T >::Destroy

(

)

EmergencyDestroy()

template<class T >

void ON_SimpleArray< T >::EmergencyDestroy

(

void

)

Empty()

template<class T >

void ON_SimpleArray< T >::Empty

(

)

First() [1/2]

template<class T >

T * ON_SimpleArray< T >::First

(

)

First() [2/2]

template<class T >

const T * ON_SimpleArray< T >::First

(

)

const

HeapSort()

template<class T >

bool ON_SimpleArray< T >::HeapSort

(

int(*)(const T *, const T *)

compar

)

Insert()

template<class T >

void ON_SimpleArray< T >::Insert	(	int	i,
		const T &	x )

KeepArray()

template<class T >

T * ON_SimpleArray< T >::KeepArray

(

)

Last() [1/2]

template<class T >

T * ON_SimpleArray< T >::Last

(

)

Last() [2/2]

template<class T >

const T * ON_SimpleArray< T >::Last

(

)

const

MemSet()

template<class T >

void ON_SimpleArray< T >::MemSet

(

unsigned char

value

)

Move()

template<class T >

void ON_SimpleArray< T >::Move ( int dest_i, int src_i, int ele_cnt )

protected

NewCapacity()

template<class T >

int ON_SimpleArray< T >::NewCapacity

(

)

const

operator const T *()

template<class T >

ON_SimpleArray< T >::operator const T *

(

)

const

operator T*()

template<class T >

ON_SimpleArray< T >::operator T*

(

)

operator=()

template<class T >

ON_SimpleArray< T > & ON_SimpleArray< T >::operator= ( const ON_SimpleArray< T > & src )

virtual

operator[]() [1/2]

template<class T >

T & ON_SimpleArray< T >::operator[]

(

int

i

)

operator[]() [2/2]

template<class T >

const T & ON_SimpleArray< T >::operator[]

(

int

i

)

const

Permute()

template<class T >

bool ON_SimpleArray< T >::Permute

(

const int *

index

)

QuickSort()

template<class T >

bool ON_SimpleArray< T >::QuickSort

(

int(*)(const T *, const T *)

compar

)

Realloc()

template<class T >

T * ON_SimpleArray< T >::Realloc ( T * ptr, int capacity )

virtual

Remove() [1/2]

template<class T >

void ON_SimpleArray< T >::Remove

(

)

Remove() [2/2]

template<class T >

void ON_SimpleArray< T >::Remove ( int i )

virtual

Reserve()

template<class T >

void ON_SimpleArray< T >::Reserve

(

int

newcap

)

Reverse()

template<class T >

void ON_SimpleArray< T >::Reverse

(

)

Search() [1/2]

template<class T >

int ON_SimpleArray< T >::Search

(

const T &

key

)

const

Search() [2/2]

template<class T >

int ON_SimpleArray< T >::Search	(	const T *	key,
		int(*)(const T *, const T *)	compar ) const

SetArray()

template<class T >

void ON_SimpleArray< T >::SetArray

(

T *

p

)

SetCapacity()

template<class T >

void ON_SimpleArray< T >::SetCapacity

(

int

capacity

)

SetCount()

template<class T >

void ON_SimpleArray< T >::SetCount

(

int

count

)

Shrink()

template<class T >

void ON_SimpleArray< T >::Shrink

(

)

SizeOfArray()

template<class T >

unsigned int ON_SimpleArray< T >::SizeOfArray

(

)

const

Sort() [1/2]

template<class T >

bool ON_SimpleArray< T >::Sort	(	ON::sort_algorithm	sa,
		int *	index,
		int(*)(const T *, const T *)	compar ) const

Sort() [2/2]

template<class T >

bool ON_SimpleArray< T >::Sort	(	ON::sort_algorithm	sa,
		int *	index,
		int(*)(const T *, const T *, void *)	compar,
		void *	p ) const

Swap()

template<class T >

void ON_SimpleArray< T >::Swap	(	int	i,
		int	j )

Zero()

template<class T >

void ON_SimpleArray< T >::Zero

(

)

Member Data Documentation

m_a

template<class T >

T* ON_SimpleArray< T >::m_a

protected

m_capacity

template<class T >

int ON_SimpleArray< T >::m_capacity

protected

m_count

template<class T >

int ON_SimpleArray< T >::m_count

protected

---

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

• src/3rdparty/legacy/opennurbs/opennurbs_array.h
• src/3rdparty/legacy/opennurbs/opennurbs_array_defs.h