 |
 |
 |
 |
 |
 |
 |
 |
 |
|
|
|
|
|
|
|
|
|
| append(const oaModTerm *&element) | oaArray<oaModTerm *> | |
| append(const oaArray< oaModTerm * > &arrayIn) | oaArray<oaModTerm *> | |
| find(const oaModTerm *&element) const | oaArray<oaModTerm *> | |
| get(oaUInt4 index) const | oaArrayBase | |
| get(oaUInt4 index) | oaArrayBase | |
| getElements() const | oaArrayBase | |
| getNumElements() const | oaArrayBase | |
| getSize() const | oaArrayBase | |
| oaArray(oaUInt4 size=0) | oaArray<oaModTerm *> | |
| oaArray(const oaArray< oaModTerm * > &arrayIn) | oaArray<oaModTerm *> | |
| oaArray(const oaModTerm *arrayIn[], oaUInt4 numElementsIn) | oaArray<oaModTerm *> | |
| oaArrayBase(oaUInt4 size=0) | oaArrayBase | |
| oaArrayBase(const oaArrayBase< T > &arrayIn) | oaArrayBase | |
| oaArrayBase(const T arrayIn[], oaUInt4 numElementsIn) | oaArrayBase | |
| oaModTermArray(oaUInt4 sizeIn=0) | oaModTermArray | [inline] |
| operator!=(const oaArray< oaModTerm * > &other) const | oaArray<oaModTerm *> | |
| operator=(const oaArray< oaModTerm * > &arrayIn) | oaArray<oaModTerm *> | |
| oaArrayBase::operator=(const oaArrayBase< T > &arrayIn) | oaArrayBase | |
| operator==(const oaArray< oaModTerm * > &other) const | oaArray<oaModTerm *> | [virtual] |
| operator[](oaUInt4 i) const | oaArrayBase | |
| operator[](oaUInt4 i) | oaArrayBase | |
| remove(const oaModTerm *&element) | oaArray<oaModTerm *> | |
| set(const T *arrayIn, oaUInt4 numElementsIn) | oaArrayBase | |
| setNumElements(oaUInt4 n) | oaArrayBase | |
| setSize(oaUInt4 newSize, oaBoolean saveElements=false) | oaArrayBase | |
| sort(int(*compare)(const oaModTerm **, const oaModTerm **)) | oaArray<oaModTerm *> | |
| ~oaArray() | oaArray<oaModTerm *> | [virtual] |
| ~oaArrayBase() | oaArrayBase |
Copyright © 2002 - 2010 Cadence Design Systems, Inc.
All Rights Reserved.