#include <setalgorithms.H>
|
| bool | contains (const Key &k) const |
| |
| bool | has (const Key &k) const |
| |
| SetType | join (const SetType &s) const |
| |
| SetType | intersect (const SetType &s) const |
| |
| SetType | difference (const SetType &s) const |
| |
| template<class SetType2 = SetType> |
| SLList< std::pair< Key, typename SetType2::KeyType > > | cartesian_product (const SetType2 &s) const |
| |
|
| static SetType | join (const SetType &s1, const SetType &s2) |
| |
| static SetType | intersect (const SetType &s1, const SetType &s2) |
| |
| static SetType | difference (const SetType &s1, const SetType &s2) |
| |
| template<class SetType2 = SetType> |
| static SLList< std::pair< Key, typename SetType2::KeyType > > | cartesian_product (const SetType &s1, const SetType2 &s2) |
| |
template<class SetType, typename Key>
template<class SetType2 = SetType>
| static SLList<std::pair<Key, typename SetType2::KeyType> > Designar::SetAlgorithms< SetType, Key >::cartesian_product |
( |
const SetType & |
s1, |
|
|
const SetType2 & |
s2 |
|
) |
| |
|
inlinestatic |
template<class SetType, typename Key>
template<class SetType2 = SetType>
template<class SetType, typename Key>
template<class SetType, typename Key>
template<class SetType, typename Key>
template<class SetType, typename Key>
template<class SetType, typename Key>
template<class SetType, typename Key>
template<class SetType, typename Key>
template<class SetType, typename Key>
The documentation for this class was generated from the following file: