dustinbrownman

class Calculator
  def phrase_cleaner(phrase)
    operands = phrase.match(/([0-9,-]+.*[\w])/)[0]
  end

  def number_filter(phrase)
    numbers = phrase.scan(/[0-9,-]+/)
    numbers.map { |number| number.to_i }
  end

dustinbrownman

def sieve(number)
  if number < 2
    raise TypeError.new("Must be a number greater than 2")
  end
  primes =* (2..number)
  primes.each do |prime|
    primes.reject! do |number|
      prime != number && number % prime == 0
    end
  end

dustinbrownman

def largest_series_product(number, span_length=3)
  if number.match(/\D/)
    raise ArgumentError.new("Numbers only")
  elsif number.length < span_length
    raise ArgumentError.new("The number must have at least #{span_length} digits")
  end
  product_finder(series_splitter(number, span_length)).max
end

def series_splitter(number, span_length)

dustinbrownman

def binary(binary_string)
  if !(binary_string.is_a?(String)) || binary_string.match(/[^0,1]/)
    raise TypeError.new("Input must be only 0s and 1s") 
  end

  total = 0
  binary_string.reverse.split("").each_with_index do |bit, index|
    total += bit.to_i * 2 ** index
  end
  total

dustinbrownman

def anagrams(word, possible_anagrams)
  unless possible_anagrams.is_a?(Array) || possible_anagrams.all? { |anagram| anagram.is_a?(String) }
    raise TypeError.new("The possible anagrams must be an array")
  end

  possible_anagrams.find_all do |anagram|
    word.chars.sort == anagram.chars.sort
  end
end