Commit 2fcdd113 by Alan Mishchenko

Experiments with cube hashing.

parent 118776f3
...@@ -310,6 +310,13 @@ static inline void Vec_BitWriteEntry( Vec_Bit_t * p, int i, int Entry ) ...@@ -310,6 +310,13 @@ static inline void Vec_BitWriteEntry( Vec_Bit_t * p, int i, int Entry )
p->pArray[i >> 5] &= ~(1 << (i & 31)); p->pArray[i >> 5] &= ~(1 << (i & 31));
else assert(0); else assert(0);
} }
static inline int Vec_BitAddEntry( Vec_Bit_t * p, int i )
{
if ( Vec_BitEntry(p, i) )
return 1;
Vec_BitWriteEntry( p, i, 1 );
return 0;
}
/**Function************************************************************* /**Function*************************************************************
...@@ -601,6 +608,24 @@ static inline int Vec_BitCount( Vec_Bit_t * p ) ...@@ -601,6 +608,24 @@ static inline int Vec_BitCount( Vec_Bit_t * p )
return Counter; return Counter;
} }
/**Function*************************************************************
Synopsis []
Description []
SideEffects []
SeeAlso []
***********************************************************************/
static inline void Vec_BitReset( Vec_Bit_t * p )
{
int i, nWords = (p->nSize >> 5) + ((p->nSize & 31) > 0);
for ( i = 0; i < nWords; i++ )
p->pArray[i] = 0;
}
ABC_NAMESPACE_HEADER_END ABC_NAMESPACE_HEADER_END
#endif #endif
......
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment