# The MIT License (MIT)
#
# Copyright (c) 2016 ITO SOFT DESIGN Inc.
#
# 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.

module LadderDrive
module Protocol
module Mitsubishi

  class QDevice

    attr_reader :suffix, :number

    SUFFIXES = %w(SM SD X Y M L F V B D W TS TC TN SS SC SN CS CC CN SB SW S DX DY Z R ZR)
    SUFFIX_CODES = [0x91, 0xa9, 0x9c, 0x9d, 0x90, 0x92, 0x93, 0x94, 0xa0, 0xa8, 0xb4, 0xc1, 0xc0, 0xc2, 0xc7, 0xc6, 0xc8, 0xc4, 0xc3, 0xc5, 0xa1, 0xb5, 0x98, 0xa2, 0xa3, 0xcc ,0xaf, 0xb0]

    def initialize a, b = nil
      case a
      when Array
        case a.size
        when 4
          @suffix = suffix_for_code(a[3])
          @number = ((a[2] << 8 | a[1]) << 8) | a[0]
        end
      when String
        if b
          @suffix = a.upcase
          @number = b
        else
          if a.length == 12
            @suffix = [a[0,2].to_i(16), a[2,2].to_i(16)].pack "C*"
            @suffix.strip!
            @number = a[4,8].to_i(16)
          elsif /(X|Y)(.+)/i =~ a
            @suffix = $1.upcase
            @number = $2.to_i(p_adic_number)
          else
            /(M|L|S|B|F|T|C|D|W|R|ZR)(.+)/i =~ a
            @suffix = $1.upcase
            @number = $2.to_i(p_adic_number)
          end
        end
      end
    end

    def p_adic_number
      case @suffix
      when "X", "Y", "B", "W", "SB", "SW", "DX", "DY"
        16
      else
        10
      end
    end

    def name
      @suffix + @number.to_s(p_adic_number).upcase
    end

    def next_device
      d = self.class.new @suffix, @number + 1
      d
    end

    def bit_device?
      case @suffix
      when "SM", "X", "Y", "M", "L", "F", "V", "B",
           "TS", "TC", "SS", "SC","CS", "CC", "SB", "S", "DX", "DY"
        true
      else
        false
      end
    end

    def suffix_for_code code
      index = SUFFIX_CODES.index code
      index ? SUFFIXES[index] : nil
    end

    def suffix_code
      index = SUFFIXES.index suffix
      index ? SUFFIX_CODES[index] : 0
    end

    def + value
      self.class.new self.suffix, self.number + value
    end

    def - value
      self.class.new self.suffix, [self.number - value, 0].max
    end

  end

end
end
end