msatVec.c File Reference

#include "msatInt.h"

Include dependency graph for msatVec.c:

Go to the source code of this file.

Functions
Msat_IntVec_t *	Msat_IntVecAlloc (int nCap)
	FUNCTION DEFINITIONS ///.
Msat_IntVec_t *	Msat_IntVecAllocArray (int *pArray, int nSize)
Msat_IntVec_t *	Msat_IntVecAllocArrayCopy (int *pArray, int nSize)
Msat_IntVec_t *	Msat_IntVecDup (Msat_IntVec_t *pVec)
Msat_IntVec_t *	Msat_IntVecDupArray (Msat_IntVec_t *pVec)
void	Msat_IntVecFree (Msat_IntVec_t *p)
void	Msat_IntVecFill (Msat_IntVec_t *p, int nSize, int Entry)
int *	Msat_IntVecReleaseArray (Msat_IntVec_t *p)
int *	Msat_IntVecReadArray (Msat_IntVec_t *p)
int	Msat_IntVecReadSize (Msat_IntVec_t *p)
int	Msat_IntVecReadEntry (Msat_IntVec_t *p, int i)
void	Msat_IntVecWriteEntry (Msat_IntVec_t *p, int i, int Entry)
int	Msat_IntVecReadEntryLast (Msat_IntVec_t *p)
void	Msat_IntVecGrow (Msat_IntVec_t *p, int nCapMin)
void	Msat_IntVecShrink (Msat_IntVec_t *p, int nSizeNew)
void	Msat_IntVecClear (Msat_IntVec_t *p)
void	Msat_IntVecPush (Msat_IntVec_t *p, int Entry)
int	Msat_IntVecPushUnique (Msat_IntVec_t *p, int Entry)
void	Msat_IntVecPushUniqueOrder (Msat_IntVec_t *p, int Entry, int fIncrease)
int	Msat_IntVecPop (Msat_IntVec_t *p)
void	Msat_IntVecSort (Msat_IntVec_t *p, int fReverse)

Function Documentation

Msat_IntVecAlloc()

Msat_IntVec_t * Msat_IntVecAlloc

(

int

nCap

)

FUNCTION DEFINITIONS ///.

Function*************************************************************

Synopsis [Allocates a vector with the given capacity.]

Description []

SideEffects []

SeeAlso []

Definition at line 48 of file msatVec.c.

{
    Msat_IntVec_t * p;
    p = ABC_ALLOC( Msat_IntVec_t, 1 );
    if ( nCap > 0 && nCap < 16 )
        nCap = 16;
    p->nSize  = 0;
    p->nCap   = nCap;
    p->pArray = p->nCap? ABC_ALLOC( int, p->nCap ) : NULL;
    return p;
}

Here is the caller graph for this function:

Msat_IntVecAllocArray()

Msat_IntVec_t * Msat_IntVecAllocArray	(	int *	pArray,
		int	nSize )

Function*************************************************************

Synopsis [Creates the vector from an integer array of the given size.]

Description []

SideEffects []

SeeAlso []

Definition at line 71 of file msatVec.c.

{
    Msat_IntVec_t * p;
    p = ABC_ALLOC( Msat_IntVec_t, 1 );
    p->nSize  = nSize;
    p->nCap   = nSize;
    p->pArray = pArray;
    return p;
}

Msat_IntVecAllocArrayCopy()

Msat_IntVec_t * Msat_IntVecAllocArrayCopy	(	int *	pArray,
		int	nSize )

Function*************************************************************

Synopsis [Creates the vector from an integer array of the given size.]

Description []

SideEffects []

SeeAlso []

Definition at line 92 of file msatVec.c.

{
    Msat_IntVec_t * p;
    p = ABC_ALLOC( Msat_IntVec_t, 1 );
    p->nSize  = nSize;
    p->nCap   = nSize;
    p->pArray = ABC_ALLOC( int, nSize );
    memcpy( p->pArray, pArray, sizeof(int) * nSize );
    return p;
}

Here is the call graph for this function:

Msat_IntVecClear()

void Msat_IntVecClear

(

Msat_IntVec_t *

p

)

Function*************************************************************

Synopsis []

Description []

SideEffects []

SeeAlso []

Definition at line 335 of file msatVec.c.

{
    p->nSize = 0;
}

Here is the caller graph for this function:

