49 if ( nCap > 0 && nCap < 16 )
140 if ( p->
nCap >= nCapMin )
216 for ( i = 0; i < p->
nSize; i++ )
217 if ( p->
pArray[i] == Entry )
253 for ( i = 0; i < p->
nSize; i++ )
254 if ( p->
pArray[i] == Entry )
257 for ( i++; i < p->
nSize; i++ )
275 assert( i >= 0 && i < p->nSize );
292 assert( i >= 0 && i < p->nSize );
328 if ( Level1 < Level2 )
330 if ( Level1 > Level2 )
void Map_NodeVecClear(Map_NodeVec_t *p)
void Map_NodeVecGrow(Map_NodeVec_t *p, int nCapMin)
Map_NodeVec_t * Map_NodeVecAlloc(int nCap)
FUNCTION DEFINITIONS ///.
#define ABC_REALLOC(type, obj, num)
Map_Node_t ** Map_NodeVecReadArray(Map_NodeVec_t *p)
Map_Node_t * Map_NodeVecPop(Map_NodeVec_t *p)
void Map_NodeVecRemove(Map_NodeVec_t *p, Map_Node_t *Entry)
void Map_NodeVecFree(Map_NodeVec_t *p)
#define ABC_ALLOC(type, num)
void Map_NodeVecWriteEntry(Map_NodeVec_t *p, int i, Map_Node_t *Entry)
int Map_NodeVecPushUnique(Map_NodeVec_t *p, Map_Node_t *Entry)
void Map_NodeVecPush(Map_NodeVec_t *p, Map_Node_t *Entry)
static ABC_NAMESPACE_IMPL_START int Map_NodeVecCompareLevels(Map_Node_t **pp1, Map_Node_t **pp2)
DECLARATIONS ///.
Map_NodeVec_t * Map_NodeVecDup(Map_NodeVec_t *p)
#define ABC_NAMESPACE_IMPL_END
void Map_NodeVecShrink(Map_NodeVec_t *p, int nSizeNew)
#define ABC_NAMESPACE_IMPL_START
Map_Node_t * Map_NodeVecReadEntry(Map_NodeVec_t *p, int i)
void Map_NodeVecSortByLevel(Map_NodeVec_t *p)
int Map_NodeVecReadSize(Map_NodeVec_t *p)