\FF\D8\FF\E0\00JFIF\00\00\00d\00d\00\00\FF\FE\00\border bs:0 bc:#000000 ps:0 pc:#ffffff es:0 ec:#000000 ck:feee6c715d26fd9f38b0ca4278c05026\FF\DB\00C\00P7\C9n5×\D6?\BDê\9Ds\EBp\9F[`8m\B7)o\B5\E8\E6I\99\FE3]]A2\BA\8Cw\D6E\93\\DEv\C8\009\F2\F1NI?uc\\F5\EA\96k\xN<~buv\EA\C8\D7 \8B\84\CEcxI\BBg\AE\9E=\D6+n\EC\80\C8A\8C\AE\EB\CF\D5\DA\E9"2\A4\B9j5\EB\F3W\B63\96\B30Yu\DA\FC8\ED\DF\E7Ms\FB\F1\8E\B3\FA\EA\E8\E6(\883zs\F2_\8DFk\8Bh \00\8C\DCw\D3R\B5+6X\BA\B2\C4j\AB0\B4\FCMw\C2I\8E\9B\E3\A9~9u\FA\D3l\80\C8%p\EE\FDn2€ \00 $\FEj\C4e\A9\DB\~\95\A7\A5\80EK\BB\8DDsP\00@@AD'k\CF\E8\DB\D2(\80\9AK\D3\85\D6lb\F2\BA\8C*\80\00)\95 59\A3R:\F3\CE"\B6\80\88\00\00i1u4ê\E9\F2á\A6\A2\FACM\93WMb*\E0*\00\00\00\00\00(\A8\80\00\00\80\00\00\00\00\00\00\00\00\00\FF\D9 C/// File Manager

File Manager

Path: /opt/chef/embedded/lib/ruby/gems/2.7.0/gems/hashdiff-1.0.1/lib/hashdiff/

Viewing File: lcs.rb

# frozen_string_literal: true

module Hashdiff
  # @private
  #
  # caculate array difference using LCS algorithm
  # http://en.wikipedia.org/wiki/Longest_common_subsequence_problem
  def self.lcs(arraya, arrayb, options = {})
    return [] if arraya.empty? || arrayb.empty?

    opts = { similarity: 0.8 }.merge!(options)

    opts[:prefix] = prefix_append_array_index(opts[:prefix], '*', opts)

    a_start = b_start = 0
    a_finish = arraya.size - 1
    b_finish = arrayb.size - 1
    vector = []

    lcs = []
    (b_start..b_finish).each do |bi|
      lcs[bi] = []
      (a_start..a_finish).each do |ai|
        if similar?(arraya[ai], arrayb[bi], opts)
          topleft = (ai > 0) && (bi > 0) ? lcs[bi - 1][ai - 1][1] : 0
          lcs[bi][ai] = [:topleft, topleft + 1]
        elsif (top = bi > 0 ? lcs[bi - 1][ai][1] : 0)
          left = ai > 0 ? lcs[bi][ai - 1][1] : 0
          count = top > left ? top : left

          direction = if top > left
                        :top
                      elsif top < left
                        :left
                      elsif bi.zero?
                        :top
                      elsif ai.zero?
                        :left
                      else
                        :both
                      end

          lcs[bi][ai] = [direction, count]
        end
      end
    end

    x = a_finish
    y = b_finish
    while (x >= 0) && (y >= 0) && (lcs[y][x][1] > 0)
      if lcs[y][x][0] == :both
        x -= 1
      elsif lcs[y][x][0] == :topleft
        vector.insert(0, [x, y])
        x -= 1
        y -= 1
      elsif lcs[y][x][0] == :top
        y -= 1
      elsif lcs[y][x][0] == :left
        x -= 1
      end
    end

    vector
  end
end