vecInt.h File Reference

#include <stdio.h>

Go to the source code of this file.

Data Structures
struct	Vec_Int_t_

Macros
#define	Vec_IntForEachEntry(vVec, Entry, i)   for ( i = 0; (i < Vec_IntSize(vVec)) && (((Entry) = Vec_IntEntry(vVec, i)), 1); i++ )
	MACRO DEFINITIONS ///. More...
#define	Vec_IntForEachEntryStart(vVec, Entry, i, Start)   for ( i = Start; (i < Vec_IntSize(vVec)) && (((Entry) = Vec_IntEntry(vVec, i)), 1); i++ )
#define	Vec_IntForEachEntryStop(vVec, Entry, i, Stop)   for ( i = 0; (i < Stop) && (((Entry) = Vec_IntEntry(vVec, i)), 1); i++ )
#define	Vec_IntForEachEntryStartStop(vVec, Entry, i, Start, Stop)   for ( i = Start; (i < Stop) && (((Entry) = Vec_IntEntry(vVec, i)), 1); i++ )
#define	Vec_IntForEachEntryReverse(vVec, pEntry, i)   for ( i = Vec_IntSize(vVec) - 1; (i >= 0) && (((pEntry) = Vec_IntEntry(vVec, i)), 1); i-- )
#define	Vec_IntForEachEntryTwo(vVec1, vVec2, Entry1, Entry2, i)   for ( i = 0; (i < Vec_IntSize(vVec1)) && (((Entry1) = Vec_IntEntry(vVec1, i)), 1) && (((Entry2) = Vec_IntEntry(vVec2, i)), 1); i++ )
#define	Vec_IntForEachEntryDouble(vVec, Entry1, Entry2, i)   for ( i = 0; (i+1 < Vec_IntSize(vVec)) && (((Entry1) = Vec_IntEntry(vVec, i)), 1) && (((Entry2) = Vec_IntEntry(vVec, i+1)), 1); i += 2 )
#define	Vec_IntForEachEntryTriple(vVec, Entry1, Entry2, Entry3, i)   for ( i = 0; (i+2 < Vec_IntSize(vVec)) && (((Entry1) = Vec_IntEntry(vVec, i)), 1) && (((Entry2) = Vec_IntEntry(vVec, i+1)), 1) && (((Entry3) = Vec_IntEntry(vVec, i+2)), 1); i += 3 )
#define	Vec_IntForEachEntryThisNext(vVec, This, Next, i)   for ( i = 0, (This) = (Next) = (Vec_IntSize(vVec) ? Vec_IntEntry(vVec, 0) : -1); (i+1 < Vec_IntSize(vVec)) && (((Next) = Vec_IntEntry(vVec, i+1)), 1); i += 2, (This) = (Next) )

Typedefs
typedef typedefABC_NAMESPACE_HEADER_START struct Vec_Int_t_	Vec_Int_t
	INCLUDES ///. More...

Functions
static Vec_Int_t *	Vec_IntAlloc (int nCap)
	FUNCTION DEFINITIONS ///. More...
static Vec_Int_t *	Vec_IntStart (int nSize)
static Vec_Int_t *	Vec_IntStartFull (int nSize)
static Vec_Int_t *	Vec_IntStartRange (int First, int Range)
static Vec_Int_t *	Vec_IntStartNatural (int nSize)
static Vec_Int_t *	Vec_IntAllocArray (int *pArray, int nSize)
static Vec_Int_t *	Vec_IntAllocArrayCopy (int *pArray, int nSize)
static Vec_Int_t *	Vec_IntDup (Vec_Int_t *pVec)
static Vec_Int_t *	Vec_IntDupArray (Vec_Int_t *pVec)
static void	Vec_IntZero (Vec_Int_t *p)
static void	Vec_IntErase (Vec_Int_t *p)
static void	Vec_IntFree (Vec_Int_t *p)
static void	Vec_IntFreeP (Vec_Int_t **p)
static int *	Vec_IntReleaseArray (Vec_Int_t *p)
static int *	Vec_IntArray (Vec_Int_t *p)
static int **	Vec_IntArrayP (Vec_Int_t *p)
static int *	Vec_IntLimit (Vec_Int_t *p)
static int	Vec_IntSize (Vec_Int_t *p)
static int	Vec_IntCap (Vec_Int_t *p)
static double	Vec_IntMemory (Vec_Int_t *p)
static int	Vec_IntEntry (Vec_Int_t *p, int i)
static int *	Vec_IntEntryP (Vec_Int_t *p, int i)
static void	Vec_IntWriteEntry (Vec_Int_t *p, int i, int Entry)
static int	Vec_IntAddToEntry (Vec_Int_t *p, int i, int Addition)
static void	Vec_IntUpdateEntry (Vec_Int_t *p, int i, int Value)
static void	Vec_IntDowndateEntry (Vec_Int_t *p, int i, int Value)
static int	Vec_IntEntryLast (Vec_Int_t *p)
static void	Vec_IntGrow (Vec_Int_t *p, int nCapMin)
static void	Vec_IntGrowResize (Vec_Int_t *p, int nCapMin)
static void	Vec_IntFill (Vec_Int_t *p, int nSize, int Fill)
static void	Vec_IntFillTwo (Vec_Int_t *p, int nSize, int FillEven, int FillOdd)
static void	Vec_IntFillExtra (Vec_Int_t *p, int nSize, int Fill)
static int	Vec_IntGetEntry (Vec_Int_t *p, int i)
static int *	Vec_IntGetEntryP (Vec_Int_t *p, int i)
static void	Vec_IntSetEntry (Vec_Int_t *p, int i, int Entry)
static void	Vec_IntSetEntryFull (Vec_Int_t *p, int i, int Entry)
static void	Vec_IntShrink (Vec_Int_t *p, int nSizeNew)
static void	Vec_IntClear (Vec_Int_t *p)
static void	Vec_IntPush (Vec_Int_t *p, int Entry)
static void	Vec_IntPushTwo (Vec_Int_t *p, int Entry1, int Entry2)
static void	Vec_IntPushArray (Vec_Int_t *p, int *pEntries, int nEntries)
static void	Vec_IntPushFirst (Vec_Int_t *p, int Entry)
static void	Vec_IntPushOrder (Vec_Int_t *p, int Entry)
static void	Vec_IntPushOrderReverse (Vec_Int_t *p, int Entry)
static int	Vec_IntPushUniqueOrder (Vec_Int_t *p, int Entry)
static int	Vec_IntPushUnique (Vec_Int_t *p, int Entry)
static unsigned *	Vec_IntFetch (Vec_Int_t *p, int nWords)
static int	Vec_IntPop (Vec_Int_t *p)
static int	Vec_IntFind (Vec_Int_t *p, int Entry)
static int	Vec_IntRemove (Vec_Int_t *p, int Entry)
static int	Vec_IntRemove1 (Vec_Int_t *p, int Entry)
static void	Vec_IntDrop (Vec_Int_t *p, int i)
static void	Vec_IntInsert (Vec_Int_t *p, int iHere, int Entry)
static int	Vec_IntFindMax (Vec_Int_t *p)
static int	Vec_IntFindMin (Vec_Int_t *p)
static void	Vec_IntReverseOrder (Vec_Int_t *p)
static void	Vec_IntRemoveOdd (Vec_Int_t *p)
static void	Vec_IntRemoveEven (Vec_Int_t *p)
static Vec_Int_t *	Vec_IntInvert (Vec_Int_t *p, int Fill)
static Vec_Int_t *	Vec_IntCondense (Vec_Int_t *p, int Fill)
static int	Vec_IntSum (Vec_Int_t *p)
static int	Vec_IntCountEntry (Vec_Int_t *p, int Entry)
static int	Vec_IntCountPositive (Vec_Int_t *p)
static int	Vec_IntCountZero (Vec_Int_t *p)
static int	Vec_IntEqual (Vec_Int_t *p1, Vec_Int_t *p2)
static int	Vec_IntCountCommon (Vec_Int_t *p1, Vec_Int_t *p2)
static int	Vec_IntSortCompare1 (int *pp1, int *pp2)
static int	Vec_IntSortCompare2 (int *pp1, int *pp2)
static void	Vec_IntSort (Vec_Int_t *p, int fReverse)
static int	Vec_IntUniqify (Vec_Int_t *p)
static int	Vec_IntCountDuplicates (Vec_Int_t *p)
static int	Vec_IntCheckUniqueSmall (Vec_Int_t *p)
static int	Vec_IntCountUnique (Vec_Int_t *p)
static unsigned	Vec_IntUniqueHashKeyDebug (unsigned char *pStr, int nChars, int TableMask)
static void	Vec_IntUniqueProfile (Vec_Int_t *vData, int *pTable, int *pNexts, int TableMask, int nIntSize)
static unsigned	Vec_IntUniqueHashKey2 (unsigned char *pStr, int nChars)
static unsigned	Vec_IntUniqueHashKey (unsigned char *pStr, int nChars)
static int *	Vec_IntUniqueLookup (Vec_Int_t *vData, int i, int nIntSize, int *pNexts, int *pStart)
static int	Vec_IntUniqueCount (Vec_Int_t *vData, int nIntSize, Vec_Int_t **pvMap)
static Vec_Int_t *	Vec_IntUniqifyHash (Vec_Int_t *vData, int nIntSize)
static int	Vec_IntSortCompareUnsigned (unsigned *pp1, unsigned *pp2)
static void	Vec_IntSortUnsigned (Vec_Int_t *p)
static int	Vec_IntTwoCountCommon (Vec_Int_t *vArr1, Vec_Int_t *vArr2)
static int	Vec_IntTwoFindCommon (Vec_Int_t *vArr1, Vec_Int_t *vArr2, Vec_Int_t *vArr)
static int	Vec_IntTwoRemoveCommon (Vec_Int_t *vArr1, Vec_Int_t *vArr2, Vec_Int_t *vArr)
static int	Vec_IntTwoRemove (Vec_Int_t *vArr1, Vec_Int_t *vArr2)
static void	Vec_IntTwoMerge2Int (Vec_Int_t *vArr1, Vec_Int_t *vArr2, Vec_Int_t *vArr)
static Vec_Int_t *	Vec_IntTwoMerge (Vec_Int_t *vArr1, Vec_Int_t *vArr2)
static void	Vec_IntTwoMerge2 (Vec_Int_t *vArr1, Vec_Int_t *vArr2, Vec_Int_t *vArr)
static void	Vec_IntTwoSplit (Vec_Int_t *vArr1, Vec_Int_t *vArr2, Vec_Int_t *vArr, Vec_Int_t *vArr1n, Vec_Int_t *vArr2n)
static void	Vec_IntSelectSort (int *pArray, int nSize)
static void	Vec_IntSelectSortCost (int *pArray, int nSize, Vec_Int_t *vCosts)
static void	Vec_IntSelectSortCost2 (int *pArray, int nSize, int *pCosts)
static void	Vec_IntPrint (Vec_Int_t *vVec)
static void	Vec_IntPrintBinary (Vec_Int_t *vVec)
static int	Vec_IntCompareVec (Vec_Int_t *p1, Vec_Int_t *p2)
static void	Vec_IntAppend (Vec_Int_t *vVec1, Vec_Int_t *vVec2)

Macro Definition Documentation

#define Vec_IntForEachEntry	(		vVec,
			Entry,
			i
	)		for ( i = 0; (i < Vec_IntSize(vVec)) && (((Entry) = Vec_IntEntry(vVec, i)), 1); i++ )

MACRO DEFINITIONS ///.

Definition at line 54 of file vecInt.h.

#define Vec_IntForEachEntryDouble	(		vVec,
			Entry1,
			Entry2,
			i
	)		for ( i = 0; (i+1 < Vec_IntSize(vVec)) && (((Entry1) = Vec_IntEntry(vVec, i)), 1) && (((Entry2) = Vec_IntEntry(vVec, i+1)), 1); i += 2 )

Definition at line 66 of file vecInt.h.

#define Vec_IntForEachEntryReverse	(		vVec,
			pEntry,
			i
	)		for ( i = Vec_IntSize(vVec) - 1; (i >= 0) && (((pEntry) = Vec_IntEntry(vVec, i)), 1); i-- )

Definition at line 62 of file vecInt.h.

#define Vec_IntForEachEntryStart	(		vVec,
			Entry,
			i,
			Start
	)		for ( i = Start; (i < Vec_IntSize(vVec)) && (((Entry) = Vec_IntEntry(vVec, i)), 1); i++ )

Definition at line 56 of file vecInt.h.

#define Vec_IntForEachEntryStartStop	(		vVec,
			Entry,
			i,
			Start,
			Stop
	)		for ( i = Start; (i < Stop) && (((Entry) = Vec_IntEntry(vVec, i)), 1); i++ )

Definition at line 60 of file vecInt.h.

#define Vec_IntForEachEntryStop	(		vVec,
			Entry,
			i,
			Stop
	)		for ( i = 0; (i < Stop) && (((Entry) = Vec_IntEntry(vVec, i)), 1); i++ )

Definition at line 58 of file vecInt.h.

#define Vec_IntForEachEntryThisNext	(		vVec,
			This,
			Next,
			i
	)		for ( i = 0, (This) = (Next) = (Vec_IntSize(vVec) ? Vec_IntEntry(vVec, 0) : -1); (i+1 < Vec_IntSize(vVec)) && (((Next) = Vec_IntEntry(vVec, i+1)), 1); i += 2, (This) = (Next) )

Definition at line 70 of file vecInt.h.

#define Vec_IntForEachEntryTriple	(		vVec,
			Entry1,
			Entry2,
			Entry3,
			i
	)		for ( i = 0; (i+2 < Vec_IntSize(vVec)) && (((Entry1) = Vec_IntEntry(vVec, i)), 1) && (((Entry2) = Vec_IntEntry(vVec, i+1)), 1) && (((Entry3) = Vec_IntEntry(vVec, i+2)), 1); i += 3 )

Definition at line 68 of file vecInt.h.

#define Vec_IntForEachEntryTwo	(		vVec1,
			vVec2,
			Entry1,
			Entry2,
			i
	)		for ( i = 0; (i < Vec_IntSize(vVec1)) && (((Entry1) = Vec_IntEntry(vVec1, i)), 1) && (((Entry2) = Vec_IntEntry(vVec2, i)), 1); i++ )

Definition at line 64 of file vecInt.h.

Typedef Documentation

typedef typedefABC_NAMESPACE_HEADER_START struct Vec_Int_t_ Vec_Int_t

INCLUDES ///.

CFile****************************************************************

FileName [vecInt.h]

SystemName [ABC: Logic synthesis and verification system.]

PackageName [Resizable arrays.]

