93 return p->iLast -
p->iFirst;
109 if (
p->iLast ==
p->nVars )
113 for ( i = 0; i <
p->iLast; i++ )
114 printf(
"entry = %2d lit = %2d var = %2d \n", i,
p->pVars[i],
p->pVars[i]/2 );
117 p->pVars[
p->iLast++] = Lit;
133 if (
p->iFirst ==
p->iLast )
135 return p->pVars[
p->iFirst++];
#define ABC_ALLOC(type, num)
#define ABC_NAMESPACE_IMPL_START
#define ABC_NAMESPACE_IMPL_END
struct Msat_Queue_t_ Msat_Queue_t
void Msat_QueueFree(Msat_Queue_t *p)
int Msat_QueueReadSize(Msat_Queue_t *p)
void Msat_QueueInsert(Msat_Queue_t *p, int Lit)
void Msat_QueueClear(Msat_Queue_t *p)
Msat_Queue_t * Msat_QueueAlloc(int nVars)
FUNCTION DEFINITIONS ///.
int Msat_QueueExtract(Msat_Queue_t *p)