abc/src/aig/ivy/ivyTable.c
/**Function*************************************************************

  Synopsis    [Updates the table to point to the new node.]

  Description [If the old node (pObj) is in the table, updates the table
  to point to an object with different ID (ObjIdNew). The table should
  not contain an object with ObjIdNew (this is currently not checked).]
               
  SideEffects []

  SeeAlso     []

***********************************************************************/
Function
Synopsis    [Updates the table to point to the new node.]

Description [If the old node (pObj) is in the table, updates the table
to point to an object with different ID (ObjIdNew). The table should
not contain an object with ObjIdNew (this is currently not checked).]




Function Synopsis [ Updates the table to point to the new node . ] Description [ If the old node ( pObj ) is in the table updates the table to point to an object with different ID ( ObjIdNew ) . The table should not contain an object with ObjIdNew ( this is currently not checked ) . ]
void Ivy_TableUpdate( Ivy_Man_t * p, Ivy_Obj_t * pObj, int ObjIdNew )
{
    int * pPlace;
    assert( !Ivy_IsComplement(pObj) );
    if ( !Ivy_ObjIsHash(pObj) )
        return;
    pPlace = Ivy_TableFind( p, pObj );
    assert( *pPlace == pObj->Id ); 
    *pPlace = ObjIdNew; 
}
void Ivy_TableUpdate ( Ivy_Man_t * p , Ivy_Obj_t * pObj , int ObjIdNew ) { int * pPlace ; assert ( ! Ivy_IsComplement ( pObj ) ) ; if ( ! Ivy_ObjIsHash ( pObj ) ) return ; pPlace = Ivy_TableFind ( p , pObj ) ; assert ( * pPlace == pObj -> Id ) ; * pPlace = ObjIdNew ; }
Function
Synopsis    [Updates the table to point to the new node.]
Function Synopsis [ Updates the table to point to the new node . ]
// node should be in the table