Synopsis [Resizable arrays of integers.]

Author [Alan Mishchenko]

Affiliation [UC Berkeley]

Date [Ver. 1.0. Started - June 20, 2005.]

Revision [

Id:

vecInt.h,v 1.00 2005/06/20 00:00:00 alanmi Exp

]PARAMETERS ///BASIC TYPES ///

Definition at line 42 of file vecInt.h.

Function Documentation

static int Vec_IntAddToEntry ( Vec_Int_t *  p, int  i, int  Addition  )

inlinestatic

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

Synopsis []

Description []

SideEffects []

SeeAlso []

Definition at line 451 of file vecInt.h.

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

static Vec_Int_t* Vec_IntAlloc ( int  nCap )

inlinestatic

FUNCTION DEFINITIONS ///.

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

Synopsis [Allocates a vector with the given capacity.]

Description []

SideEffects []

SeeAlso []

Definition at line 88 of file vecInt.h.

{
    Vec_Int_t * p;
    p = ABC_ALLOC( Vec_Int_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;
}

static Vec_Int_t* Vec_IntAllocArray ( int *  pArray, int  nSize  )

inlinestatic

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

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

Description []

SideEffects []

SeeAlso []

Definition at line 171 of file vecInt.h.

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

static Vec_Int_t* Vec_IntAllocArrayCopy ( int *  pArray, int  nSize  )

inlinestatic

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

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

Description []

SideEffects []

SeeAlso []

Definition at line 192 of file vecInt.h.

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

static void Vec_IntAppend ( Vec_Int_t *  vVec1, Vec_Int_t *  vVec2  )

inlinestatic

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

Synopsis [Appends the contents of the second vector.]

Description []

SideEffects []

SeeAlso []

Definition at line 1849 of file vecInt.h.

{
    int Entry, i;
    Vec_IntForEachEntry( vVec2, Entry, i )
        Vec_IntPush( vVec1, Entry );
}

static int* Vec_IntArray ( Vec_Int_t *  p )

inlinestatic

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

Synopsis []

Description []

SideEffects []

SeeAlso []

Definition at line 328 of file vecInt.h.

{
    return p->pArray;
}

static int** Vec_IntArrayP ( Vec_Int_t *  p )

inlinestatic

Definition at line 332 of file vecInt.h.

{
    return &p->pArray;
}

static int Vec_IntCap ( Vec_Int_t *  p )

inlinestatic

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

Synopsis []

Description []

SideEffects []

SeeAlso []

Definition at line 368 of file vecInt.h.

{
    return p->nCap;
}

static int Vec_IntCheckUniqueSmall ( Vec_Int_t *  p )

inlinestatic

Definition at line 1336 of file vecInt.h.

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

static void Vec_IntClear ( Vec_Int_t *  p )

inlinestatic

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

Synopsis []

Description []

SideEffects []

SeeAlso []

Definition at line 674 of file vecInt.h.

{
    p->nSize = 0;
}

static int Vec_IntCompareVec ( Vec_Int_t *  p1, Vec_Int_t *  p2  )

inlinestatic

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

Synopsis []

Description []

SideEffects []

SeeAlso []

Definition at line 1829 of file vecInt.h.

{
    if ( p1 == NULL || p2 == NULL )
        return (p1 != NULL) - (p2 != NULL);
    if ( Vec_IntSize(p1) != Vec_IntSize(p2) )
        return Vec_IntSize(p1) - Vec_IntSize(p2);
    return memcmp( Vec_IntArray(p1), Vec_IntArray(p2), sizeof(int)*Vec_IntSize(p1) );
}

static Vec_Int_t* Vec_IntCondense ( Vec_Int_t *  p, int  Fill  )

inlinestatic

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

Synopsis []

Description []

SideEffects []

SeeAlso []

Definition at line 1116 of file vecInt.h.

{
    int Entry, i;
    Vec_Int_t * vRes = Vec_IntAlloc( Vec_IntSize(p) );
    Vec_IntForEachEntry( p, Entry, i )
        if ( Entry != Fill )
            Vec_IntPush( vRes, Entry );
    return vRes;
}

static int Vec_IntCountCommon ( Vec_Int_t *  p1, Vec_Int_t *  p2  )

inlinestatic

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

Synopsis [Counts the number of common entries.]

Description [Assumes that the entries are non-negative integers that are not very large, so inversion of the array can be performed.]

SideEffects []

SeeAlso []

Definition at line 1224 of file vecInt.h.

{
    Vec_Int_t * vTemp;
    int Entry, i, Counter = 0;
    if ( Vec_IntSize(p1) < Vec_IntSize(p2) )
        vTemp = p1, p1 = p2, p2 = vTemp;
    assert( Vec_IntSize(p1) >= Vec_IntSize(p2) );
    vTemp = Vec_IntInvert( p2, -1 );
    Vec_IntFillExtra( vTemp, Vec_IntFindMax(p1) + 1, -1 );
    Vec_IntForEachEntry( p1, Entry, i )
        if ( Vec_IntEntry(vTemp, Entry) >= 0 )
            Counter++;
    Vec_IntFree( vTemp );
    return Counter;
}

static int Vec_IntCountDuplicates ( Vec_Int_t *  p )

inlinestatic

Definition at line 1327 of file vecInt.h.

{
    int RetValue;
    Vec_Int_t * pDup = Vec_IntDup( p );
    Vec_IntUniqify( pDup );
    RetValue = Vec_IntSize(p) - Vec_IntSize(pDup);
    Vec_IntFree( pDup );
    return RetValue;
}

static int Vec_IntCountEntry ( Vec_Int_t *  p, int  Entry  )

inlinestatic

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

Synopsis []

Description []

SideEffects []

SeeAlso []

Definition at line 1156 of file vecInt.h.

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

static int Vec_IntCountPositive ( Vec_Int_t *  p )

inlinestatic

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

Synopsis []

Description []

SideEffects []

SeeAlso []

Definition at line 1175 of file vecInt.h.

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

static int Vec_IntCountUnique ( Vec_Int_t *  p )

inlinestatic

Definition at line 1345 of file vecInt.h.

{
    int i, Count = 0, Max = Vec_IntFindMax(p);
    unsigned char * pPres = ABC_CALLOC( unsigned char, Max+1 );
    for ( i = 0; i < p->nSize; i++ )
        if ( pPres[p->pArray[i]] == 0 )
            pPres[p->pArray[i]] = 1, Count++;
    ABC_FREE( pPres );
    return Count;
}

static int Vec_IntCountZero ( Vec_Int_t *  p )

inlinestatic

Definition at line 1182 of file vecInt.h.

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

static void Vec_IntDowndateEntry ( Vec_Int_t *  p, int  i, int  Value  )

inlinestatic

Definition at line 473 of file vecInt.h.

{
    if ( Vec_IntEntry( p, i ) > Value )
        Vec_IntWriteEntry( p, i, Value );
}

static void Vec_IntDrop ( Vec_Int_t *  p, int  i  )

inlinestatic

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

Synopsis []

Description []

SideEffects []

SeeAlso []

Definition at line 955 of file vecInt.h.

{
    int k;
    assert( i >= 0 && i < Vec_IntSize(p) );
    p->nSize--;
    for ( k = i; k < p->nSize; k++ )
        p->pArray[k] = p->pArray[k+1];
}

static Vec_Int_t* Vec_IntDup ( Vec_Int_t *  pVec )

inlinestatic

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

Synopsis [Duplicates the integer array.]

Description []

SideEffects []

SeeAlso []

Definition at line 214 of file vecInt.h.

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

static Vec_Int_t* Vec_IntDupArray ( Vec_Int_t *  pVec )

inlinestatic

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

Synopsis [Transfers the array into another vector.]

Description []

SideEffects []

SeeAlso []

Definition at line 236 of file vecInt.h.

{
    Vec_Int_t * p;
    p = ABC_ALLOC( Vec_Int_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;
}

static int Vec_IntEntry ( Vec_Int_t *  p, int  i  )

inlinestatic

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

Synopsis []

Description []

SideEffects []

SeeAlso []

Definition at line 400 of file vecInt.h.

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

static int Vec_IntEntryLast ( Vec_Int_t *  p )

inlinestatic

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

Synopsis []

Description []

SideEffects []

SeeAlso []

Definition at line 490 of file vecInt.h.

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

static int* Vec_IntEntryP ( Vec_Int_t *  p, int  i  )

inlinestatic

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

Synopsis []

Description []

SideEffects []

SeeAlso []

Definition at line 417 of file vecInt.h.

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

static int Vec_IntEqual ( Vec_Int_t *  p1, Vec_Int_t *  p2  )

inlinestatic

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

Synopsis [Checks if two vectors are equal.]

Description []

SideEffects []

SeeAlso []

Definition at line 1201 of file vecInt.h.

{
    int i;
    if ( p1->nSize != p2->nSize )
        return 0;
    for ( i = 0; i < p1->nSize; i++ )
        if ( p1->pArray[i] != p2->pArray[i] )
            return 0;
    return 1;
}

static void Vec_IntErase ( Vec_Int_t *  p )

inlinestatic

Definition at line 266 of file vecInt.h.

{
    ABC_FREE( p->pArray );
    p->nSize = 0;
    p->nCap = 0;
}

static unsigned* Vec_IntFetch ( Vec_Int_t *  p, int  nWords  )

inlinestatic

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

Synopsis [Returns the pointer to the next nWords entries in the vector.]

Description []

SideEffects []

SeeAlso []

Definition at line 853 of file vecInt.h.

{
    if ( nWords == 0 )
        return NULL;
    assert( nWords > 0 );
    p->nSize += nWords;
    if ( p->nSize > p->nCap )
    {
//         Vec_IntGrow( p, 2 * p->nSize );
        return NULL;
    }
    return ((unsigned *)p->pArray) + p->nSize - nWords;
}

static void Vec_IntFill ( Vec_Int_t *  p, int  nSize, int  Fill  )

inlinestatic

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

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

Description []

SideEffects []

SeeAlso []

Definition at line 548 of file vecInt.h.

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

static void Vec_IntFillExtra ( Vec_Int_t *  p, int  nSize, int  Fill  )

inlinestatic

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

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

Description []

SideEffects []

SeeAlso []

Definition at line 576 of file vecInt.h.

{
    int i;
    if ( nSize <= p->nSize )
        return;
    if ( nSize > 2 * p->nCap )
        Vec_IntGrow( p, nSize );
    else if ( nSize > p->nCap )
        Vec_IntGrow( p, 2 * p->nCap );
    for ( i = p->nSize; i < nSize; i++ )
        p->pArray[i] = Fill;
    p->nSize = nSize;
}

static void Vec_IntFillTwo ( Vec_Int_t *  p, int  nSize, int  FillEven, int  FillOdd  )

inlinestatic

Definition at line 556 of file vecInt.h.

{
    int i;
    Vec_IntGrow( p, nSize );
    for ( i = 0; i < nSize; i++ )
        p->pArray[i] = (i & 1) ? FillOdd : FillEven;
    p->nSize = nSize;
}

static int Vec_IntFind ( Vec_Int_t *  p, int  Entry  )

inlinestatic

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

Synopsis [Find entry.]

Description []

SideEffects []

SeeAlso []

Definition at line 895 of file vecInt.h.

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

static int Vec_IntFindMax ( Vec_Int_t *  p )

inlinestatic

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

Synopsis [Find entry.]

Description []

SideEffects []

SeeAlso []

Definition at line 996 of file vecInt.h.

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

static int Vec_IntFindMin ( Vec_Int_t *  p )

inlinestatic

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

Synopsis [Find entry.]

Description []

SideEffects []

SeeAlso []

Definition at line 1019 of file vecInt.h.

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

static void Vec_IntFree ( Vec_Int_t *  p )

inlinestatic

Definition at line 272 of file vecInt.h.

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

static void Vec_IntFreeP ( Vec_Int_t **  p )

inlinestatic

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

Synopsis []

Description []

SideEffects []

SeeAlso []

Definition at line 289 of file vecInt.h.

{
    if ( *p == NULL )
        return;
    ABC_FREE( (*p)->pArray );
    ABC_FREE( (*p) );
}

static int Vec_IntGetEntry ( Vec_Int_t *  p, int  i  )

inlinestatic

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

Synopsis [Returns the entry even if the place not exist.]

Description []

SideEffects []

SeeAlso []

Definition at line 601 of file vecInt.h.

{
    Vec_IntFillExtra( p, i + 1, 0 );
    return Vec_IntEntry( p, i );
}

static int* Vec_IntGetEntryP ( Vec_Int_t *  p, int  i  )

inlinestatic

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

Synopsis [Returns the entry even if the place not exist.]

Description []

SideEffects []

SeeAlso []

Definition at line 618 of file vecInt.h.

{
    Vec_IntFillExtra( p, i + 1, 0 );
    return Vec_IntEntryP( p, i );
}

static void Vec_IntGrow ( Vec_Int_t *  p, int  nCapMin  )

inlinestatic

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

Synopsis [Resizes the vector to the given capacity.]

Description []

SideEffects []

SeeAlso []

Definition at line 507 of file vecInt.h.

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

static void Vec_IntGrowResize ( Vec_Int_t *  p, int  nCapMin  )

inlinestatic

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

Synopsis [Resizes the vector to the given capacity.]

Description []

SideEffects []

SeeAlso []

Definition at line 527 of file vecInt.h.

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

static void Vec_IntInsert ( Vec_Int_t *  p, int  iHere, int  Entry  )

inlinestatic

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

Synopsis [Interts entry at the index iHere. Shifts other entries.]

Description []

SideEffects []

SeeAlso []

Definition at line 975 of file vecInt.h.

{
    int i;
    assert( iHere >= 0 && iHere < p->nSize );
    Vec_IntPush( p, 0 );
    for ( i = p->nSize - 1; i > iHere; i-- )
        p->pArray[i] = p->pArray[i-1];
    p->pArray[i] = Entry;
}

static Vec_Int_t* Vec_IntInvert ( Vec_Int_t *  p, int  Fill  )

inlinestatic

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

Synopsis []

Description []

SideEffects []

SeeAlso []

Definition at line 1092 of file vecInt.h.

{
    int Entry, i;
    Vec_Int_t * vRes = Vec_IntAlloc( 0 );
    if ( Vec_IntSize(p) == 0 )
        return vRes;
    Vec_IntFill( vRes, Vec_IntFindMax(p) + 1, Fill );
    Vec_IntForEachEntry( p, Entry, i )
        if ( Entry != Fill )
            Vec_IntWriteEntry( vRes, Entry, i );
    return vRes;
}

static int* Vec_IntLimit ( Vec_Int_t *  p )

inlinestatic

Definition at line 336 of file vecInt.h.

{
    return p->pArray + p->nSize;
}

static double Vec_IntMemory ( Vec_Int_t *  p )

inlinestatic

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

Synopsis []

Description []

SideEffects []

SeeAlso []

Definition at line 384 of file vecInt.h.

{
    return !p ? 0.0 : 1.0 * sizeof(int) * p->nCap + sizeof(Vec_Int_t) ;
}

static int Vec_IntPop ( Vec_Int_t *  p )

inlinestatic

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

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

Description []

SideEffects []

SeeAlso []

Definition at line 878 of file vecInt.h.

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

static void Vec_IntPrint ( Vec_Int_t *  vVec )

inlinestatic

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

Synopsis []

Description []

SideEffects []

SeeAlso []

Definition at line 1803 of file vecInt.h.

{
    int i, Entry;
    printf( "Vector has %d entries: {", Vec_IntSize(vVec) );
    Vec_IntForEachEntry( vVec, Entry, i )
        printf( " %d", Entry );
    printf( " }\n" );
}

static void Vec_IntPrintBinary ( Vec_Int_t *  vVec )

inlinestatic

Definition at line 1811 of file vecInt.h.

{
    int i, Entry;
    Vec_IntForEachEntry( vVec, Entry, i )
        printf( "%d", (int)(Entry != 0) );
}

static void Vec_IntPush ( Vec_Int_t *  p, int  Entry  )

inlinestatic

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

Synopsis []

Description []

SideEffects []

SeeAlso []

Definition at line 690 of file vecInt.h.

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

static void Vec_IntPushArray ( Vec_Int_t *  p, int *  pEntries, int  nEntries  )

inlinestatic

Definition at line 706 of file vecInt.h.

{
    int i;
    for ( i = 0; i < nEntries; i++ )
        Vec_IntPush( p, pEntries[i] );
}

static void Vec_IntPushFirst ( Vec_Int_t *  p, int  Entry  )

inlinestatic

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

Synopsis []

Description []

SideEffects []

SeeAlso []

Definition at line 724 of file vecInt.h.

{
    int i;
    if ( p->nSize == p->nCap )
    {
        if ( p->nCap < 16 )
            Vec_IntGrow( p, 16 );
        else
            Vec_IntGrow( p, 2 * p->nCap );
    }
    p->nSize++;
    for ( i = p->nSize - 1; i >= 1; i-- )
        p->pArray[i] = p->pArray[i-1];
    p->pArray[0] = Entry;
}

static void Vec_IntPushOrder ( Vec_Int_t *  p, int  Entry  )

inlinestatic

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

Synopsis [Inserts the entry while preserving the increasing order.]

Description []

SideEffects []

SeeAlso []

Definition at line 751 of file vecInt.h.

{
    int i;
    if ( p->nSize == p->nCap )
    {
        if ( p->nCap < 16 )
            Vec_IntGrow( p, 16 );
        else
            Vec_IntGrow( p, 2 * p->nCap );
    }
    p->nSize++;
    for ( i = p->nSize-2; i >= 0; i-- )
        if ( p->pArray[i] > Entry )
            p->pArray[i+1] = p->pArray[i];
        else
            break;
    p->pArray[i+1] = Entry;
}

static void Vec_IntPushOrderReverse ( Vec_Int_t *  p, int  Entry  )

inlinestatic

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

Synopsis [Inserts the entry while preserving the increasing order.]

Description []

SideEffects []

SeeAlso []

Definition at line 781 of file vecInt.h.

{
    int i;
    if ( p->nSize == p->nCap )
    {
        if ( p->nCap < 16 )
            Vec_IntGrow( p, 16 );
        else
            Vec_IntGrow( p, 2 * p->nCap );
    }
    p->nSize++;
    for ( i = p->nSize-2; i >= 0; i-- )
        if ( p->pArray[i] < Entry )
            p->pArray[i+1] = p->pArray[i];
        else
            break;
    p->pArray[i+1] = Entry;
}

static void Vec_IntPushTwo ( Vec_Int_t *  p, int  Entry1, int  Entry2  )

inlinestatic

Definition at line 701 of file vecInt.h.

{
    Vec_IntPush( p, Entry1 );
    Vec_IntPush( p, Entry2 );
}

static int Vec_IntPushUnique ( Vec_Int_t *  p, int  Entry  )

inlinestatic

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

Synopsis []

Description []

SideEffects []

SeeAlso []

Definition at line 832 of file vecInt.h.

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

static int Vec_IntPushUniqueOrder ( Vec_Int_t *  p, int  Entry  )

inlinestatic

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

Synopsis [Inserts the entry while preserving the increasing order.]

Description []

SideEffects []

SeeAlso []

Definition at line 811 of file vecInt.h.

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

static int* Vec_IntReleaseArray ( Vec_Int_t *  p )

inlinestatic

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

Synopsis []

Description []

SideEffects []

SeeAlso []

Definition at line 308 of file vecInt.h.

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

static int Vec_IntRemove ( Vec_Int_t *  p, int  Entry  )

inlinestatic

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

Synopsis []

Description []

SideEffects []

SeeAlso []

Definition at line 915 of file vecInt.h.

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

static int Vec_IntRemove1 ( Vec_Int_t *  p, int  Entry  )

inlinestatic

Definition at line 929 of file vecInt.h.

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

static void Vec_IntRemoveEven ( Vec_Int_t *  p )

inlinestatic

Definition at line 1072 of file vecInt.h.

{
    int i;
    assert( (p->nSize & 1) == 0 );
    p->nSize >>= 1;
    for ( i = 0; i < p->nSize; i++ )
        p->pArray[i] = p->pArray[2*i+1];
}

static void Vec_IntRemoveOdd ( Vec_Int_t *  p )

inlinestatic

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

Synopsis [Removes odd entries.]

Description []

SideEffects []

SeeAlso []

Definition at line 1064 of file vecInt.h.

{
    int i;
    assert( (p->nSize & 1) == 0 );
    p->nSize >>= 1;
    for ( i = 0; i < p->nSize; i++ )
        p->pArray[i] = p->pArray[2*i];
}

static void Vec_IntReverseOrder ( Vec_Int_t *  p )

inlinestatic

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

Synopsis [Reverses the order of entries.]

Description []

SideEffects []

SeeAlso []

Definition at line 1042 of file vecInt.h.

{
    int i, Temp;
    for ( i = 0; i < p->nSize/2; i++ )
    {
        Temp = p->pArray[i];
        p->pArray[i] = p->pArray[p->nSize-1-i];
        p->pArray[p->nSize-1-i] = Temp;
    }
}

static void Vec_IntSelectSort ( int *  pArray, int  nSize  )

inlinestatic

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

Synopsis []

Description []

SideEffects []

SeeAlso []

Definition at line 1740 of file vecInt.h.

{
    int temp, i, j, best_i;
    for ( i = 0; i < nSize-1; i++ )
    {
        best_i = i;
        for ( j = i+1; j < nSize; j++ )
            if ( pArray[j] < pArray[best_i] )
                best_i = j;
        temp = pArray[i]; 
        pArray[i] = pArray[best_i]; 
        pArray[best_i] = temp;
    }
}

static void Vec_IntSelectSortCost ( int *  pArray, int  nSize, Vec_Int_t *  vCosts  )

inlinestatic

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

Synopsis []

Description []

SideEffects []

SeeAlso []

Definition at line 1766 of file vecInt.h.

{
    int i, j, best_i;
    for ( i = 0; i < nSize-1; i++ )
    {
        best_i = i;
        for ( j = i+1; j < nSize; j++ )
            if ( Vec_IntEntry(vCosts, pArray[j]) < Vec_IntEntry(vCosts, pArray[best_i]) )
                best_i = j;
        ABC_SWAP( int, pArray[i], pArray[best_i] );
    }
}

static void Vec_IntSelectSortCost2 ( int *  pArray, int  nSize, int *  pCosts  )

inlinestatic

Definition at line 1778 of file vecInt.h.

{
    int i, j, best_i;
    for ( i = 0; i < nSize-1; i++ )
    {
        best_i = i;
        for ( j = i+1; j < nSize; j++ )
            if ( pCosts[j] < pCosts[best_i] )
                best_i = j;
        ABC_SWAP( int, pArray[i], pArray[best_i] );
        ABC_SWAP( int, pCosts[i], pCosts[best_i] );
    }
}

static void Vec_IntSetEntry ( Vec_Int_t *  p, int  i, int  Entry  )

inlinestatic

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

Synopsis [Inserts the entry even if the place does not exist.]

Description []

SideEffects []

SeeAlso []

Definition at line 635 of file vecInt.h.

{
    Vec_IntFillExtra( p, i + 1, 0 );
    Vec_IntWriteEntry( p, i, Entry );
}

static void Vec_IntSetEntryFull ( Vec_Int_t *  p, int  i, int  Entry  )

inlinestatic

Definition at line 640 of file vecInt.h.

{
    Vec_IntFillExtra( p, i + 1, -1 );
    Vec_IntWriteEntry( p, i, Entry );
}

static void Vec_IntShrink ( Vec_Int_t *  p, int  nSizeNew  )

inlinestatic

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

Synopsis []

Description []

SideEffects []

SeeAlso []

Definition at line 657 of file vecInt.h.

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

static int Vec_IntSize ( Vec_Int_t *  p )

inlinestatic

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

Synopsis []

Description []

SideEffects []

SeeAlso []

Definition at line 352 of file vecInt.h.

{
    return p->nSize;
}

static void Vec_IntSort ( Vec_Int_t *  p, int  fReverse  )

inlinestatic

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

Synopsis [Sorting the entries by their integer value.]

Description []

SideEffects []

SeeAlso []

Definition at line 1293 of file vecInt.h.

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

static int Vec_IntSortCompare1 ( int *  pp1, int *  pp2  )

static

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

Synopsis [Comparison procedure for two integers.]

Description []

SideEffects []

SeeAlso []

Definition at line 1251 of file vecInt.h.

{
    // for some reason commenting out lines (as shown) led to crashing of the release version
    if ( *pp1 < *pp2 )
        return -1;
    if ( *pp1 > *pp2 ) //
        return 1;
    return 0; //
}

static int Vec_IntSortCompare2 ( int *  pp1, int *  pp2  )

static

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

Synopsis [Comparison procedure for two integers.]

Description []

SideEffects []

SeeAlso []

Definition at line 1272 of file vecInt.h.

{
    // for some reason commenting out lines (as shown) led to crashing of the release version
    if ( *pp1 > *pp2 )
        return -1;
    if ( *pp1 < *pp2 ) //
        return 1;
    return 0; //
}

static int Vec_IntSortCompareUnsigned ( unsigned *  pp1, unsigned *  pp2  )

inlinestatic

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

Synopsis [Comparison procedure for two integers.]

Description []

SideEffects []

SeeAlso []

Definition at line 1491 of file vecInt.h.

{
    if ( *pp1 < *pp2 )
        return -1;
    if ( *pp1 > *pp2 )
        return 1;
    return 0;
}

static void Vec_IntSortUnsigned ( Vec_Int_t *  p )

inlinestatic

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

Synopsis [Sorting the entries by their integer value.]

Description []

SideEffects []

SeeAlso []

Definition at line 1511 of file vecInt.h.

{
    qsort( (void *)p->pArray, p->nSize, sizeof(int), 
            (int (*)(const void *, const void *)) Vec_IntSortCompareUnsigned );
}

static Vec_Int_t* Vec_IntStart ( int  nSize )

inlinestatic

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

Synopsis [Allocates a vector with the given size and cleans it.]

Description []

SideEffects []

SeeAlso []

Definition at line 111 of file vecInt.h.

{
    Vec_Int_t * p;
    p = Vec_IntAlloc( nSize );
    p->nSize = nSize;
    memset( p->pArray, 0, sizeof(int) * nSize );
    return p;
}

static Vec_Int_t* Vec_IntStartFull ( int  nSize )

inlinestatic

Definition at line 119 of file vecInt.h.

{
    Vec_Int_t * p;
    p = Vec_IntAlloc( nSize );
    p->nSize = nSize;
    memset( p->pArray, 0xff, sizeof(int) * nSize );
    return p;
}

static Vec_Int_t* Vec_IntStartNatural ( int  nSize )

inlinestatic

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

Synopsis [Allocates a vector with the given size and cleans it.]

Description []

SideEffects []

SeeAlso []

Definition at line 149 of file vecInt.h.

{
    Vec_Int_t * p;
    int i;
    p = Vec_IntAlloc( nSize );
    p->nSize = nSize;
    for ( i = 0; i < nSize; i++ )
        p->pArray[i] = i;
    return p;
}

static Vec_Int_t* Vec_IntStartRange ( int  First, int  Range  )

inlinestatic

Definition at line 127 of file vecInt.h.

{
    Vec_Int_t * p;
    int i;
    p = Vec_IntAlloc( Range );
    p->nSize = Range;
    for ( i = 0; i < Range; i++ )
        p->pArray[i] = First + i;
    return p;
}

static int Vec_IntSum ( Vec_Int_t *  p )

inlinestatic

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

Synopsis []

Description []

SideEffects []

SeeAlso []

Definition at line 1137 of file vecInt.h.

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

static int Vec_IntTwoCountCommon ( Vec_Int_t *  vArr1, Vec_Int_t *  vArr2  )

inlinestatic

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

Synopsis [Returns the number of common entries.]

Description [Assumes that the vectors are sorted in the increasing order.]

SideEffects []

SeeAlso []

Definition at line 1528 of file vecInt.h.

{
    int * pBeg1 = vArr1->pArray;
    int * pBeg2 = vArr2->pArray;
    int * pEnd1 = vArr1->pArray + vArr1->nSize;
    int * pEnd2 = vArr2->pArray + vArr2->nSize;
    int Counter = 0;
    while ( pBeg1 < pEnd1 && pBeg2 < pEnd2 )
    {
        if ( *pBeg1 == *pBeg2 )
            pBeg1++, pBeg2++, Counter++;
        else if ( *pBeg1 < *pBeg2 )
            pBeg1++;
        else 
            pBeg2++;
    }
    return Counter;
}

static int Vec_IntTwoFindCommon ( Vec_Int_t *  vArr1, Vec_Int_t *  vArr2, Vec_Int_t *  vArr  )

inlinestatic

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

Synopsis [Collects common entries.]

Description [Assumes that the vectors are sorted in the increasing order.]

SideEffects []

SeeAlso []

Definition at line 1558 of file vecInt.h.

{
    int * pBeg1 = vArr1->pArray;
    int * pBeg2 = vArr2->pArray;
    int * pEnd1 = vArr1->pArray + vArr1->nSize;
    int * pEnd2 = vArr2->pArray + vArr2->nSize;
    Vec_IntClear( vArr );
    while ( pBeg1 < pEnd1 && pBeg2 < pEnd2 )
    {
        if ( *pBeg1 == *pBeg2 )
            Vec_IntPush( vArr, *pBeg1 ), pBeg1++, pBeg2++;
        else if ( *pBeg1 < *pBeg2 )
            pBeg1++;
        else 
            pBeg2++;
    }
    return Vec_IntSize(vArr);
}

static Vec_Int_t* Vec_IntTwoMerge ( Vec_Int_t *  vArr1, Vec_Int_t *  vArr2  )

inlinestatic

Definition at line 1684 of file vecInt.h.

{
    Vec_Int_t * vArr = Vec_IntAlloc( vArr1->nSize + vArr2->nSize ); 
    Vec_IntTwoMerge2Int( vArr1, vArr2, vArr );
    return vArr;
}

static void Vec_IntTwoMerge2 ( Vec_Int_t *  vArr1, Vec_Int_t *  vArr2, Vec_Int_t *  vArr  )

inlinestatic

Definition at line 1690 of file vecInt.h.

{
    Vec_IntGrow( vArr, Vec_IntSize(vArr1) + Vec_IntSize(vArr2) );
    Vec_IntTwoMerge2Int( vArr1, vArr2, vArr );
}

static void Vec_IntTwoMerge2Int ( Vec_Int_t *  vArr1, Vec_Int_t *  vArr2, Vec_Int_t *  vArr  )

inlinestatic

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

Synopsis [Returns the result of merging the two vectors.]

Description [Assumes that the vectors are sorted in the increasing order.]

SideEffects []

SeeAlso []

Definition at line 1659 of file vecInt.h.

{
    int * pBeg  = vArr->pArray;
    int * pBeg1 = vArr1->pArray;
    int * pBeg2 = vArr2->pArray;
    int * pEnd1 = vArr1->pArray + vArr1->nSize;
    int * pEnd2 = vArr2->pArray + vArr2->nSize;
    while ( pBeg1 < pEnd1 && pBeg2 < pEnd2 )
    {
        if ( *pBeg1 == *pBeg2 )
            *pBeg++ = *pBeg1++, pBeg2++;
        else if ( *pBeg1 < *pBeg2 )
            *pBeg++ = *pBeg1++;
        else 
            *pBeg++ = *pBeg2++;
    }
    while ( pBeg1 < pEnd1 )
        *pBeg++ = *pBeg1++;
    while ( pBeg2 < pEnd2 )
        *pBeg++ = *pBeg2++;
    vArr->nSize = pBeg - vArr->pArray;
    assert( vArr->nSize <= vArr->nCap );
    assert( vArr->nSize >= vArr1->nSize );
    assert( vArr->nSize >= vArr2->nSize );
}

static int Vec_IntTwoRemove ( Vec_Int_t *  vArr1, Vec_Int_t *  vArr2  )

inlinestatic

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

Synopsis [Removes entries of the second one from the first one.]

Description [Assumes that the vectors are sorted in the increasing order.]

SideEffects []

SeeAlso []

Definition at line 1626 of file vecInt.h.

{
    int * pBeg1 = vArr1->pArray;
    int * pBeg2 = vArr2->pArray;
    int * pEnd1 = vArr1->pArray + vArr1->nSize;
    int * pEnd2 = vArr2->pArray + vArr2->nSize;
    int * pBeg1New = vArr1->pArray;
    while ( pBeg1 < pEnd1 && pBeg2 < pEnd2 )
    {
        if ( *pBeg1 == *pBeg2 )
            pBeg1++, pBeg2++;
        else if ( *pBeg1 < *pBeg2 )
            *pBeg1New++ = *pBeg1++;
        else 
            pBeg2++;
    }
    while ( pBeg1 < pEnd1 )
        *pBeg1New++ = *pBeg1++;
    Vec_IntShrink( vArr1, pBeg1New - vArr1->pArray );
    return Vec_IntSize(vArr1);
}

static int Vec_IntTwoRemoveCommon ( Vec_Int_t *  vArr1, Vec_Int_t *  vArr2, Vec_Int_t *  vArr  )

inlinestatic

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

Synopsis [Collects and removes common entries]

Description [Assumes that the vectors are sorted in the increasing order.]

SideEffects []

SeeAlso []

Definition at line 1588 of file vecInt.h.

{
    int * pBeg1 = vArr1->pArray;
    int * pBeg2 = vArr2->pArray;
    int * pEnd1 = vArr1->pArray + vArr1->nSize;
    int * pEnd2 = vArr2->pArray + vArr2->nSize;
    int * pBeg1New = vArr1->pArray;
    int * pBeg2New = vArr2->pArray;
    Vec_IntClear( vArr );
    while ( pBeg1 < pEnd1 && pBeg2 < pEnd2 )
    {
        if ( *pBeg1 == *pBeg2 )
            Vec_IntPush( vArr, *pBeg1 ), pBeg1++, pBeg2++;
        else if ( *pBeg1 < *pBeg2 )
            *pBeg1New++ = *pBeg1++;
        else 
            *pBeg2New++ = *pBeg2++;
    }
    while ( pBeg1 < pEnd1 )
        *pBeg1New++ = *pBeg1++;
    while ( pBeg2 < pEnd2 )
        *pBeg2New++ = *pBeg2++;
    Vec_IntShrink( vArr1, pBeg1New - vArr1->pArray );
    Vec_IntShrink( vArr2, pBeg2New - vArr2->pArray );
    return Vec_IntSize(vArr);
}

static void Vec_IntTwoSplit ( Vec_Int_t *  vArr1, Vec_Int_t *  vArr2, Vec_Int_t *  vArr, Vec_Int_t *  vArr1n, Vec_Int_t *  vArr2n  )

inlinestatic

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

Synopsis [Returns the result of splitting of the two vectors.]

Description [Assumes that the vectors are sorted in the increasing order.]

SideEffects []

SeeAlso []

Definition at line 1707 of file vecInt.h.

{
    int * pBeg1 = vArr1->pArray;
    int * pBeg2 = vArr2->pArray;
    int * pEnd1 = vArr1->pArray + vArr1->nSize;
    int * pEnd2 = vArr2->pArray + vArr2->nSize;
    while ( pBeg1 < pEnd1 && pBeg2 < pEnd2 )
    {
        if ( *pBeg1 == *pBeg2 )
            Vec_IntPush( vArr, *pBeg1++ ), pBeg2++;
        else if ( *pBeg1 < *pBeg2 )
            Vec_IntPush( vArr1n, *pBeg1++ );
        else 
            Vec_IntPush( vArr2n, *pBeg2++ );
    }
    while ( pBeg1 < pEnd1 )
        Vec_IntPush( vArr1n, *pBeg1++ );
    while ( pBeg2 < pEnd2 )
        Vec_IntPush( vArr2n, *pBeg2++ );
}

static int Vec_IntUniqify ( Vec_Int_t *  p )

inlinestatic

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

Synopsis [Leaves only unique entries.]

Description [Returns the number of duplicated entried found.]

SideEffects []

SeeAlso []

Definition at line 1314 of file vecInt.h.

{
    int i, k, RetValue;
    if ( p->nSize < 2 )
        return 0;
    Vec_IntSort( p, 0 );
    for ( i = k = 1; i < p->nSize; i++ )
        if ( p->pArray[i] != p->pArray[i-1] )
            p->pArray[k++] = p->pArray[i];
    RetValue = p->nSize - k;
    p->nSize = k;
    return RetValue;
}

static Vec_Int_t* Vec_IntUniqifyHash ( Vec_Int_t *  vData, int  nIntSize  )

inlinestatic

Definition at line 1464 of file vecInt.h.

{
    Vec_Int_t * vMap, * vUnique;
    int i, Ent, nUnique = Vec_IntUniqueCount( vData, nIntSize, &vMap );
    vUnique = Vec_IntAlloc( nUnique * nIntSize );
    Vec_IntForEachEntry( vMap, Ent, i )
    {
        if ( Ent < i ) continue;
        assert( Ent == i );
        Vec_IntPushArray( vUnique, Vec_IntEntryP(vData, i*nIntSize), nIntSize );
    }
    assert( Vec_IntSize(vUnique) == nUnique * nIntSize );
    Vec_IntFree( vMap );
    return vUnique;
}

static int Vec_IntUniqueCount ( Vec_Int_t *  vData, int  nIntSize, Vec_Int_t **  pvMap  )

inlinestatic

Definition at line 1437 of file vecInt.h.

{
    int nEntries  = Vec_IntSize(vData) / nIntSize;
    int TableMask = (1 << Abc_Base2Log(nEntries)) - 1;
    int * pTable  = ABC_FALLOC( int, TableMask+1 );
    int * pNexts  = ABC_FALLOC( int, TableMask+1 );
    int * pClass  = ABC_ALLOC( int, nEntries );
    int i, Key, * pEnt, nUnique = 0;
    assert( nEntries * nIntSize == Vec_IntSize(vData) );
    for ( i = 0; i < nEntries; i++ )
    {
        pEnt = Vec_IntEntryP( vData, i*nIntSize );
        Key  = TableMask & Vec_IntUniqueHashKey( (unsigned char *)pEnt, 4*nIntSize );
        pEnt = Vec_IntUniqueLookup( vData, i, nIntSize, pNexts, pTable+Key );
        if ( *pEnt == -1 )
            *pEnt = i, nUnique++;
        pClass[i] = *pEnt;
    }
//    Vec_IntUniqueProfile( vData, pTable, pNexts, TableMask, nIntSize );
    ABC_FREE( pTable );
    ABC_FREE( pNexts );
    if ( pvMap )
        *pvMap = Vec_IntAllocArray( pClass, nEntries );
    else
        ABC_FREE( pClass );
    return nUnique;
}

static unsigned Vec_IntUniqueHashKey ( unsigned char *  pStr, int  nChars  )

inlinestatic

Definition at line 1411 of file vecInt.h.

{
    static unsigned s_BigPrimes[16] = 
    {
        0x984b6ad9,0x18a6eed3,0x950353e2,0x6222f6eb,0xdfbedd47,0xef0f9023,0xac932a26,0x590eaf55,
        0x97d0a034,0xdc36cd2e,0x22736b37,0xdc9066b0,0x2eb2f98b,0x5d9c7baf,0x85747c9e,0x8aca1055
    };
    static unsigned s_BigPrimes2[16] = 
    {
        0x8d8a5ebe,0x1e6a15dc,0x197d49db,0x5bab9c89,0x4b55dea7,0x55dede49,0x9a6a8080,0xe5e51035,
        0xe148d658,0x8a17eb3b,0xe22e4b38,0xe5be2a9a,0xbe938cbb,0x3b981069,0x7f9c0c8e,0xf756df10
    };
    unsigned Key = 0; int c;
    for ( c = 0; c < nChars; c++ )
        Key += s_BigPrimes2[(2*c)&15]   * s_BigPrimes[(unsigned)pStr[c] & 15] +
               s_BigPrimes2[(2*c+1)&15] * s_BigPrimes[(unsigned)pStr[c] >> 4];
    return Key;
}

static unsigned Vec_IntUniqueHashKey2 ( unsigned char *  pStr, int  nChars  )

inlinestatic

Definition at line 1402 of file vecInt.h.

{
    static unsigned s_BigPrimes[4] = {12582917, 25165843, 50331653, 100663319};
    unsigned Key = 0; int c;
    for ( c = 0; c < nChars; c++ )
        Key += (unsigned)pStr[c] * s_BigPrimes[c & 3];
    return Key;
}

static unsigned Vec_IntUniqueHashKeyDebug ( unsigned char *  pStr, int  nChars, int  TableMask  )

inlinestatic

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

Synopsis [Counts the number of unique entries.]

Description []

SideEffects []

SeeAlso []

Definition at line 1367 of file vecInt.h.

{
    static unsigned s_BigPrimes[4] = {12582917, 25165843, 50331653, 100663319};
    unsigned Key = 0; int c;
    for ( c = 0; c < nChars; c++ )
    {
        Key += (unsigned)pStr[c] * s_BigPrimes[c & 3];
        printf( "%d : ", c );
        printf( "%3d  ", pStr[c] );
        printf( "%12u ", Key );
        printf( "%12u ", Key&TableMask );
        printf( "\n" );
    }
    return Key;
}

static int* Vec_IntUniqueLookup ( Vec_Int_t *  vData, int  i, int  nIntSize, int *  pNexts, int *  pStart  )

inlinestatic

Definition at line 1429 of file vecInt.h.

{
    int * pData = Vec_IntEntryP( vData, i*nIntSize );
    for ( ; *pStart != -1; pStart = pNexts + *pStart )
        if ( !memcmp( pData, Vec_IntEntryP(vData, *pStart*nIntSize), sizeof(int) * nIntSize ) )
            return pStart;
    return pStart;
}

static void Vec_IntUniqueProfile ( Vec_Int_t *  vData, int *  pTable, int *  pNexts, int  TableMask, int  nIntSize  )

inlinestatic

Definition at line 1382 of file vecInt.h.

{
    int i, Key, Counter;
    for ( i = 0; i <= TableMask; i++ )
    {
        Counter = 0;
        for ( Key = pTable[i]; Key != -1; Key = pNexts[Key] )
            Counter++;
        if ( Counter < 7 )
            continue;
        printf( "%d\n", Counter );
        for ( Key = pTable[i]; Key != -1; Key = pNexts[Key] )
        {
//            Extra_PrintBinary( stdout, (unsigned *)Vec_IntEntryP(vData, Key*nIntSize), 40 ), printf( "\n" );
//            Vec_IntUniqueHashKeyDebug( (unsigned char *)Vec_IntEntryP(vData, Key*nIntSize), 4*nIntSize, TableMask );
        }
    }
    printf( "\n" );
}

static void Vec_IntUpdateEntry ( Vec_Int_t *  p, int  i, int  Value  )

inlinestatic

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

Synopsis []

Description []

SideEffects []

SeeAlso []

Definition at line 468 of file vecInt.h.

{
    if ( Vec_IntEntry( p, i ) < Value )
        Vec_IntWriteEntry( p, i, Value );
}

static void Vec_IntWriteEntry ( Vec_Int_t *  p, int  i, int  Entry  )

inlinestatic

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

Synopsis []

Description []

SideEffects []

SeeAlso []

Definition at line 434 of file vecInt.h.

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

static void Vec_IntZero ( Vec_Int_t *  p )

inlinestatic

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

Synopsis []

Description []

SideEffects []

SeeAlso []

Definition at line 260 of file vecInt.h.

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