/// <summary>
/// Assumes that set is a union of some minterms (or empty).
/// If null then null is returned.
/// </summary>
public BitVector ConvertFromCharSet(BDDAlgebra alg, BDD set)
{
BDD[] partition = _minterms;
BitVector res = False;
for (int i = 0; i < partition.Length; i++)
{
if (alg.IsSatisfiable(alg.And(partition[i], set)))
{
res = BitVector.Or(res, _mintermVectors[i]);
}
}
return(res);
}
/// <summary>
/// Assumes that set is a union of some minterms (or empty).
/// If null then 0 is returned.
/// </summary>
public ulong ConvertFromCharSet(BDDAlgebra alg, BDD set)
{
BDD[] partition = _minterms;
ulong res = 0;
for (int i = 0; i < partition.Length; i++)
{
// Set the i'th bit if the i'th minterm is in the set.
if (alg.IsSatisfiable(alg.And(partition[i], set)))
{
res |= (ulong)1 << i;
}
}
return(res);
}
/// <summary>
/// Assumes that set is a union of some minterms (or empty).
/// If null then 0 is returned.
/// </summary>
public ulong ConvertFromCharSet(BDDAlgebra alg, BDD?set)
{
ulong res = _false;
if (set is not null)
{
for (int i = 0; i < _bits; i++)
{
Debug.Assert(_partition is not null);
// set the i'th bit if the i'th minterm is in the set
if (alg.IsSatisfiable(alg.And(_partition[i], set)))
{
res |= (ulong)1 << i;
}
}
}
return(res);
}
public BV?ConvertFromCharSet(BDDAlgebra alg, BDD set)
{
if (set == null)
{
return(null);
}
Debug.Assert(_partition is not null);
BV res = False;
for (int i = 0; i < _bits; i++)
{
BDD bdd_i = _partition[i];
BDD conj = alg.And(bdd_i, set);
if (alg.IsSatisfiable(conj))
{
res |= _minterms[i];
}
}
return(res);
}