cyclic_value.h

Go to the documentation of this file.

 
 
/******************************************************************************
The MIT License(MIT)
 
Embedded Template Library.
https://github.com/ETLCPP/etl
https://www.etlcpp.com
 
Copyright(c) 2014 John Wellbelove
 
Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files(the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, distribute, sublicense, and / or sell
copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions :
 
The above copyright notice and this permission notice shall be included in all
copies or substantial portions of the Software.
 
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
SOFTWARE.
******************************************************************************/
 
#ifndef ETL_CYCLIC_VALUE_INCLUDED
#define ETL_CYCLIC_VALUE_INCLUDED
 
 
#include "platform.h"
#include "static_assert.h"
#include "exception.h"
#include "static_assert.h"
#include "type_traits.h"
#include "algorithm.h"
 
#include <stddef.h>
 
namespace etl
{
  //***************************************************************************
  //***************************************************************************
  template <typename T, T FIRST = 0, T LAST = 0, bool EtlRuntimeSpecialisation = ((FIRST == 0) && (LAST == 0))>
  class cyclic_value;
 
  //***************************************************************************
  //***************************************************************************
  template <typename T, T FIRST, T LAST>
  class cyclic_value<T, FIRST, LAST, false>
  {
  public:
 
    //*************************************************************************
    //*************************************************************************
    cyclic_value()
      : value(FIRST)
    {
    }
 
    //*************************************************************************
    //*************************************************************************
    explicit cyclic_value(T initial)
    {
      set(initial);
    }
 
    //*************************************************************************
    //*************************************************************************
    cyclic_value(const cyclic_value<T, FIRST, LAST>& other)
      : value(other.value)
    {
    }
 
    //*************************************************************************
    //*************************************************************************
    cyclic_value& operator =(const cyclic_value<T, FIRST, LAST>& other)
    {
      value = other.value;
 
      return *this;
    }
 
    //*************************************************************************
    //*************************************************************************
    void set(T value_)
    {
      if (value_ > LAST)
      {
        value_ = LAST;
      }
      else if (value_ < FIRST)
      {
        value_ = FIRST;
      }
 
      value = value_;
    }
 
    //*************************************************************************
    //*************************************************************************
    void to_first()
    {
      value = FIRST;
    }
 
    //*************************************************************************
    //*************************************************************************
    void to_last()
    {
      value = LAST;
    }
 
    //*************************************************************************
    //*************************************************************************
    void advance(int n)
    {
      if (n > 0)
      {
        for (int i = 0; i < n; ++i)
        {
          operator ++();
        }
      }
      else
      {
        for (int i = 0; i < -n; ++i)
        {
          operator --();
        }
      }
    }
 
    //*************************************************************************
    //*************************************************************************
    operator T()
    {
      return value;
    }
 
    //*************************************************************************
    //*************************************************************************
    operator const T() const
    {
      return value;
    }
 
    //*************************************************************************
    //*************************************************************************
    cyclic_value& operator ++()
    {
      if (value >= LAST) ETL_UNLIKELY
      {
        value = FIRST;
      }
      else
      {
        ++value;
      }
 
      return *this;
    }
 
    //*************************************************************************
    //*************************************************************************
    cyclic_value operator ++(int)
    {
      cyclic_value temp(*this);
 
      operator++();
 
      return temp;
    }
 
    //*************************************************************************
    //*************************************************************************
    cyclic_value& operator --()
    {
      if (value <= FIRST) ETL_UNLIKELY
      {
        value = LAST;
      }
      else
      {
        --value;
      }
 
      return *this;
    }
 
    //*************************************************************************
    //*************************************************************************
    cyclic_value operator --(int)
    {
      cyclic_value temp(*this);
 
      operator--();
 
      return temp;
    }
 
    //*************************************************************************
    //*************************************************************************
    cyclic_value& operator =(T t)
    {
      set(t);
      return *this;
    }
 
    //*************************************************************************
    //*************************************************************************
    template <const T FIRST2, const T LAST2>
    cyclic_value& operator =(const cyclic_value<T, FIRST2, LAST2>& other)
    {
      set(other.get());
      return *this;
    }
 
    //*************************************************************************
    //*************************************************************************
    T get() const
    {
      return value;
    }
 
    //*************************************************************************
    //*************************************************************************
    const T first() const
    {
      return FIRST;
    }
 
    //*************************************************************************
    //*************************************************************************
    const T last() const
    {
      return LAST;
    }
 
    //*************************************************************************
    //*************************************************************************
    void swap(cyclic_value<T, FIRST, LAST>& other)
    {
      using ETL_OR_STD::swap; // Allow ADL
 
      swap(value, other.value);
    }
 
    //*************************************************************************
    //*************************************************************************
    friend void swap(cyclic_value<T, FIRST, LAST>& lhs, cyclic_value<T, FIRST, LAST>& rhs)
    {
      lhs.swap(rhs);
    }
 
    //*************************************************************************
    //*************************************************************************
    friend bool operator == (const cyclic_value<T, FIRST, LAST>& lhs, const cyclic_value<T, FIRST, LAST>& rhs)
    {
      return lhs.value == rhs.value;
    }
 
    //*************************************************************************
    //*************************************************************************
    friend bool operator != (const cyclic_value<T, FIRST, LAST>& lhs, const cyclic_value<T, FIRST, LAST>& rhs)
    {
      return !(lhs == rhs);
    }
 
  private:
 
    T value; 
  };
 
  //***************************************************************************
  //***************************************************************************
  template <typename T, T FIRST, T LAST>
  class cyclic_value<T, FIRST, LAST, true>
  {
  public:
 
    //*************************************************************************
    //*************************************************************************
    cyclic_value()
      : value(FIRST),
        first_value(FIRST),
        last_value(LAST)
    {
    }
 
    //*************************************************************************
    //*************************************************************************
    cyclic_value(T first_, T last_)
      : value(first_),
        first_value(first_),
        last_value(last_) 
    {
    }
 
    //*************************************************************************
    //*************************************************************************
    cyclic_value(T first_, T last_, T initial)
      : first_value(first_)
      , last_value(last_)
    {
      set(initial);
    }
 
    //*************************************************************************
    //*************************************************************************
    cyclic_value(const cyclic_value& other)
      : value(other.value),
        first_value(other.first_value),
        last_value(other.last_value)
    {
    }
 
    //*************************************************************************
    //*************************************************************************
    void set(T first_, T last_)
    {
      first_value = first_;
      last_value  = last_;
      value       = first_;
    }
 
    //*************************************************************************
    //*************************************************************************
    void set(T value_)
    {
      if (value_ > last_value)
      {
        value_ = last_value;
      }
      else if (value_ < first_value)
      {
        value_ = first_value;
      }
 
      value = value_;
    }
 
    //*************************************************************************
    //*************************************************************************
    void to_first()
    {
      value = first_value;
    }
 
    //*************************************************************************
    //*************************************************************************
    void to_last()
    {
      value = last_value;
    }
 
    //*************************************************************************
    //*************************************************************************
    void advance(int n)
    {
      if (n > 0)
      {
        for (int i = 0; i < n; ++i)
        {
          operator ++();
        }
      }
      else
      {
        for (int i = 0; i < -n; ++i)
        {
          operator --();
        }
      }
    }
 
    //*************************************************************************
    //*************************************************************************
    operator T()
    {
      return value;
    }
 
    //*************************************************************************
    //*************************************************************************
    operator const T() const
    {
      return value;
    }
 
    //*************************************************************************
    //*************************************************************************
    cyclic_value& operator ++()
    {
      if (value >= last_value)
      {
        value = first_value;
      }
      else
      {
        ++value;
      }
 
      return *this;
    }
 
    //*************************************************************************
    //*************************************************************************
    cyclic_value operator ++(int)
    {
      cyclic_value temp(*this);
 
      operator++();
 
      return temp;
    }
 
    //*************************************************************************
    //*************************************************************************
    cyclic_value& operator --()
    {
      if (value <= first_value)
      {
        value = last_value;
      }
      else
      {
        --value;
      }
 
      return *this;
    }
 
    //*************************************************************************
    //*************************************************************************
    cyclic_value operator --(int)
    {
      cyclic_value temp(*this);
 
      operator--();
 
      return temp;
    }
 
    //*************************************************************************
    //*************************************************************************
    cyclic_value& operator =(T t)
    {
      set(t);
      return *this;
    }
 
    //*************************************************************************
    //*************************************************************************
    cyclic_value& operator =(const cyclic_value& other)
    {
      value       = other.value;
      first_value = other.first_value;
      last_value  = other.last_value;
      return *this;
    }
 
    //*************************************************************************
    //*************************************************************************
    T get() const
    {
      return value;
    }
 
    //*************************************************************************
    //*************************************************************************
    T first() const
    {
      return first_value;
    }
 
    //*************************************************************************
    //*************************************************************************
    T last() const
    {
      return last_value;
    }
 
    //*************************************************************************
    //*************************************************************************
    void swap(cyclic_value<T, FIRST, LAST>& other)
    {
      using ETL_OR_STD::swap; // Allow ADL
 
      swap(first_value, other.first_value);
      swap(last_value, other.last_value);
      swap(value, other.value);
    }
 
    //*************************************************************************
    //*************************************************************************
    friend void swap(cyclic_value<T, FIRST, LAST>& lhs, cyclic_value<T, FIRST, LAST>& rhs)
    {
      lhs.swap(rhs);
    }
 
    //*************************************************************************
    //*************************************************************************
    friend bool operator == (const cyclic_value<T, FIRST, LAST>& lhs, const cyclic_value<T, FIRST, LAST>& rhs)
    {
      return (lhs.value       == rhs.value) &&
             (lhs.first_value == rhs.first_value) &&
             (lhs.last_value  == rhs.last_value);
    }
 
    //*************************************************************************
    //*************************************************************************
    friend bool operator != (const cyclic_value<T, FIRST, LAST>& lhs, const cyclic_value<T, FIRST, LAST>& rhs)
    {
      return !(lhs == rhs);
    }
 
  private:
 
    T value;       
    T first_value; 
    T last_value;  
  };
}
 
#endif