DGtal::detail::SetFunctionsImpl< Container, false, true > Struct Template Reference

#include <DGtal/base/SetFunctions.h>

Static Public Member Functions
static bool	isEqual (const Container &S1, const Container &S2)
static bool	isSubset (const Container &S1, const Container &S2)
static Container &	assignDifference (Container &S1, const Container &S2)
static Container &	assignUnion (Container &S1, const Container &S2)
static Container &	assignIntersection (Container &S1, const Container &S2)
static Container &	assignSymmetricDifference (Container &S1, const Container &S2)

Detailed Description

template<typename Container>
struct DGtal::detail::SetFunctionsImpl< Container, false, true >

Specialization for non-associative, ordered containers. Could be a sorted std::vector or std::list.

Definition at line 646 of file SetFunctions.h.

Member Function Documentation

assignDifference()

template<typename Container >

static Container & DGtal::detail::SetFunctionsImpl< Container, false, true >::assignDifference ( Container & S1, const Container & S2 )

inlinestatic

Updates the set S1 as S1 - S2. This version uses the fact that the container is ordered.

Parameters

[in,out]	S1	an input set, S1 - S2 as output.
[in]	S2	another input set.

Definition at line 691 of file SetFunctions.h.

      {
        typedef ComparatorAdapter< Container, false, true, false >
          CompAdapter;
 
        Container S;
        std::swap( S, S1 );
        std::set_difference( S.begin(), S.end(), S2.begin(), S2.end(), 
                             std::inserter( S1, S1.end() ), 
                             CompAdapter::less( S1 ) );
        return S1;
      }

assignIntersection()

template<typename Container >

static Container & DGtal::detail::SetFunctionsImpl< Container, false, true >::assignIntersection ( Container & S1, const Container & S2 )

inlinestatic

Updates the set S1 as \( S1 \cap S2 \). This version uses the fact that the container is ordered.

Parameters

[in,out]	S1	an input set, \( S1 \cap S2 \) as output.
[in]	S2	another input set.

Definition at line 729 of file SetFunctions.h.

      {
        typedef ComparatorAdapter< Container, false, true, false >
          CompAdapter;
 
        Container S;
        std::swap( S, S1 );
        std::set_intersection( S.begin(), S.end(), S2.begin(), S2.end(), 
                               std::inserter( S1, S1.end() ), 
                               CompAdapter::less( S1 ) );
        return S1;
      }

assignSymmetricDifference()

template<typename Container >

static Container & DGtal::detail::SetFunctionsImpl< Container, false, true >::assignSymmetricDifference ( Container & S1, const Container & S2 )

inlinestatic

Updates the set S1 as \( S1 \Delta S2 \). This version uses the fact that the container is ordered.

Parameters

[in,out]	S1	an input set, \( S1 \Delta S2 \) as output.
[in]	S2	another input set.

Definition at line 748 of file SetFunctions.h.

      {
        typedef ComparatorAdapter< Container, false, true, false >
          CompAdapter;
 
        Container S;
        std::swap( S, S1 );
        std::set_symmetric_difference( S.begin(), S.end(), S2.begin(), S2.end(), 
                                       std::inserter( S1, S1.end() ), 
                                       CompAdapter::less( S1 ) );
        return S1;
      }

assignUnion()

template<typename Container >

static Container & DGtal::detail::SetFunctionsImpl< Container, false, true >::assignUnion ( Container & S1, const Container & S2 )

inlinestatic

Updates the set S1 as \( S1 \cup S2 \). This version uses the fact that the container is ordered.

Parameters

[in,out]	S1	an input set, \( S1 \cup S2 \) as output.
[in]	S2	another input set.

Definition at line 710 of file SetFunctions.h.

      {
        typedef ComparatorAdapter< Container, false, true, false >
          CompAdapter;
 
        Container S;
        std::swap( S, S1 );
        std::set_union( S.begin(), S.end(), S2.begin(), S2.end(), 
                        std::inserter( S1, S1.end() ), 
                        CompAdapter::less( S1 ) );
        return S1;
      }

isEqual()

template<typename Container >

static bool DGtal::detail::SetFunctionsImpl< Container, false, true >::isEqual ( const Container & S1, const Container & S2 )

inlinestatic

Equality test. This version uses the fact that the container is ordered.

Parameters

[in]	S1	an input set.
[in]	S2	another input set.

Returns

true iff S1 is equal to S2 (seen as sets).

Definition at line 655 of file SetFunctions.h.

      {
        typedef ComparatorAdapter< Container, false, true, false >
          CompAdapter;
 
        // Checks size first.
        if ( S1.size() != S2.size() ) return false;
        return std::equal( S1.begin(), S1.end(), S2.begin(), 
                           CompAdapter::equal_to( S1 ) ); 
      }

isSubset()

template<typename Container >

static bool DGtal::detail::SetFunctionsImpl< Container, false, true >::isSubset ( const Container & S1, const Container & S2 )

inlinestatic

Inclusion test. This version uses the fact that the container is ordered.

Parameters

[in]	S1	an input set.
[in]	S2	another input set.

Returns

true iff S1 is a subset of S2.

Definition at line 674 of file SetFunctions.h.

      {
        typedef ComparatorAdapter< Container, false, true, false >
          CompAdapter;
 
        // Checks size first.
        if ( S1.size() > S2.size() ) return false;
        return std::includes( S2.begin(), S2.end(), S1.begin(), S1.end(), 
                              CompAdapter::less( S1 ) ); 
      }

---

The documentation for this struct was generated from the following file:

• SetFunctions.h