spaceSet.hh

Go to the documentation of this file.

 
#ifndef SpaceSet_hh
#define SpaceSet_hh
 
#include "space.hh"
#include "toolbox/set.hh"
 
namespace concepts {
 
  // ******************************************************* Set<IndexRange> **
 
  template<>
  class Set<IndexRange> : public BaseSet<IndexRange> {
  public:
    Set() : BaseSet<IndexRange>() {}
    template<class F>
    Set(const F& set) : BaseSet<IndexRange>(set) {}
    Set(const IndexRange set) : BaseSet<IndexRange>() { insert(set); }
    virtual ~Set() {}
 
    std::pair<bool, uint> exist(uint i) const;
    void insert(const IndexRange& i);
    void erase(const IndexRange& i);
    uint dim() const;
    uint max() const;
    uint operator[](uint i) const;
 
    // Return set union
    Set<IndexRange>& operator|=(const Set<IndexRange>& set);
 
    class index_iterator : public virtual OutputOperator {
    public:
      index_iterator(const_iterator first, const_iterator last);
      index_iterator(const index_iterator& i);
      index_iterator& operator++();
      index_iterator operator++(int);
      bool operator==(const index_iterator i);
      bool operator!=(const index_iterator i) { return !(*this == i); }
      operator const uint*() const;
    protected:
      virtual std::ostream& info(std::ostream& os) const;
    private:
      Set<IndexRange>::const_iterator i_, last_;
      uint j_;
    };
 
    index_iterator index_begin(uint i = 0) const;
    const index_iterator index_end() const;
  protected:
    virtual std::ostream& info(std::ostream& os) const;
  private:
    virtual void union_(const_iterator_ first, const_iterator_ last,
      insert_iterator_ i) const;
    virtual void intersection_(const_iterator_ first, const_iterator_ last,
             insert_iterator_ i) const;
    virtual void difference_(const_iterator_ first, const_iterator_ last,
           insert_iterator_ i) const;
  };
 
} // namespace concepts
 
#endif // SpaceSet_hh