gsHBoxUtils.h

Go to the documentation of this file.

#pragma once


#include <iostream>

namespace gismo
{

enum class gsHNeighborhood 
{
    None = -1,
    Automatic = 0,
    T = 1,
    H = 2
};

template<short_t d, class T>
struct gsHBoxUtils
{
protected:
    typedef typename gsHBox<d,T>::Container         Container;
    typedef typename gsHBox<d,T>::SortedContainer   SortedContainer;
    typedef typename gsHBox<d,T>::HContainer        HContainer;
    typedef typename gsHBox<d,T>::Iterator          Iterator;
    typedef typename gsHBox<d,T>::cIterator         cIterator;
    typedef typename gsHBox<d,T>::rIterator         rIterator;
    typedef typename gsHBox<d,T>::HIterator         HIterator;
    typedef typename gsHBox<d,T>::cHIterator        cHIterator;
    typedef typename gsHBox<d,T>::rHIterator        rHIterator;

public:
        static typename gsHBox<d, T>::SortedContainer Sort(const Container & container);
        static typename gsHBox<d, T>::Container Unique(const Container & container);
        static typename gsHBox<d, T>::HContainer Unique(const HContainer & container);
        static gsHBoxContainer<d, T> Unique(const gsHBoxContainer<d,T> & container);

        static typename gsHBox<d, T>::Container Union(const Container & container1, const Container & container2);
        static typename gsHBox<d, T>::HContainer Union(const HContainer & container1, const HContainer & container2);
        static gsHBoxContainer<d, T> Union(const gsHBoxContainer<d,T> & container1, const gsHBoxContainer<d,T> & container2);
        // Takes the difference container1 \ container2
        static typename gsHBox<d, T>::Container Difference(const Container & container1, const Container & container2);
        static typename gsHBox<d, T>::HContainer Difference(const HContainer & container1, const HContainer & container2);
        static gsHBoxContainer<d, T> Difference(const gsHBoxContainer<d,T> & container1, const gsHBoxContainer<d,T> & container2);
        static typename gsHBox<d, T>::Container Intersection(const Container & container1, const Container & container2);
        static typename gsHBox<d, T>::Container ContainedIntersection(const Container & container1, const Container & container2);
        static typename gsHBox<d, T>::Container ExactIntersection(const Container & container1, const Container & container2);
        // typename gsHBox<d, T>::Container gsHBoxIntersection(const gsHBox<d,T> & box1, const gsHBox<d,T> & box2)

        static Container HContainer2Container( const HContainer & container );
        static HContainer Container2HContainer( const Container & container );

        static Container toContainer(const HContainer & container);

        static Container toUnitBoxes(const HContainer & container);

    static HContainer toUnitHBoxes(const HContainer & container);

    static HContainer markTadmissible(const HContainer & marked, index_t m);

    static HContainer markTadmissible(const gsHBox<d,T> & marked, index_t m);

    static HContainer markHadmissible(const HContainer & marked, index_t m);

    static HContainer markHadmissible(const gsHBox<d,T> & marked, index_t m);

    template<gsHNeighborhood _mode>
    static HContainer markAdmissible(const gsHBox<d,T> & marked, index_t m);
    template<gsHNeighborhood _mode>
    static HContainer markAdmissible(const HContainer & marked, index_t m);

    static HContainer markAdmissible(const gsHBox<d,T> & marked, index_t m);
    static HContainer markAdmissible(const HContainer & marked, index_t m);

    static bool allActive(const  Container & elements);
    static bool allActive(const HContainer & elements);

    static gsHNeighborhood neighborhoodType(const gsHBox<d,T> & box);

protected:
        template<gsHNeighborhood _mode>
    static
    typename std::enable_if<_mode==gsHNeighborhood::T || _mode==gsHNeighborhood::H, HContainer>::type
        _markRecursive(const HContainer & marked, index_t lvl, index_t m);

        template<gsHNeighborhood _mode>
    static
    typename std::enable_if<_mode!=gsHNeighborhood::T && _mode!=gsHNeighborhood::H, HContainer>::type
        _markRecursive(const HContainer & marked, index_t lvl, index_t m);
};

template <short_t d, class T>
struct gsHBoxCompare
{
    bool operator()(const gsHBox<d,T> & a, const gsHBox<d,T> & b) const;
};

template <short_t d, class T>
struct gsHBoxEqual
{
    bool operator()(const gsHBox<d,T> & a, const gsHBox<d,T> & b) const;
};

// template <short_t d, class T>
// struct gsHBoxOverlaps
// {
//     bool operator()(const gsHBox<d,T> & a, const gsHBox<d,T> & b) const;
// };

template <short_t d, class T>
struct gsHBoxContains
{
    bool operator()(const gsHBox<d,T> & a, const gsHBox<d,T> & b) const;
};

template <short_t d, class T>
struct gsHBoxIsContained
{
    bool operator()(const gsHBox<d,T> & a, const gsHBox<d,T> & b) const;
};


} // namespace gismo

#ifndef GISMO_BUILD_LIB
#include GISMO_HPP_HEADER(gsHBoxUtils.hpp)
#endif