我想将此代码干燥。像在rails中使用before_action方法那样做到这一点的最佳解决方案?
class Direction
attr_accessor :dir
def initialize(dir)
@dir = dir
end
DIRECTIONS = %w[N E S W]
def turn_left
d = DIRECTIONS.find_index(dir)
@dir = DIRECTIONS.rotate!(d-1).first
end
def turn_right
d = DIRECTIONS.find_index(dir)
@dir = DIRECTIONS.rotate!(d+1).first
end
end
答案 0 :(得分:2)
# frozen_string_literal: true
class Direction
DIRECTIONS = %w[N E S W].freeze
OPERATIONS = { left: :-, right: :+ }.freeze
private_constant :DIRECTIONS, :OPERATIONS
def initialize(dir)
@dir = dir
end
OPERATIONS.keys.each do |turn_direction| # turn_left, turn_right
define_method "turn_#{turn_direction}" do
turn(turn_direction)
end
end
private
attr_reader :dir
def direction_index
DIRECTIONS.find_index(dir)
end
def turn(operation)
DIRECTIONS.rotate(direction_index.public_send(OPERATIONS[operation], 1)).first
end
end
p Direction.new('N').turn_left # "W"
p Direction.new('E').turn_left # "N"
p Direction.new('S').turn_left # "E"
p Direction.new('W').turn_left # "S"
p Direction.new('N').turn_right # "E"
p Direction.new('E').turn_right # "S"
p Direction.new('S').turn_right # "W"
p Direction.new('W').turn_right # "N"
您可以:
freeze
您的常量以避免修改。Direction
类之外使用常量,请更改其可见性。dir
,则更改其可见性。OPERATIONS
散列,该散列定义了方向以及用于返回下一个方向的操作。OPERATIONS
键以动态定义方法turn_left
和turn_right
。direction_index
方法,该方法使用DIRECTIONS
返回dir
中的索引。operation
参数:
operation
,您可以从OPERATIONS
获得有关如何旋转(正向或负向)的操作。-
或+
应用于direction_index
的结果,您将获得旋转参数。rotate
上调用DIRECTIONS
,并获得第一个元素。答案 1 :(得分:2)
我建议使用散列,主要是为了提高可读性。
class Direction
NEXT_LEFT = { 'N'=>'W', 'W'=>'S', 'S'=>'E', 'E'=>'N' }
NEXT_RIGHT = NEXT_LEFT.invert
attr_reader :dir
def initialize(dir)
@dir = dir
end
def turn_left
turn(NEXT_LEFT)
end
def turn_right
turn(NEXT_RIGHT)
end
private
def turn(nxt)
@dir = nxt[@dir]
end
end
d = Direction.new('N')
d.dir
#=> "N"
d.turn_left
#=> "W"
d.turn_left
#=> "S"
d.turn_right
#=> "W"
注意:
NEXT_RIGHT
#=> {"W"=>"N", "S"=>"W", "E"=>"S", "N"=>"E"}
答案 2 :(得分:2)
很多很好的答案,但是一个简单的直接解决方案是将两种方法之间的共同部分分解为turn方法并传递1
或-1
。
class Direction
attr_accessor :dir
def initialize(dir)
@dir = dir
end
DIRECTIONS = %w[N E S W]
def turn(delta_d)
d = DIRECTIONS.find_index(dir)
@dir = DIRECTIONS.rotate!(d + delta_d).first
end
def turn_left
turn(-1)
end
def turn_right
turn(1)
end
end
答案 3 :(得分:1)
您始终可以实现独立于状态的方向图:
class DirectionMap
def initialize(*list)
# Create a Hash mapping table with left and right directions
# pre-computed. This uses modulo to "wrap" the array around.
@directions = list.map.with_index do |dir, i|
[ dir, [ list[(i - 1) % list.length], list[(i + 1) % list.length] ] ]
end.to_h
end
# These methods use dig to avoid blowing up on an invalid direction,
# instead just returning nil for garbage input.
def left(dir)
@directions.dig(dir, 0)
end
def right(dir)
@directions.dig(dir, 1)
end
end
您现在可以在其中导航任意罗盘映射的地方:
map = DirectionMap.new(*%w[ N E S W ])
map.left('N') # => 'W'
map.left(map.left('N')) # => 'S'
map.right('N') # => 'E'
map.right(map.left('N')) # => 'N'
因此您也可以执行%w[ N NE E SE S SW W NW ]
。
答案 4 :(得分:1)
我认为您可以避免每次旋转都可以创建新数组的所有工作(通过调用rotate
)。只需将当前方向存储为其数组中字母的索引即可。转向只是索引的模块化算法(请注意,在Ruby -1 % 4 == 3
中)。而且,当您需要方向字母时,只需使用索引从数组中获取即可。
class Direction
DIRECTIONS = %w[N E S W].freeze
def initialize(dir)
self.dir = dir
end
# dir getter
def dir
DIRECTIONS[@dir_index]
end
# dir setter
def dir=(dir)
@dir_index = DIRECTIONS.index(dir)
end
# turning logic
def turn(delta)
@dir_index = (@dir_index + delta) % DIRECTIONS.size
dir
end
def turn_left
turn(-1)
end
def turn_right
turn(1)
end
end
p Direction.new('N').turn_left #=> "W"
p Direction.new('E').turn_left #=> "N"
p Direction.new('S').turn_left #=> "E"
p Direction.new('W').turn_left #=> "S"
p Direction.new('N').turn_right #=> "E"
p Direction.new('E').turn_right #=> "S"
p Direction.new('S').turn_right #=> "W"
p Direction.new('W').turn_right #=> "N"