#include <opennurbs_array.h>
|
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 () |
|
◆ ON_ClassArray() [1/3]
◆ ON_ClassArray() [2/3]
◆ ON_ClassArray() [3/3]
◆ ~ON_ClassArray()
◆ Append() [1/2]
◆ Append() [2/2]
◆ AppendNew()
◆ Array() [1/2]
◆ Array() [2/2]
◆ At() [1/2]
◆ At() [2/2]
◆ BinarySearch()
◆ Capacity()
◆ ConstructDefaultElement()
◆ Count()
◆ Destroy()
◆ DestroyElement()
◆ EmergencyDestroy()
◆ Empty()
◆ First() [1/2]
◆ First() [2/2]
◆ HeapSort()
Reimplemented in 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_DimStyle >, ON_ObjectArray< ON_Font >, ON_ObjectArray< ON_Group >, ON_ObjectArray< ON_HatchPattern >, ON_ObjectArray< ON_InstanceDefinition >, ON_ObjectArray< ON_Layer >, ON_ObjectArray< ON_Linetype >, ON_ObjectArray< ON_Material >, ON_ObjectArray< ON_Texture >, ON_ObjectArray< ON_TextureMapping >, and ON_ObjectArray< T >.
◆ Insert()
◆ KeepArray()
◆ Last() [1/2]
◆ Last() [2/2]
◆ Move()
template<class T >
void ON_ClassArray< T >::Move |
( |
int | dest_i, |
|
|
int | src_i, |
|
|
int | ele_cnt ) |
|
protected |
◆ NewCapacity()
◆ operator const T *()
◆ operator T*()
◆ operator=()
◆ operator[]() [1/2]
◆ operator[]() [2/2]
◆ Permute()
◆ QuickSort()
Reimplemented in 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_DimStyle >, ON_ObjectArray< ON_Font >, ON_ObjectArray< ON_Group >, ON_ObjectArray< ON_HatchPattern >, ON_ObjectArray< ON_InstanceDefinition >, ON_ObjectArray< ON_Layer >, ON_ObjectArray< ON_Linetype >, ON_ObjectArray< ON_Material >, ON_ObjectArray< ON_Texture >, ON_ObjectArray< ON_TextureMapping >, and ON_ObjectArray< T >.
◆ Realloc()
Reimplemented in 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_DimStyle >, ON_ObjectArray< ON_Font >, ON_ObjectArray< ON_Group >, ON_ObjectArray< ON_HatchPattern >, ON_ObjectArray< ON_InstanceDefinition >, ON_ObjectArray< ON_Layer >, ON_ObjectArray< ON_Linetype >, ON_ObjectArray< ON_Material >, ON_ObjectArray< ON_Texture >, ON_ObjectArray< ON_TextureMapping >, and ON_ObjectArray< T >.
◆ Remove() [1/2]
◆ Remove() [2/2]
◆ Reserve()
◆ Reverse()
◆ Search()
◆ SetArray()
◆ SetCapacity()
◆ SetCount()
◆ Shrink()
◆ SizeOfArray()
◆ Sort() [1/2]
◆ 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()
◆ Zero()
◆ m_a
◆ m_capacity
◆ m_count
The documentation for this class was generated from the following files: