xaiml 0.1.3 → 0.1.4

data/vendor/bundle/ruby/2.5.0/gems/diff-lcs-1.3/docs/artistic.txt

@@ -1,127 +0,0 @@
-The "Artistic License"
-
-				Preamble
-
-The intent of this document is to state the conditions under which a
-Package may be copied, such that the Copyright Holder maintains some
-semblance of artistic control over the development of the package,
-while giving the users of the package the right to use and distribute
-the Package in a more-or-less customary fashion, plus the right to make
-reasonable modifications.
-
-Definitions:
-
-	"Package" refers to the collection of files distributed by the
-	Copyright Holder, and derivatives of that collection of files
-	created through textual modification.
-
-	"Standard Version" refers to such a Package if it has not been
-	modified, or has been modified in accordance with the wishes
-	of the Copyright Holder as specified below.
-
-	"Copyright Holder" is whoever is named in the copyright or
-	copyrights for the package.
-
-	"You" is you, if you're thinking about copying or distributing
-	this Package.
-
-	"Reasonable copying fee" is whatever you can justify on the
-	basis of media cost, duplication charges, time of people involved,
-	and so on.  (You will not be required to justify it to the
-	Copyright Holder, but only to the computing community at large
-	as a market that must bear the fee.)
-
-	"Freely Available" means that no fee is charged for the item
-	itself, though there may be fees involved in handling the item.
-	It also means that recipients of the item may redistribute it
-	under the same conditions they received it.
-
-1. You may make and give away verbatim copies of the source form of the
-Standard Version of this Package without restriction, provided that you
-duplicate all of the original copyright notices and associated disclaimers.
-
-2. You may apply bug fixes, portability fixes and other modifications
-derived from the Public Domain or from the Copyright Holder.  A Package
-modified in such a way shall still be considered the Standard Version.
-
-3. You may otherwise modify your copy of this Package in any way, provided
-that you insert a prominent notice in each changed file stating how and
-when you changed that file, and provided that you do at least ONE of the
-following:
-
-    a) place your modifications in the Public Domain or otherwise make them
-    Freely Available, such as by posting said modifications to Usenet or
-    an equivalent medium, or placing the modifications on a major archive
-    site such as uunet.uu.net, or by allowing the Copyright Holder to include
-    your modifications in the Standard Version of the Package.
-
-    b) use the modified Package only within your corporation or organization.
-
-    c) rename any non-standard executables so the names do not conflict
-    with standard executables, which must also be provided, and provide
-    a separate manual page for each non-standard executable that clearly
-    documents how it differs from the Standard Version.
-
-    d) make other distribution arrangements with the Copyright Holder.
-
-4. You may distribute the programs of this Package in object code or
-executable form, provided that you do at least ONE of the following:
-
-    a) distribute a Standard Version of the executables and library files,
-    together with instructions (in the manual page or equivalent) on where
-    to get the Standard Version.
-
-    b) accompany the distribution with the machine-readable source of
-    the Package with your modifications.
-
-    c) give non-standard executables non-standard names, and clearly
-    document the differences in manual pages (or equivalent), together
-    with instructions on where to get the Standard Version.
-
-    d) make other distribution arrangements with the Copyright Holder.
-
-5. You may charge a reasonable copying fee for any distribution of this
-Package.  You may charge any fee you choose for support of this
-Package.  You may not charge a fee for this Package itself.  However,
-you may distribute this Package in aggregate with other (possibly
-commercial) programs as part of a larger (possibly commercial) software
-distribution provided that you do not advertise this Package as a
-product of your own.  You may embed this Package's interpreter within
-an executable of yours (by linking); this shall be construed as a mere
-form of aggregation, provided that the complete Standard Version of the
-interpreter is so embedded.
-
-6. The scripts and library files supplied as input to or produced as
-output from the programs of this Package do not automatically fall
-under the copyright of this Package, but belong to whoever generated
-them, and may be sold commercially, and may be aggregated with this
-Package.  If such scripts or library files are aggregated with this
-Package via the so-called "undump" or "unexec" methods of producing a
-binary executable image, then distribution of such an image shall
-neither be construed as a distribution of this Package nor shall it
-fall under the restrictions of Paragraphs 3 and 4, provided that you do
-not represent such an executable image as a Standard Version of this
-Package.
-
-7. C subroutines (or comparably compiled subroutines in other
-languages) supplied by you and linked into this Package in order to
-emulate subroutines and variables of the language defined by this
-Package shall not be considered part of this Package, but are the
-equivalent of input as in Paragraph 6, provided these subroutines do
-not change the language in any way that would cause it to fail the
-regression tests for the language.
-
-8. Aggregation of this Package with a commercial distribution is always
-permitted provided that the use of this Package is embedded; that is,
-when no overt attempt is made to make this Package's interfaces visible
-to the end user of the commercial distribution.  Such use shall not be
-construed as a distribution of this Package.
-
-9. The name of the Copyright Holder may not be used to endorse or promote
-products derived from this software without specific prior written permission.
-
-10. THIS PACKAGE IS PROVIDED "AS IS" AND WITHOUT ANY EXPRESS OR
-IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED
-WARRANTIES OF MERCHANTIBILITY AND FITNESS FOR A PARTICULAR PURPOSE.
-
-				The End

data/vendor/bundle/ruby/2.5.0/gems/diff-lcs-1.3/lib/diff/lcs/array.rb

@@ -1,7 +0,0 @@
-# -*- ruby encoding: utf-8 -*-
-
-require 'diff/lcs'
-
-class Array
-  include Diff::LCS
-end

data/vendor/bundle/ruby/2.5.0/gems/diff-lcs-1.3/lib/diff/lcs/block.rb

@@ -1,37 +0,0 @@
-# -*- ruby encoding: utf-8 -*-
-
-# A block is an operation removing, adding, or changing a group of items.
-# Basically, this is just a list of changes, where each change adds or
-# deletes a single item. Used by bin/ldiff.
-class Diff::LCS::Block
-  attr_reader :changes, :insert, :remove
-
-  def initialize(chunk)
-    @changes = []
-    @insert = []
-    @remove = []
-
-    chunk.each do |item|
-      @changes << item
-      @remove << item if item.deleting?
-      @insert << item if item.adding?
-    end
-  end
-
-  def diff_size
-    @insert.size - @remove.size
-  end
-
-  def op
-    case [@remove.empty?, @insert.empty?]
-    when [false, false]
-      '!'
-    when [false, true]
-      '-'
-    when [true, false]
-      '+'
-    else # [true, true]
-      '^'
-    end
-  end
-end

data/vendor/bundle/ruby/2.5.0/gems/diff-lcs-1.3/lib/diff/lcs/callbacks.rb

@@ -1,322 +0,0 @@
-# -*- ruby encoding: utf-8 -*-
-
-require 'diff/lcs/change'
-
-module Diff::LCS
-  # This callback object implements the default set of callback events,
-  # which only returns the event itself. Note that #finished_a and
-  # #finished_b are not implemented -- I haven't yet figured out where they
-  # would be useful.
-  #
-  # Note that this is intended to be called as is, e.g.,
-  #
-  #     Diff::LCS.LCS(seq1, seq2, Diff::LCS::DefaultCallbacks)
-  class DefaultCallbacks
-    class << self
-      # Called when two items match.
-      def match(event)
-        event
-      end
-      # Called when the old value is discarded in favour of the new value.
-      def discard_a(event)
-        event
-      end
-      # Called when the new value is discarded in favour of the old value.
-      def discard_b(event)
-        event
-      end
-      # Called when both the old and new values have changed.
-      def change(event)
-        event
-      end
-
-      private :new
-    end
-  end
-
-  # An alias for DefaultCallbacks that is used in
-  # Diff::LCS#traverse_sequences.
-  #
-  #     Diff::LCS.LCS(seq1, seq2, Diff::LCS::SequenceCallbacks)
-  SequenceCallbacks = DefaultCallbacks
-
-  # An alias for DefaultCallbacks that is used in
-  # Diff::LCS#traverse_balanced.
-  #
-  #     Diff::LCS.LCS(seq1, seq2, Diff::LCS::BalancedCallbacks)
-  BalancedCallbacks = DefaultCallbacks
-
-  def self.callbacks_for(callbacks)
-    callbacks.new rescue callbacks
-  end
-end
-
-# This will produce a compound array of simple diff change objects. Each
-# element in the #diffs array is a +hunk+ or +hunk+ array, where each
-# element in each +hunk+ array is a single Change object representing the
-# addition or removal of a single element from one of the two tested
-# sequences. The +hunk+ provides the full context for the changes.
-#
-#     diffs = Diff::LCS.diff(seq1, seq2)
-#       # This example shows a simplified array format.
-#       # [ [ [ '-',  0, 'a' ] ],   # 1
-#       #   [ [ '+',  2, 'd' ] ],   # 2
-#       #   [ [ '-',  4, 'h' ],     # 3
-#       #     [ '+',  4, 'f' ] ],
-#       #   [ [ '+',  6, 'k' ] ],   # 4
-#       #   [ [ '-',  8, 'n' ],     # 5
-#       #     [ '-',  9, 'p' ],
-#       #     [ '+',  9, 'r' ],
-#       #     [ '+', 10, 's' ],
-#       #     [ '+', 11, 't' ] ] ]
-#
-# There are five hunks here. The first hunk says that the +a+ at position 0
-# of the first sequence should be deleted (<tt>'-'</tt>). The second hunk
-# says that the +d+ at position 2 of the second sequence should be inserted
-# (<tt>'+'</tt>). The third hunk says that the +h+ at position 4 of the
-# first sequence should be removed and replaced with the +f+ from position 4
-# of the second sequence. The other two hunks are described similarly.
-#
-# === Use
-#
-# This callback object must be initialised and is used by the Diff::LCS#diff
-# method.
-#
-#     cbo = Diff::LCS::DiffCallbacks.new
-#     Diff::LCS.LCS(seq1, seq2, cbo)
-#     cbo.finish
-#
-# Note that the call to #finish is absolutely necessary, or the last set of
-# changes will not be visible. Alternatively, can be used as:
-#
-#     cbo = Diff::LCS::DiffCallbacks.new { |tcbo| Diff::LCS.LCS(seq1, seq2, tcbo) }
-#
-# The necessary #finish call will be made.
-#
-# === Simplified Array Format
-#
-# The simplified array format used in the example above can be obtained
-# with:
-#
-#     require 'pp'
-#     pp diffs.map { |e| e.map { |f| f.to_a } }
-class Diff::LCS::DiffCallbacks
-  # Returns the difference set collected during the diff process.
-  attr_reader :diffs
-
-  def initialize # :yields self:
-    @hunk = []
-    @diffs = []
-
-    if block_given?
-      begin
-        yield self
-      ensure
-        self.finish
-      end
-    end
-  end
-
-  # Finalizes the diff process. If an unprocessed hunk still exists, then it
-  # is appended to the diff list.
-  def finish
-    finish_hunk
-  end
-
-  def match(event)
-    finish_hunk
-  end
-
-  def discard_a(event)
-    @hunk << Diff::LCS::Change.new('-', event.old_position, event.old_element)
-  end
-
-  def discard_b(event)
-    @hunk << Diff::LCS::Change.new('+', event.new_position, event.new_element)
-  end
-
-  def finish_hunk
-    @diffs << @hunk unless @hunk.empty?
-    @hunk = []
-  end
-  private :finish_hunk
-end
-
-# This will produce a compound array of contextual diff change objects. Each
-# element in the #diffs array is a "hunk" array, where each element in each
-# "hunk" array is a single change. Each change is a Diff::LCS::ContextChange
-# that contains both the old index and new index values for the change. The
-# "hunk" provides the full context for the changes. Both old and new objects
-# will be presented for changed objects. +nil+ will be substituted for a
-# discarded object.
-#
-#     seq1 = %w(a b c e h j l m n p)
-#     seq2 = %w(b c d e f j k l m r s t)
-#
-#     diffs = Diff::LCS.diff(seq1, seq2, Diff::LCS::ContextDiffCallbacks)
-#       # This example shows a simplified array format.
-#       # [ [ [ '-', [  0, 'a' ], [  0, nil ] ] ],   # 1
-#       #   [ [ '+', [  3, nil ], [  2, 'd' ] ] ],   # 2
-#       #   [ [ '-', [  4, 'h' ], [  4, nil ] ],     # 3
-#       #     [ '+', [  5, nil ], [  4, 'f' ] ] ],
-#       #   [ [ '+', [  6, nil ], [  6, 'k' ] ] ],   # 4
-#       #   [ [ '-', [  8, 'n' ], [  9, nil ] ],     # 5
-#       #     [ '+', [  9, nil ], [  9, 'r' ] ],
-#       #     [ '-', [  9, 'p' ], [ 10, nil ] ],
-#       #     [ '+', [ 10, nil ], [ 10, 's' ] ],
-#       #     [ '+', [ 10, nil ], [ 11, 't' ] ] ] ]
-#
-# The five hunks shown are comprised of individual changes; if there is a
-# related set of changes, they are still shown individually.
-#
-# This callback can also be used with Diff::LCS#sdiff, which will produce
-# results like:
-#
-#     diffs = Diff::LCS.sdiff(seq1, seq2, Diff::LCS::ContextCallbacks)
-#       # This example shows a simplified array format.
-#       # [ [ [ "-", [  0, "a" ], [  0, nil ] ] ],  # 1
-#       #   [ [ "+", [  3, nil ], [  2, "d" ] ] ],  # 2
-#       #   [ [ "!", [  4, "h" ], [  4, "f" ] ] ],  # 3
-#       #   [ [ "+", [  6, nil ], [  6, "k" ] ] ],  # 4
-#       #   [ [ "!", [  8, "n" ], [  9, "r" ] ],    # 5
-#       #     [ "!", [  9, "p" ], [ 10, "s" ] ],
-#       #     [ "+", [ 10, nil ], [ 11, "t" ] ] ] ]
-#
-# The five hunks are still present, but are significantly shorter in total
-# presentation, because changed items are shown as changes ("!") instead of
-# potentially "mismatched" pairs of additions and deletions.
-#
-# The result of this operation is similar to that of
-# Diff::LCS::SDiffCallbacks. They may be compared as:
-#
-#     s = Diff::LCS.sdiff(seq1, seq2).reject { |e| e.action == "=" }
-#     c = Diff::LCS.sdiff(seq1, seq2, Diff::LCS::ContextDiffCallbacks).flatten
-#
-#     s == c # -> true
-#
-# === Use
-#
-# This callback object must be initialised and can be used by the
-# Diff::LCS#diff or Diff::LCS#sdiff methods.
-#
-#     cbo = Diff::LCS::ContextDiffCallbacks.new
-#     Diff::LCS.LCS(seq1, seq2, cbo)
-#     cbo.finish
-#
-# Note that the call to #finish is absolutely necessary, or the last set of
-# changes will not be visible. Alternatively, can be used as:
-#
-#     cbo = Diff::LCS::ContextDiffCallbacks.new { |tcbo| Diff::LCS.LCS(seq1, seq2, tcbo) }
-#
-# The necessary #finish call will be made.
-#
-# === Simplified Array Format
-#
-# The simplified array format used in the example above can be obtained
-# with:
-#
-#     require 'pp'
-#     pp diffs.map { |e| e.map { |f| f.to_a } }
-class Diff::LCS::ContextDiffCallbacks < Diff::LCS::DiffCallbacks
-  def discard_a(event)
-    @hunk << Diff::LCS::ContextChange.simplify(event)
-  end
-
-  def discard_b(event)
-    @hunk << Diff::LCS::ContextChange.simplify(event)
-  end
-
-  def change(event)
-    @hunk << Diff::LCS::ContextChange.simplify(event)
-  end
-end
-
-# This will produce a simple array of diff change objects. Each element in
-# the #diffs array is a single ContextChange. In the set of #diffs provided
-# by SDiffCallbacks, both old and new objects will be presented for both
-# changed <strong>and unchanged</strong> objects. +nil+ will be substituted
-# for a discarded object.
-#
-# The diffset produced by this callback, when provided to Diff::LCS#sdiff,
-# will compute and display the necessary components to show two sequences
-# and their minimized differences side by side, just like the Unix utility
-# +sdiff+.
-# 
-#     same             same
-#     before     |     after
-#     old        <     -
-#     -          >     new
-#
-#     seq1 = %w(a b c e h j l m n p)
-#     seq2 = %w(b c d e f j k l m r s t)
-#
-#     diffs = Diff::LCS.sdiff(seq1, seq2)
-#       # This example shows a simplified array format.
-#       # [ [ "-", [  0, "a"], [  0, nil ] ],
-#       #   [ "=", [  1, "b"], [  0, "b" ] ],
-#       #   [ "=", [  2, "c"], [  1, "c" ] ],
-#       #   [ "+", [  3, nil], [  2, "d" ] ],
-#       #   [ "=", [  3, "e"], [  3, "e" ] ],
-#       #   [ "!", [  4, "h"], [  4, "f" ] ],
-#       #   [ "=", [  5, "j"], [  5, "j" ] ],
-#       #   [ "+", [  6, nil], [  6, "k" ] ],
-#       #   [ "=", [  6, "l"], [  7, "l" ] ],
-#       #   [ "=", [  7, "m"], [  8, "m" ] ],
-#       #   [ "!", [  8, "n"], [  9, "r" ] ],
-#       #   [ "!", [  9, "p"], [ 10, "s" ] ],
-#       #   [ "+", [ 10, nil], [ 11, "t" ] ] ]
-#
-# The result of this operation is similar to that of
-# Diff::LCS::ContextDiffCallbacks. They may be compared as:
-#
-#     s = Diff::LCS.sdiff(seq1, seq2).reject { |e| e.action == "=" }
-#     c = Diff::LCS.sdiff(seq1, seq2, Diff::LCS::ContextDiffCallbacks).flatten
-#
-#     s == c # -> true
-#
-# === Use
-#
-# This callback object must be initialised and is used by the Diff::LCS#sdiff
-# method.
-#
-#     cbo = Diff::LCS::SDiffCallbacks.new
-#     Diff::LCS.LCS(seq1, seq2, cbo)
-#
-# As with the other initialisable callback objects,
-# Diff::LCS::SDiffCallbacks can be initialised with a block. As there is no
-# "fininishing" to be done, this has no effect on the state of the object.
-#
-#     cbo = Diff::LCS::SDiffCallbacks.new { |tcbo| Diff::LCS.LCS(seq1, seq2, tcbo) }
-#
-# === Simplified Array Format
-#
-# The simplified array format used in the example above can be obtained
-# with:
-#
-#     require 'pp'
-#     pp diffs.map { |e| e.to_a }
-class Diff::LCS::SDiffCallbacks
-  # Returns the difference set collected during the diff process.
-  attr_reader :diffs
-
-  def initialize #:yields self:
-    @diffs = []
-    yield self if block_given?
-  end
-
-  def match(event)
-    @diffs << Diff::LCS::ContextChange.simplify(event)
-  end
-
-  def discard_a(event)
-    @diffs << Diff::LCS::ContextChange.simplify(event)
-  end
-
-  def discard_b(event)
-    @diffs << Diff::LCS::ContextChange.simplify(event)
-  end
-
-  def change(event)
-    @diffs << Diff::LCS::ContextChange.simplify(event)
-  end
-end

data/vendor/bundle/ruby/2.5.0/gems/diff-lcs-1.3/lib/diff/lcs/change.rb

@@ -1,181 +0,0 @@
-# -*- ruby encoding: utf-8 -*-
-
-# Represents a simplistic (non-contextual) change. Represents the removal or
-# addition of an element from either the old or the new sequenced
-# enumerable.
-class Diff::LCS::Change
-  IntClass = 1.class # Fixnum is deprecated in Ruby 2.4
-
-  # The only actions valid for changes are '+' (add), '-' (delete), '='
-  # (no change), '!' (changed), '<' (tail changes from first sequence), or
-  # '>' (tail changes from second sequence). The last two ('<>') are only
-  # found with Diff::LCS::diff and Diff::LCS::sdiff.
-  VALID_ACTIONS = %W(+ - = ! > <)
-
-  def self.valid_action?(action)
-    VALID_ACTIONS.include? action
-  end
-
-  # Returns the action this Change represents.
-  attr_reader :action
-
-  # Returns the position of the Change.
-  attr_reader :position
-  # Returns the sequence element of the Change.
-  attr_reader :element
-
-  def initialize(*args)
-    @action, @position, @element = *args
-
-    unless Diff::LCS::Change.valid_action?(@action)
-      raise "Invalid Change Action '#{@action}'"
-    end
-    raise "Invalid Position Type" unless @position.kind_of? IntClass
-  end
-
-  def inspect
-    to_a.inspect
-  end
-
-  def to_a
-    [ @action, @position, @element ]
-  end
-
-  def self.from_a(arr)
-    arr = arr.flatten(1)
-    case arr.size
-    when 5
-      Diff::LCS::ContextChange.new(*(arr[0...5]))
-    when 3
-      Diff::LCS::Change.new(*(arr[0...3]))
-    else
-      raise "Invalid change array format provided."
-    end
-  end
-
-  include Comparable
-
-  def ==(other)
-    (self.class == other.class) and
-    (self.action == other.action) and
-    (self.position == other.position) and
-    (self.element == other.element)
-  end
-
-  def <=>(other)
-    r = self.action <=> other.action
-    r = self.position <=> other.position if r.zero?
-    r = self.element <=> other.element if r.zero?
-    r
-  end
-
-  def adding?
-    @action == '+'
-  end
-
-  def deleting?
-    @action == '-'
-  end
-
-  def unchanged?
-    @action == '='
-  end
-
-  def changed?
-    @action == '!'
-  end
-
-  def finished_a?
-    @action == '>'
-  end
-
-  def finished_b?
-    @action == '<'
-  end
-end
-
-# Represents a contextual change. Contains the position and values of the
-# elements in the old and the new sequenced enumerables as well as the action
-# taken.
-class Diff::LCS::ContextChange < Diff::LCS::Change
-  # We don't need these two values.
-  undef :position
-  undef :element
-
-  # Returns the old position being changed.
-  attr_reader :old_position
-  # Returns the new position being changed.
-  attr_reader :new_position
-  # Returns the old element being changed.
-  attr_reader :old_element
-  # Returns the new element being changed.
-  attr_reader :new_element
-
-  def initialize(*args)
-    @action, @old_position, @old_element, @new_position, @new_element = *args
-
-    unless Diff::LCS::Change.valid_action?(@action)
-      raise "Invalid Change Action '#{@action}'"
-    end
-    unless @old_position.nil? or @old_position.kind_of? IntClass
-      raise "Invalid (Old) Position Type"
-    end
-    unless @new_position.nil? or @new_position.kind_of? IntClass
-      raise "Invalid (New) Position Type"
-    end
-  end
-
-  def to_a
-    [ @action,
-      [ @old_position, @old_element ],
-      [ @new_position, @new_element ]
-    ]
-  end
-
-  def inspect(*args)
-    to_a.inspect
-  end
-
-  def self.from_a(arr)
-    Diff::LCS::Change.from_a(arr)
-  end
-
-  # Simplifies a context change for use in some diff callbacks. '<' actions
-  # are converted to '-' and '>' actions are converted to '+'.
-  def self.simplify(event)
-    ea = event.to_a
-
-    case ea[0]
-    when '-'
-      ea[2][1] = nil
-    when '<'
-      ea[0] = '-'
-      ea[2][1] = nil
-    when '+'
-      ea[1][1] = nil
-    when '>'
-      ea[0] = '+'
-      ea[1][1] = nil
-    end
-
-    Diff::LCS::ContextChange.from_a(ea)
-  end
-
-  def ==(other)
-    (self.class == other.class) and
-    (@action == other.action) and
-    (@old_position == other.old_position) and
-    (@new_position == other.new_position) and
-    (@old_element == other.old_element) and
-    (@new_element == other.new_element)
-  end
-
-  def <=>(other)
-    r = @action <=> other.action
-    r = @old_position <=> other.old_position if r.zero?
-    r = @new_position <=> other.new_position if r.zero?
-    r = @old_element <=> other.old_element if r.zero?
-    r = @new_element <=> other.new_element if r.zero?
-    r
-  end
-end