UIDSet.h

Go to the documentation of this file.

/*
 * This library is free software; you can redistribute it and/or
 * modify it under the terms of the GNU Lesser General Public
 * License as published by the Free Software Foundation; either
 * version 2.1 of the License, or (at your option) any later version.
 *
 * This library is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
 * Lesser General Public License for more details.
 *
 * You should have received a copy of the GNU Lesser General Public
 * License along with this library; if not, write to the Free Software
 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
 *
 * UIDSet.h
 * A Set of UIDs
 * Copyright (C) 2005 Simon Newton
 */

#ifndef INCLUDE_OLA_RDM_UIDSET_H_
#define INCLUDE_OLA_RDM_UIDSET_H_

#include <ola/rdm/UID.h>
#include <algorithm>
#include <iomanip>
#include <set>
#include <string>

namespace ola {
namespace rdm {

class UIDSet {
 public:
    typedef std::set<UID>::const_iterator Iterator;

    UIDSet() {}

    UIDSet(const UIDSet &other):
      m_uids(other.m_uids) {
    }

    UIDSet& operator=(const UIDSet &other) {
      if (this != &other) {
        m_uids = other.m_uids;
      }
      return *this;
    }

    void Clear() {
      m_uids.clear();
    }

    unsigned int Size() const {
      return m_uids.size();
    }

    bool Empty() const {
      return m_uids.empty();
    }

    void AddUID(const UID &uid) {
      m_uids.insert(uid);
    }

    void RemoveUID(const UID &uid) {
      m_uids.erase(uid);
    }

    bool Contains(const UID &uid) const {
      return m_uids.find(uid) != m_uids.end();
    }

    UIDSet Union(const UIDSet &other) {
      std::set<UID> result;
      set_union(m_uids.begin(),
                m_uids.end(),
                other.Begin(),
                other.End(),
                inserter(result, result.begin()));
      return UIDSet(result);
    }

    Iterator Begin() const {
      return m_uids.begin();
    }

    Iterator End() const {
      return m_uids.end();
    }

    UIDSet SetDifference(const UIDSet &other) {
      std::set<UID> difference;
      std::set_difference(m_uids.begin(),
                          m_uids.end(),
                          other.m_uids.begin(),
                          other.m_uids.end(),
                          std::inserter(difference, difference.begin()));
      return UIDSet(difference);
    }

    bool operator==(const UIDSet &other) const {
      return m_uids == other.m_uids;
    }

    bool operator!=(const UIDSet &other) const {
      return !(*this == other);
    }

    std::string ToString() const {
      std::ostringstream str;
      std::set<UID>::const_iterator iter;
      for (iter = m_uids.begin(); iter != m_uids.end(); ++iter) {
        if (iter != m_uids.begin())
          str << ",";
        str << *iter;
      }
      return str.str();
    }

    friend std::ostream& operator<< (std::ostream &out, const UIDSet &uid_set) {
      return out << uid_set.ToString();
    }

 private:
    std::set<UID> m_uids;

    explicit UIDSet(const std::set<UID> uids) {
      m_uids = uids;
    }
};
}  // namespace rdm
}  // namespace ola
#endif  // INCLUDE_OLA_RDM_UIDSET_H_