\hypertarget{set__old_8cpp}{
\section{set\_\-old.cpp File Reference}
\label{set__old_8cpp}\index{set\_\-old.cpp@{set\_\-old.cpp}}
}
{\tt \#include \char`\"{}set.h\char`\"{}}\par
{\tt \#include $<$bdd.h$>$}\par
\subsection*{Functions}
\begin{CompactItemize}
\item 
bdd \hyperlink{set__old_8cpp_d57fd14f542e3c1a812e6122867ee456}{setUnion} (bdd s1, bdd s2)
\item 
bdd \hyperlink{set__old_8cpp_7a8a8e0f0ec0139394f4e34c0fc8bad7}{setIntersection} (bdd s1, bdd s2)
\item 
bdd \hyperlink{set__old_8cpp_6f3643b0fa6bdc55867fc9d4af197b92}{setXOR} (bdd s1, bdd s2)
\item 
bool \hyperlink{set__old_8cpp_0bfe8ae12bd7b420452e284f95fbdc3f}{setIsMember} (bdd feature, bdd family)
\item 
bdd \hyperlink{set__old_8cpp_b20b19fc6285bf0a9302516c9dd31c9e}{setComplement} (bdd family)
\item 
void \hyperlink{set__old_8cpp_55670dd6fdb87b2adb3922051541feec}{setInsert} (bdd feature, bdd \&family)
\item 
void \hyperlink{set__old_8cpp_8ac12f689d176225d7f4900dedc13dce}{setRemove} (bdd feature, bdd \&family)
\item 
bool \hyperlink{set__old_8cpp_499e4aa35d818a807357a5c16c226ed8}{setIsEmpty} (bdd family)
\item 
void \hyperlink{set__old_8cpp_f9fed6789f1965434cdf136160f1d3a9}{setEnumerate} (bdd family)
\end{CompactItemize}


\subsection{Function Documentation}
\hypertarget{set__old_8cpp_b20b19fc6285bf0a9302516c9dd31c9e}{
\index{set\_\-old.cpp@{set\_\-old.cpp}!setComplement@{setComplement}}
\index{setComplement@{setComplement}!set_old.cpp@{set\_\-old.cpp}}
\subsubsection[{setComplement}]{\setlength{\rightskip}{0pt plus 5cm}bdd setComplement (bdd {\em family})}}
\label{set__old_8cpp_b20b19fc6285bf0a9302516c9dd31c9e}


\hypertarget{set__old_8cpp_f9fed6789f1965434cdf136160f1d3a9}{
\index{set\_\-old.cpp@{set\_\-old.cpp}!setEnumerate@{setEnumerate}}
\index{setEnumerate@{setEnumerate}!set_old.cpp@{set\_\-old.cpp}}
\subsubsection[{setEnumerate}]{\setlength{\rightskip}{0pt plus 5cm}void setEnumerate (bdd {\em family})}}
\label{set__old_8cpp_f9fed6789f1965434cdf136160f1d3a9}


\hypertarget{set__old_8cpp_55670dd6fdb87b2adb3922051541feec}{
\index{set\_\-old.cpp@{set\_\-old.cpp}!setInsert@{setInsert}}
\index{setInsert@{setInsert}!set_old.cpp@{set\_\-old.cpp}}
\subsubsection[{setInsert}]{\setlength{\rightskip}{0pt plus 5cm}void setInsert (bdd {\em feature}, \/  bdd \& {\em family})}}
\label{set__old_8cpp_55670dd6fdb87b2adb3922051541feec}


\hypertarget{set__old_8cpp_7a8a8e0f0ec0139394f4e34c0fc8bad7}{
\index{set\_\-old.cpp@{set\_\-old.cpp}!setIntersection@{setIntersection}}
\index{setIntersection@{setIntersection}!set_old.cpp@{set\_\-old.cpp}}
\subsubsection[{setIntersection}]{\setlength{\rightskip}{0pt plus 5cm}bdd setIntersection (bdd {\em s1}, \/  bdd {\em s2})}}
\label{set__old_8cpp_7a8a8e0f0ec0139394f4e34c0fc8bad7}


This funtions the set intersection between two sets. The returned set contains the elements that are shared in the original sets. \hypertarget{set__old_8cpp_499e4aa35d818a807357a5c16c226ed8}{
\index{set\_\-old.cpp@{set\_\-old.cpp}!setIsEmpty@{setIsEmpty}}
\index{setIsEmpty@{setIsEmpty}!set_old.cpp@{set\_\-old.cpp}}
\subsubsection[{setIsEmpty}]{\setlength{\rightskip}{0pt plus 5cm}bool setIsEmpty (bdd {\em family})}}
\label{set__old_8cpp_499e4aa35d818a807357a5c16c226ed8}


\hypertarget{set__old_8cpp_0bfe8ae12bd7b420452e284f95fbdc3f}{
\index{set\_\-old.cpp@{set\_\-old.cpp}!setIsMember@{setIsMember}}
\index{setIsMember@{setIsMember}!set_old.cpp@{set\_\-old.cpp}}
\subsubsection[{setIsMember}]{\setlength{\rightskip}{0pt plus 5cm}bool setIsMember (bdd {\em feature}, \/  bdd {\em family})}}
\label{set__old_8cpp_0bfe8ae12bd7b420452e284f95fbdc3f}


\hypertarget{set__old_8cpp_8ac12f689d176225d7f4900dedc13dce}{
\index{set\_\-old.cpp@{set\_\-old.cpp}!setRemove@{setRemove}}
\index{setRemove@{setRemove}!set_old.cpp@{set\_\-old.cpp}}
\subsubsection[{setRemove}]{\setlength{\rightskip}{0pt plus 5cm}void setRemove (bdd {\em feature}, \/  bdd \& {\em family})}}
\label{set__old_8cpp_8ac12f689d176225d7f4900dedc13dce}


\hypertarget{set__old_8cpp_d57fd14f542e3c1a812e6122867ee456}{
\index{set\_\-old.cpp@{set\_\-old.cpp}!setUnion@{setUnion}}
\index{setUnion@{setUnion}!set_old.cpp@{set\_\-old.cpp}}
\subsubsection[{setUnion}]{\setlength{\rightskip}{0pt plus 5cm}bdd setUnion (bdd {\em s1}, \/  bdd {\em s2})}}
\label{set__old_8cpp_d57fd14f542e3c1a812e6122867ee456}


Set Operations Module This module contains the operations on sets. It is used when we use the set model. The operations takes place on the bdd level. Every bdd in a set model, is a set and hence these functions operate on sets (bdds). This function is the set uinon between two sets. The returned set contains both the elements of the unioned sets. \hypertarget{set__old_8cpp_6f3643b0fa6bdc55867fc9d4af197b92}{
\index{set\_\-old.cpp@{set\_\-old.cpp}!setXOR@{setXOR}}
\index{setXOR@{setXOR}!set_old.cpp@{set\_\-old.cpp}}
\subsubsection[{setXOR}]{\setlength{\rightskip}{0pt plus 5cm}bdd setXOR (bdd {\em s1}, \/  bdd {\em s2})}}
\label{set__old_8cpp_6f3643b0fa6bdc55867fc9d4af197b92}


This function is the xor between two sets. The returned set contains all the elements in both the sets except the common ones. 