Msat_IntVecDup()

Msat_IntVec_t * Msat_IntVecDup

(

Msat_IntVec_t *

pVec

)

Function*************************************************************

Synopsis [Duplicates the integer array.]

Description []

SideEffects []

SeeAlso []

Definition at line 114 of file msatVec.c.

{
    Msat_IntVec_t * p;
    p = ABC_ALLOC( Msat_IntVec_t, 1 );
    p->nSize  = pVec->nSize;
    p->nCap   = pVec->nCap;
    p->pArray = p->nCap? ABC_ALLOC( int, p->nCap ) : NULL;
    memcpy( p->pArray, pVec->pArray, sizeof(int) * pVec->nSize );
    return p;
}

Here is the call graph for this function:

Msat_IntVecDupArray()

Msat_IntVec_t * Msat_IntVecDupArray

(

Msat_IntVec_t *

pVec

)

Function*************************************************************

Synopsis [Transfers the array into another vector.]

Description []

SideEffects []

SeeAlso []

Definition at line 136 of file msatVec.c.

{
    Msat_IntVec_t * p;
    p = ABC_ALLOC( Msat_IntVec_t, 1 );
    p->nSize  = pVec->nSize;
    p->nCap   = pVec->nCap;
    p->pArray = pVec->pArray;
    pVec->nSize  = 0;
    pVec->nCap   = 0;
    pVec->pArray = NULL;
    return p;
}

Msat_IntVecFill()

void Msat_IntVecFill	(	Msat_IntVec_t *	p,
		int	nSize,
		int	Entry )

Function*************************************************************

Synopsis [Fills the vector with given number of entries.]

Description []

SideEffects []

SeeAlso []

Definition at line 177 of file msatVec.c.

{
    int i;
    Msat_IntVecGrow( p, nSize );
    p->nSize = nSize;
    for ( i = 0; i < p->nSize; i++ )
        p->pArray[i] = Entry;
}

Here is the call graph for this function:

Here is the caller graph for this function:

Msat_IntVecFree()

void Msat_IntVecFree

(

Msat_IntVec_t *

p

)

Function*************************************************************

Synopsis []

Description []

SideEffects []

SeeAlso []

Definition at line 160 of file msatVec.c.

{
    ABC_FREE( p->pArray );
    ABC_FREE( p );
}

Here is the caller graph for this function:

Msat_IntVecGrow()

void Msat_IntVecGrow	(	Msat_IntVec_t *	p,
		int	nCapMin )

Function*************************************************************

Synopsis [Resizes the vector to the given capacity.]

Description []

SideEffects []

SeeAlso []

Definition at line 299 of file msatVec.c.

{
    if ( p->nCap >= nCapMin )
        return;
    p->pArray = ABC_REALLOC( int, p->pArray, nCapMin ); 
    p->nCap   = nCapMin;
}

Here is the caller graph for this function:

Msat_IntVecPop()

int Msat_IntVecPop

(

Msat_IntVec_t *

p

)

Function*************************************************************

Synopsis [Returns the last entry and removes it from the list.]

Description []

SideEffects []

SeeAlso []

Definition at line 425 of file msatVec.c.

{
    assert( p->nSize > 0 );
    return p->pArray[--p->nSize];
}

Msat_IntVecPush()

void Msat_IntVecPush	(	Msat_IntVec_t *	p,
		int	Entry )

Function*************************************************************

Synopsis []

Description []

SideEffects []

SeeAlso []

Definition at line 351 of file msatVec.c.

{
    if ( p->nSize == p->nCap )
    {
        if ( p->nCap < 16 )
            Msat_IntVecGrow( p, 16 );
        else
            Msat_IntVecGrow( p, 2 * p->nCap );
    }
    p->pArray[p->nSize++] = Entry;
}

Here is the call graph for this function:

Here is the caller graph for this function:

Msat_IntVecPushUnique()

int Msat_IntVecPushUnique	(	Msat_IntVec_t *	p,
		int	Entry )

Function*************************************************************

Synopsis [Add the element while ensuring uniqueness.]

Description [Returns 1 if the element was found, and 0 if it was new. ]

SideEffects []

SeeAlso []

Definition at line 374 of file msatVec.c.

{
    int i;
    for ( i = 0; i < p->nSize; i++ )
        if ( p->pArray[i] == Entry )
            return 1;
    Msat_IntVecPush( p, Entry );
    return 0;
}

Here is the call graph for this function:

Here is the caller graph for this function:

Msat_IntVecPushUniqueOrder()

void Msat_IntVecPushUniqueOrder	(	Msat_IntVec_t *	p,
		int	Entry,
		int	fIncrease )

Function*************************************************************

Synopsis [Inserts the element while sorting in the increasing order.]

Description []

SideEffects []

SeeAlso []

Definition at line 395 of file msatVec.c.

{
    int Entry1, Entry2;
    int i;
    Msat_IntVecPushUnique( p, Entry );
    // find the p of the node
    for ( i = p->nSize-1; i > 0; i-- )
    {
        Entry1 = p->pArray[i  ];
        Entry2 = p->pArray[i-1];
        if (( fIncrease && Entry1 >= Entry2) ||
            (!fIncrease && Entry1 <= Entry2) )
            break;
        p->pArray[i  ] = Entry2;
        p->pArray[i-1] = Entry1;
    }
}

Here is the call graph for this function:

Msat_IntVecReadArray()

int * Msat_IntVecReadArray

(

Msat_IntVec_t *

p

)

Function*************************************************************

Synopsis []

Description []

SideEffects []

SeeAlso []

Definition at line 217 of file msatVec.c.

{
    return p->pArray;
}

Here is the caller graph for this function:

Msat_IntVecReadEntry()

int Msat_IntVecReadEntry	(	Msat_IntVec_t *	p,
		int	i )

Function*************************************************************

Synopsis []

Description []

SideEffects []

SeeAlso []

Definition at line 249 of file msatVec.c.

{
    assert( i >= 0 && i < p->nSize );
    return p->pArray[i];
}

Here is the caller graph for this function:

Msat_IntVecReadEntryLast()

int Msat_IntVecReadEntryLast

(

Msat_IntVec_t *

p

)

Function*************************************************************

Synopsis []

Description []

SideEffects []

SeeAlso []

Definition at line 283 of file msatVec.c.

{
    return p->pArray[p->nSize-1];
}

Msat_IntVecReadSize()

int Msat_IntVecReadSize

(

Msat_IntVec_t *

p

)

Function*************************************************************

Synopsis []

Description []

SideEffects []

SeeAlso []

Definition at line 233 of file msatVec.c.

{
    return p->nSize;
}

Here is the caller graph for this function:

Msat_IntVecReleaseArray()

int * Msat_IntVecReleaseArray

(

Msat_IntVec_t *

p

)

Function*************************************************************

Synopsis []

Description []

SideEffects []

SeeAlso []

Definition at line 197 of file msatVec.c.

{
    int * pArray = p->pArray;
    p->nCap = 0;
    p->nSize = 0;
    p->pArray = NULL;
    return pArray;
}

Msat_IntVecShrink()

void Msat_IntVecShrink	(	Msat_IntVec_t *	p,
		int	nSizeNew )

Function*************************************************************

Synopsis []

Description []

SideEffects []

SeeAlso []

Definition at line 318 of file msatVec.c.

{
    assert( p->nSize >= nSizeNew );
    p->nSize = nSizeNew;
}

Here is the caller graph for this function:

Msat_IntVecSort()

void Msat_IntVecSort	(	Msat_IntVec_t *	p,
		int	fReverse )

Function*************************************************************

Synopsis [Sorting the entries by their integer value.]

Description []

SideEffects []

SeeAlso []

Definition at line 442 of file msatVec.c.

{
    if ( fReverse ) 
        qsort( (void *)p->pArray, (size_t)p->nSize, sizeof(int), 
                (int (*)(const void *, const void *)) Msat_IntVecSortCompare2 );
    else
        qsort( (void *)p->pArray, (size_t)p->nSize, sizeof(int), 
                (int (*)(const void *, const void *)) Msat_IntVecSortCompare1 );
}

Here is the caller graph for this function:

Msat_IntVecWriteEntry()

void Msat_IntVecWriteEntry	(	Msat_IntVec_t *	p,
		int	i,
		int	Entry )

Function*************************************************************

Synopsis []

Description []

SideEffects []

SeeAlso []

Definition at line 266 of file msatVec.c.

{
    assert( i >= 0 && i < p->nSize );
    p->pArray[i] = Entry;
}