QCAD
Open Source 2D CAD
Loading...
Searching...
No Matches
ON_ClassArray< T > Class Template Reference

#include <opennurbs_array.h>

Inheritance diagram for ON_ClassArray< T >:
ON_ObjectArray< ON_BrepEdge > ON_ObjectArray< ON_BrepFace > ON_ObjectArray< ON_BrepFaceSide > ON_ObjectArray< ON_BrepLoop > ON_ObjectArray< ON_BrepRegion > ON_ObjectArray< ON_BrepTrim > ON_ObjectArray< ON_BrepVertex > ON_ObjectArray< ON_TextureMapping > ON_ObjectArray< ON_Material > ON_ObjectArray< ON_Linetype > ON_ObjectArray< ON_Layer > ON_ObjectArray< ON_Group > ON_ObjectArray< ON_Font > ON_ObjectArray< ON_DimStyle > ON_ObjectArray< ON_HatchPattern > ON_ObjectArray< ON_InstanceDefinition > ON_ObjectArray< ON_Texture > ON_ObjectArray< T >

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
 
void Destroy ()
 
void EmergencyDestroy (void)
 
void Empty ()
 
T * First ()
 
const T * First () const
 
virtual bool HeapSort (int(*)(const T *, const T *))
 
void Insert (int, const T &)
 
T * KeepArray ()
 
T * Last ()
 
const T * Last () const
 
int NewCapacity () const
 
 ON_ClassArray ()
 
 ON_ClassArray (const ON_ClassArray< T > &)
 
 ON_ClassArray (int)
 
 operator const T * () const
 
 operator T* ()
 
ON_ClassArray< T > & operator= (const ON_ClassArray< T > &)
 
T & operator[] (int)
 
const T & operator[] (int) const
 
bool Permute (const int *)
 
virtual bool QuickSort (int(*)(const T *, const T *))
 
virtual T * Realloc (T *, int)
 
void Remove ()
 
void Remove (int)
 
void Reserve (int)
 
void Reverse ()
 
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_ClassArray ()
 

Protected Member Functions

void ConstructDefaultElement (T *)
 
void DestroyElement (T &)
 
void Move (int, int, int)
 

Protected Attributes

T * m_a
 
int m_capacity
 
int m_count
 

Constructor & Destructor Documentation

◆ ON_ClassArray() [1/3]

template<class T >
ON_ClassArray< T >::ON_ClassArray ( )

◆ ON_ClassArray() [2/3]

template<class T >
ON_ClassArray< T >::ON_ClassArray ( int c)

◆ ON_ClassArray() [3/3]

template<class T >
ON_ClassArray< T >::ON_ClassArray ( const ON_ClassArray< T > & src)

◆ ~ON_ClassArray()

template<class T >
ON_ClassArray< T >::~ON_ClassArray ( )
virtual

Member Function Documentation

◆ Append() [1/2]

template<class T >
void ON_ClassArray< T >::Append ( const T & x)

◆ Append() [2/2]

template<class T >
void ON_ClassArray< T >::Append ( int count,
const T * p )

◆ AppendNew()

template<class T >
T & ON_ClassArray< T >::AppendNew ( )

◆ Array() [1/2]

template<class T >
T * ON_ClassArray< T >::Array ( )

◆ Array() [2/2]

template<class T >
const T * ON_ClassArray< T >::Array ( ) const

◆ At() [1/2]

template<class T >
T * ON_ClassArray< T >::At ( int i)

◆ At() [2/2]

template<class T >
const T * ON_ClassArray< T >::At ( int i) const

◆ BinarySearch()

template<class T >
int ON_ClassArray< T >::BinarySearch ( const T * key,
int(*)(const T *, const T *) compar ) const

◆ Capacity()

template<class T >
int ON_ClassArray< T >::Capacity ( ) const

◆ ConstructDefaultElement()

template<class T >
void ON_ClassArray< T >::ConstructDefaultElement ( T * p)
protected

◆ Count()

template<class T >
int ON_ClassArray< T >::Count ( ) const

◆ Destroy()

template<class T >
void ON_ClassArray< T >::Destroy ( )

◆ DestroyElement()

template<class T >
void ON_ClassArray< T >::DestroyElement ( T & x)
protected

◆ EmergencyDestroy()

template<class T >
void ON_ClassArray< T >::EmergencyDestroy ( void )

◆ Empty()

template<class T >
void ON_ClassArray< T >::Empty ( )

◆ First() [1/2]

template<class T >
T * ON_ClassArray< T >::First ( )

◆ First() [2/2]

template<class T >
const T * ON_ClassArray< T >::First ( ) const

◆ HeapSort()

◆ Insert()

template<class T >
void ON_ClassArray< T >::Insert ( int i,
const T & x )

◆ KeepArray()

template<class T >
T * ON_ClassArray< T >::KeepArray ( )

◆ Last() [1/2]

template<class T >
T * ON_ClassArray< T >::Last ( )

◆ Last() [2/2]

template<class T >
const T * ON_ClassArray< T >::Last ( ) const

◆ Move()

template<class T >
void ON_ClassArray< T >::Move ( int dest_i,
int src_i,
int ele_cnt )
protected

◆ NewCapacity()

template<class T >
int ON_ClassArray< T >::NewCapacity ( ) const

◆ operator const T *()

template<class T >
ON_ClassArray< T >::operator const T * ( ) const

◆ operator T*()

template<class T >
ON_ClassArray< T >::operator T* ( )

◆ operator=()

template<class T >
ON_ClassArray< T > & ON_ClassArray< T >::operator= ( const ON_ClassArray< T > & src)

◆ operator[]() [1/2]

template<class T >
T & ON_ClassArray< T >::operator[] ( int i)

◆ operator[]() [2/2]

template<class T >
const T & ON_ClassArray< T >::operator[] ( int i) const

◆ Permute()

template<class T >
bool ON_ClassArray< T >::Permute ( const int * index)

◆ QuickSort()

◆ Realloc()

◆ Remove() [1/2]

template<class T >
void ON_ClassArray< T >::Remove ( )

◆ Remove() [2/2]

template<class T >
void ON_ClassArray< T >::Remove ( int i)

◆ Reserve()

template<class T >
void ON_ClassArray< T >::Reserve ( int newcap)

◆ Reverse()

template<class T >
void ON_ClassArray< T >::Reverse ( )

◆ Search()

template<class T >
int ON_ClassArray< T >::Search ( const T * key,
int(*)(const T *, const T *) compar ) const

◆ SetArray()

template<class T >
void ON_ClassArray< T >::SetArray ( T * p)

◆ SetCapacity()

template<class T >
void ON_ClassArray< T >::SetCapacity ( int capacity)

◆ SetCount()

template<class T >
void ON_ClassArray< T >::SetCount ( int count)

◆ Shrink()

template<class T >
void ON_ClassArray< T >::Shrink ( )

◆ SizeOfArray()

template<class T >
unsigned int ON_ClassArray< T >::SizeOfArray ( ) const

◆ Sort() [1/2]

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

◆ Sort() [2/2]

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

◆ Swap()

template<class T >
void ON_ClassArray< T >::Swap ( int i,
int j )

◆ Zero()

template<class T >
void ON_ClassArray< T >::Zero ( )

Member Data Documentation

◆ m_a

template<class T >
T* ON_ClassArray< T >::m_a
protected

◆ m_capacity

template<class T >
int ON_ClassArray< T >::m_capacity
protected

◆ m_count

template<class T >
int ON_ClassArray< T >::m_count
protected

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