Решение на Втора задача от Деян Боиклиев

Обратно към всички решения

Към профила на Деян Боиклиев

Резултати

  • 6 точки от тестове
  • 1 бонус точка
  • 7 точки общо
  • 24 успешни тест(а)
  • 0 неуспешни тест(а)

Код

require 'set'
class NumberSet
include Enumerable
def initialize(numbers = [])
@numbers = Set.new(numbers)
end
def <<(number)
unless @numbers.any? { |element| element == number }
@numbers << number
end
self
end
def [](filter)
filtered_set = @numbers.select { |number| filter.is_accepted?(number) }
NumberSet.new(filtered_set)
end
def size
@numbers.size
end
def empty?
@numbers.empty?
end
def each(&block)
@numbers.each &block
end
def to_s
@numbers.to_a.to_s
end
end
class Filter
def initialize(&block)
@filter = block
end
def is_accepted?(number)
@filter.call(number)
end
def &(filter)
Filter.new { |n| is_accepted?(n) & filter.is_accepted?(n) }
end
def |(filter)
Filter.new { |n| is_accepted?(n) | filter.is_accepted?(n) }
end
end
class TypeFilter < Filter
def initialize(type)
case type
when :integer then filter = ->(n) { n.is_a? Fixnum }
when :real then filter = ->(n) { n.is_a? Float or n.is_a? Rational }
when :complex then filter = ->(n) { n.is_a? Complex }
when :rational then filter = ->(n) { n.is_a? Rational }
end
super &filter
end
end
class SignFilter < Filter
def initialize(sign)
case sign
when :positive then filter = ->(n) { n > 0 }
when :non_positive then filter = ->(n) { n <= 0 }
when :negative then filter = ->(n) { n < 0 }
when :non_negative then filter = ->(n) { n >= 0 }
end
super &filter
end
end

Лог от изпълнението

........................

Finished in 0.03174 seconds
24 examples, 0 failures

История (3 версии и 2 коментара)

Деян обнови решението на 26.10.2014 18:04 (преди над 9 години)

+require 'set'
+
+class NumberSet
+ include Enumerable
+
+ def initialize(numbers = [])
+ @numbers = Set.new(numbers)
+ end
+
+ def << (number)
+ unless @numbers.any? { |element| element == number }
+ @numbers << number
+ end
+ self
+ end
+
+ def [](filter)
+ filtered_set = @numbers.select { |number| filter.execute(number) }
+ NumberSet.new(filtered_set)
+ end
+
+ def size
+ @numbers.size
+ end
+
+ def empty?
+ @numbers.empty?
+ end
+
+ def each &block
+ @numbers.each &block
+ end
+
+ def to_s
+ @numbers.to_a.to_s
+ end
+end
+
+class Filter
+ def initialize &block
+ @filter = block
+ end
+
+ def execute number
+ @filter.call(number)
+ end
+
+ def &(filter)
+ Filter.new { |n| execute(n) & filter.execute(n) }
+ end
+
+ def |(filter)
+ Filter.new { |n| execute(n) | filter.execute(n) }
+ end
+end
+
+class TypeFilter < Filter
+ def initialize type
+ case type
+ when :integer then filter = ->(n) { n.is_a? Fixnum }
+ when :real then filter = ->(n) { n.is_a? Float or n.is_a? Rational }
+ when :complex then filter = ->(n) { n.is_a? Complex }
+ when :rational then filter = ->(n) { n.is_a? Rational }
+ end
+ super &filter
+ end
+end
+
+class SignFilter < Filter
+ def initialize sign
+ case sign
+ when :positive then filter = ->(n) { n > 0 }
+ when :non_positive then filter = ->(n) { n <= 0 }
+ when :negative then filter = ->(n) { n < 0 }
+ when :non_negative then filter = ->(n) { n >= 0 }
+ end
+ super &filter
+ end
+end

Деян обнови решението на 26.10.2014 21:11 (преди над 9 години)

require 'set'
class NumberSet
include Enumerable
def initialize(numbers = [])
@numbers = Set.new(numbers)
end
- def << (number)
+ def <<(number)
unless @numbers.any? { |element| element == number }
@numbers << number
end
self
end
def [](filter)
filtered_set = @numbers.select { |number| filter.execute(number) }
NumberSet.new(filtered_set)
end
def size
@numbers.size
end
def empty?
@numbers.empty?
end
def each &block
@numbers.each &block
end
def to_s
@numbers.to_a.to_s
end
end
class Filter
def initialize &block
@filter = block
end
def execute number
@filter.call(number)
end
def &(filter)
Filter.new { |n| execute(n) & filter.execute(n) }
end
def |(filter)
Filter.new { |n| execute(n) | filter.execute(n) }
end
end
class TypeFilter < Filter
def initialize type
case type
when :integer then filter = ->(n) { n.is_a? Fixnum }
when :real then filter = ->(n) { n.is_a? Float or n.is_a? Rational }
when :complex then filter = ->(n) { n.is_a? Complex }
when :rational then filter = ->(n) { n.is_a? Rational }
end
super &filter
end
end
class SignFilter < Filter
def initialize sign
case sign
when :positive then filter = ->(n) { n > 0 }
when :non_positive then filter = ->(n) { n <= 0 }
when :negative then filter = ->(n) { n < 0 }
when :non_negative then filter = ->(n) { n >= 0 }
end
super &filter
end
end

Браво.

Добро е решението. Виждам няколко неща, които могат да се дооправят.

  • Слагай скоби около параметрите на метод при дефиниция.
  • По-добро име за Filter#execute? Какъв резултат връща?
  • @numbers.any? { |element| element == number }. Set си има метод за това.

Деян обнови решението на 27.10.2014 08:07 (преди над 9 години)

require 'set'
class NumberSet
include Enumerable
def initialize(numbers = [])
@numbers = Set.new(numbers)
end
def <<(number)
unless @numbers.any? { |element| element == number }
@numbers << number
end
self
end
def [](filter)
- filtered_set = @numbers.select { |number| filter.execute(number) }
+ filtered_set = @numbers.select { |number| filter.is_accepted?(number) }
NumberSet.new(filtered_set)
end
def size
@numbers.size
end
def empty?
@numbers.empty?
end
- def each &block
+ def each(&block)
@numbers.each &block
end
def to_s
@numbers.to_a.to_s
end
end
class Filter
- def initialize &block
+ def initialize(&block)
@filter = block
end
- def execute number
+ def is_accepted?(number)
@filter.call(number)
end
def &(filter)
- Filter.new { |n| execute(n) & filter.execute(n) }
+ Filter.new { |n| is_accepted?(n) & filter.is_accepted?(n) }
end
def |(filter)
- Filter.new { |n| execute(n) | filter.execute(n) }
+ Filter.new { |n| is_accepted?(n) | filter.is_accepted?(n) }
end
end
class TypeFilter < Filter
- def initialize type
+ def initialize(type)
case type
when :integer then filter = ->(n) { n.is_a? Fixnum }
when :real then filter = ->(n) { n.is_a? Float or n.is_a? Rational }
when :complex then filter = ->(n) { n.is_a? Complex }
when :rational then filter = ->(n) { n.is_a? Rational }
end
super &filter
end
end
class SignFilter < Filter
- def initialize sign
+ def initialize(sign)
case sign
when :positive then filter = ->(n) { n > 0 }
when :non_positive then filter = ->(n) { n <= 0 }
when :negative then filter = ->(n) { n < 0 }
when :non_negative then filter = ->(n) { n >= 0 }
end
super &filter
end
end