jacobninja / exercism-analysis Goto Github PK

class Hamming
  def self.compute(first_sequence, second_sequence)
    hamming_counter = 0
    unless first_sequence.length != second_sequence.length
        split_first_sequence = first_sequence.split('')
        split_second_sequence = second_sequence.split('')
        split_first_sequence.select.with_index do |first_sequence_base,index|
          hamming_counter += 1 if first_sequence_base != split_second_sequence[index]
        end
         hamming_counter

    end
  end
end

class Hamming 
    def self.compute (x,y)
        a = 0;
        min = [x.length,y.length].min
        for i in 0...min 
            if x[i]!=y[i]
                a += 1
            end
        end
        return a
    end
end

class Hamming
  def self.compute(strand1, strand2)
    min = [strand1.length, strand2.length].min
    (0...min).count do |i|
      strand1[i] != strand2[i]
    end
  end
end

class Hamming
    def self.compute dna1, dna2
        #compute Hamming distance of 2 DNA strings        
        prep1 = self.prepare dna1 
        prep2 = self.prepare dna2 

        self.calculate prep1, prep2
    end

    def self.prepare(dna)
        #preparation steps
        dna_hash = Hash.new 
        dna.split(//).each_with_index do |index, key|
            dna_hash[key] = index            
        end
        dna_hash
    end    

    def self.calculate(dna1, dna2)
        #if values for the same index are not the same, increase distance            
        distance = 0
        dna1.each do |key, value| 
            unless dna2[key] == value then distance+=1 end
        end
        distance
    end
end

"class Hamming\r\n    def self.compute dna1, dna2\r\n        #compute Hamming distance of 2 DNA strings        \r\n        prep1 = self.prepare dna1 \r\n        prep2 = self.prepare dna2 \r\n\r\n        self.calculate prep1, prep2\r\n    end\r\n\r\n    def self.prepare(dna)\r\n        #preparation steps\r\n        dna_hash = Hash.new \r\n        dna.split(//).each_with_index do |index, key|\r\n            dna_hash[key] = index            \r\n        end\r\n        dna_hash\r\n    end    \r\n\r\n    def self.calculate(dna1, dna2)\r\n        #if values for the same index are not the same, increase distance            \r\n        distance = 0\r\n        dna1.each do |key, value| \r\n            unless dna2[key] == value then distance+=1 end\r\n        end\r\n        distance\r\n    end\r\nend"

#1 - class/private/end aligned
class Thing
  def stuff
    # ...
  end

private

  def mine
    # ...
  end
end

#2 - class/end + def/end/private/def/end 
class Thing
  def stuff
    # ...
  end

  private

  def mine
    # ...
  end
end

#3 - class/end + def/end/private + def/end 
class Thing
  def stuff
    # ...
  end

  private

    def mine
      # ...
    end
end

    def count_differences(seqs)
      short, long = *seqs
      short.chars.zip(long.chars)
        .map{ |char1, char2| char1 == char2 ? 0 : 1 }
        .reduce(&:+)
    end

module Hamming

  module_function

  def compute(first_strand, second_strand)
    length = [first_strand, second_strand].map(&:size).min
    pairs = first_strand.each_char.zip(second_strand.each_char).take(length)

    pairs.count { |a, b| a != b }
  end
end

class Hamming 
  def self.compute(s1, s2)
    iterations = s1.length < s2.length ? s1.length : s2.length

    hd = 0
    for i in 0...iterations
      hd += 1 if s1[i] != s2[i]
    end

    hd
  end
end

RubyAnalyzers = [
  Exercism::Analyzers::ControlFlow,
  Exercism::Analyzers::Indentation,
  Exercism::Analyzers::ForLoop
]