EnumIface.hh

Go to the documentation of this file.

/*
 * Copyright (C) 2016 Open Source Robotics Foundation
 *
 * Licensed under the Apache License, Version 2.0 (the "License");
 * you may not use this file except in compliance with the License.
 * You may obtain a copy of the License at
 *
 *     http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 *
*/
#ifndef IGNITION_COMMON_ENUMITERATOR_HH_
#define IGNITION_COMMON_ENUMITERATOR_HH_
 
#include <string>
#include <vector>
#include <algorithm>
#include <ignition/common/Util.hh>
#include <ignition/common/Export.hh>
 
namespace ignition
{
  namespace common
  {
    #define IGN_ENUM(name, enumType, begin, end, ...) \
    static ignition::common::EnumIface<enumType> name( \
        begin, end, {__VA_ARGS__});
 
    template<typename T>
    class EnumIface
    {
      public: EnumIface(T _start, T _end,
          const std::vector<std::string> &_names)
              : names(_names)
      {
        this->range[0] = _start;
        this->range[1] = _end;
      }
 
      public: T Begin()
      {
        return range[0];
      }
 
      public: T End()
      {
        return range[1];
      }
 
      public: std::string Str(T const &_e)
      {
        if (static_cast<unsigned int>(_e) < names.size())
          return names[static_cast<unsigned int>(_e)];
        else
          return "";
      }
 
      public: void Set(T &_e, const std::string &_str)
      {
        auto begin = std::begin(names);
        auto end = std::end(names);
 
        auto find = std::find(begin, end, _str);
        if (find != end)
        {
          _e = static_cast<T>(std::distance(begin, find));
        }
      }
 
      public: T range[2];
 
      public: std::vector<std::string> names;
    };
 
    template<typename Enum>
    class EnumIterator
    : std::iterator<std::bidirectional_iterator_tag, Enum>
    {
      public: EnumIterator()
      {
      }
 
      // cppcheck-suppress noExplicitConstructor
      public: EnumIterator(const Enum &_c) : c(_c)
      {
      }
 
      public: EnumIterator &operator=(const Enum &_c)
      {
        this->c = _c;
        return *this;
      }
 
      public: EnumIterator &operator++()
      {
        this->c = static_cast<Enum>(static_cast<int>(this->c) + 1);
        return *this;
      }
 
      public: EnumIterator operator++(const int)
      {
        EnumIterator cpy(*this);
        ++*this;
        return cpy;
      }
 
      public: EnumIterator &operator--()
      {
        this->c = static_cast<Enum>(static_cast<int>(this->c) - 1);
        return *this;
      }
 
      public: EnumIterator operator--(const int)
      {
        EnumIterator cpy(*this);
        --*this;
        return cpy;
      }
 
      public: Enum operator*() const
      {
        return c;
      }
 
      public: Enum Value() const
      {
        return this->c;
      }
 
      private: Enum c;
    };
 
    template<typename Enum>
    bool operator==(EnumIterator<Enum> _e1, EnumIterator<Enum> _e2)
    {
      return _e1.Value() == _e2.Value();
    }
 
    template<typename Enum>
    bool operator!=(EnumIterator<Enum> _e1, EnumIterator<Enum> _e2)
    {
      return !(_e1 == _e2);
    }
  }
}
#endif