primary_connect_proto 0.9.0 → 0.11.0

data/vendor/bundle/ruby/2.6.0/gems/jaro_winkler-1.5.4/ext/jaro_winkler/jaro.c

@@ -1,121 +0,0 @@
-#include "jaro.h"
-#include "adj_matrix.h"
-#include "codepoints.h"
-
-#include <ctype.h>
-#include <stdlib.h>
-#include <string.h>
-
-#define DEFAULT_WEIGHT 0.1
-#define DEFAULT_THRESHOLD 0.7
-#define SWAP(x, y)                                                             \
-  do {                                                                         \
-    __typeof__(x) SWAP = x;                                                    \
-    x = y;                                                                     \
-    y = SWAP;                                                                  \
-  } while (0)
-
-const Options DEFAULT_OPTIONS = {.weight = DEFAULT_WEIGHT,
-                                 .threshold = DEFAULT_THRESHOLD,
-                                 .ignore_case = 0,
-                                 .adj_table = 0};
-
-double jaro_distance_from_codes(uint32_t *codepoints1, size_t len1,
-                                uint32_t *codepoints2, size_t len2,
-                                Options *opt) {
-  if (!len1 || !len2)
-    return 0.0;
-
-  if (len1 > len2) {
-    SWAP(codepoints1, codepoints2);
-    SWAP(len1, len2);
-  }
-
-  if (opt->ignore_case) {
-    for (size_t i = 0; i < len1; i++)
-      codepoints1[i] = tolower(codepoints1[i]);
-    for (size_t i = 0; i < len2; i++)
-      codepoints2[i] = tolower(codepoints2[i]);
-  }
-
-  int32_t window_size = (int32_t)len2 / 2 - 1;
-  if (window_size < 0)
-    window_size = 0;
-
-  char short_codes_flag[len1];
-  char long_codes_flag[len2];
-  memset(short_codes_flag, 0, len1);
-  memset(long_codes_flag, 0, len2);
-
-  // count number of matching characters
-  size_t match_count = 0;
-  for (size_t i = 0; i < len1; i++) {
-    size_t left = (i >= (size_t)window_size) ? i - window_size : 0;
-    size_t right =
-        (i + window_size <= len2 - 1) ? (i + window_size) : (len2 - 1);
-    if (right > len2 - 1)
-      right = len2 - 1;
-    for (size_t j = left; j <= right; j++) {
-      if (!long_codes_flag[j] && codepoints1[i] == codepoints2[j]) {
-        short_codes_flag[i] = long_codes_flag[j] = 1;
-        match_count++;
-        break;
-      }
-    }
-  }
-
-  if (!match_count)
-    return 0.0;
-
-  // count number of transpositions
-  size_t transposition_count = 0, j = 0, k = 0;
-  for (size_t i = 0; i < len1; i++) {
-    if (short_codes_flag[i]) {
-      for (j = k; j < len2; j++) {
-        if (long_codes_flag[j]) {
-          k = j + 1;
-          break;
-        }
-      }
-      if (codepoints1[i] != codepoints2[j])
-        transposition_count++;
-    }
-  }
-
-  // count similarities in nonmatched characters
-  size_t similar_count = 0;
-  if (opt->adj_table && len1 > match_count)
-    for (size_t i = 0; i < len1; i++)
-      if (!short_codes_flag[i])
-        for (size_t j = 0; j < len2; j++)
-          if (!long_codes_flag[j])
-            if (adj_matrix_find(adj_matrix_default(), codepoints1[i],
-                                codepoints2[j])) {
-              similar_count += 3;
-              break;
-            }
-
-  double m = (double)match_count;
-  double t = (double)(transposition_count / 2);
-  if (opt->adj_table)
-    m = similar_count / 10.0 + m;
-  return (m / len1 + m / len2 + (m - t) / m) / 3;
-}
-
-double jaro_winkler_distance_from_codes(uint32_t *codepoints1, size_t len1,
-                                        uint32_t *codepoints2, size_t len2,
-                                        Options *opt) {
-  double jaro_distance =
-      jaro_distance_from_codes(codepoints1, len1, codepoints2, len2, opt);
-
-  if (jaro_distance < opt->threshold)
-    return jaro_distance;
-  else {
-    size_t prefix = 0;
-    size_t max_4 = len1 > 4 ? 4 : len1;
-    for (prefix = 0;
-         prefix < max_4 && codepoints1[prefix] == codepoints2[prefix]; prefix++)
-      ;
-    return jaro_distance + prefix * opt->weight * (1 - jaro_distance);
-  }
-}

data/vendor/bundle/ruby/2.6.0/gems/jaro_winkler-1.5.4/ext/jaro_winkler/jaro.h

@@ -1,17 +0,0 @@
-#pragma once
-
-#include <stddef.h>
-#include <stdint.h>
-
-typedef struct {
-  double weight, threshold;
-  char ignore_case, adj_table;
-} Options;
-
-extern const Options DEFAULT_OPTIONS;
-
-double jaro_distance_from_codes(uint32_t *codepoints1, size_t len1,
-                                uint32_t *codepoints2, size_t len2, Options *);
-double jaro_winkler_distance_from_codes(uint32_t *codepoints1, size_t len1,
-                                        uint32_t *codepoints2, size_t len2,
-                                        Options *);

data/vendor/bundle/ruby/2.6.0/gems/jaro_winkler-1.5.4/ext/jaro_winkler/jaro_winkler.c

@@ -1,72 +0,0 @@
-#include "codepoints.h"
-#include "jaro.h"
-#include "ruby.h"
-
-VALUE rb_mJaroWinkler, rb_eError, rb_eInvalidWeightError;
-
-VALUE rb_jaro_winkler_distance(size_t argc, VALUE *argv, VALUE self);
-VALUE rb_jaro_distance(size_t argc, VALUE *argv, VALUE self);
-VALUE distance(size_t argc, VALUE *argv, VALUE self,
-               double (*distance_fn)(uint32_t *codepoints1, size_t len1,
-                                     uint32_t *codepoints2, size_t len2,
-                                     Options *));
-
-void Init_jaro_winkler_ext(void) {
-  rb_mJaroWinkler = rb_define_module("JaroWinkler");
-  rb_eError = rb_define_class_under(rb_mJaroWinkler, "Error", rb_eRuntimeError);
-  rb_eInvalidWeightError =
-      rb_define_class_under(rb_mJaroWinkler, "InvalidWeightError", rb_eError);
-  rb_define_singleton_method(rb_mJaroWinkler, "distance",
-                             rb_jaro_winkler_distance, -1);
-  rb_define_singleton_method(rb_mJaroWinkler, "jaro_distance", rb_jaro_distance,
-                             -1);
-}
-
-VALUE distance(size_t argc, VALUE *argv, VALUE self,
-               double (*distance_fn)(uint32_t *codepoints1, size_t len1,
-                                     uint32_t *codepoints2, size_t len2,
-                                     Options *)) {
-  VALUE s1, s2, opt;
-
-  rb_scan_args((int32_t)argc, argv, "2:", &s1, &s2, &opt);
-
-  Check_Type(s1, T_STRING);
-  Check_Type(s2, T_STRING);
-  Options c_opt = DEFAULT_OPTIONS;
-  if (TYPE(opt) == T_HASH) {
-    VALUE weight = rb_hash_aref(opt, ID2SYM(rb_intern("weight"))),
-          threshold = rb_hash_aref(opt, ID2SYM(rb_intern("threshold"))),
-          ignore_case = rb_hash_aref(opt, ID2SYM(rb_intern("ignore_case"))),
-          adj_table = rb_hash_aref(opt, ID2SYM(rb_intern("adj_table")));
-    if (!NIL_P(weight))
-      c_opt.weight = NUM2DBL(weight);
-    if (c_opt.weight > 0.25)
-      rb_raise(rb_eInvalidWeightError, "Scaling factor should not exceed 0.25, "
-                                       "otherwise the distance can become "
-                                       "larger than 1.");
-    if (!NIL_P(threshold))
-      c_opt.threshold = NUM2DBL(threshold);
-    if (!NIL_P(ignore_case))
-      c_opt.ignore_case =
-          (TYPE(ignore_case) == T_FALSE || NIL_P(ignore_case)) ? 0 : 1;
-    if (!NIL_P(adj_table))
-      c_opt.adj_table =
-          (TYPE(adj_table) == T_FALSE || NIL_P(adj_table)) ? 0 : 1;
-  }
-  CodePoints cp1, cp2;
-  codepoints_init(&cp1, s1);
-  codepoints_init(&cp2, s2);
-  VALUE ret = rb_float_new(
-      (*distance_fn)(cp1.data, cp1.length, cp2.data, cp2.length, &c_opt));
-  codepoints_free(&cp1);
-  codepoints_free(&cp2);
-  return ret;
-}
-
-VALUE rb_jaro_distance(size_t argc, VALUE *argv, VALUE self) {
-  return distance(argc, argv, self, jaro_distance_from_codes);
-}
-
-VALUE rb_jaro_winkler_distance(size_t argc, VALUE *argv, VALUE self) {
-  return distance(argc, argv, self, jaro_winkler_distance_from_codes);
-}

data/vendor/bundle/ruby/2.6.0/gems/jaro_winkler-1.5.4/lib/jaro_winkler/adjusting_table.rb

@@ -1,14 +0,0 @@
-# frozen_string_literal: true
-
-module JaroWinkler
-  DEFAULT_ADJ_TABLE = Hash.new { |h, k| h[k] = Hash.new(&h.default_proc) }
-  [
-    %w[A E], %w[A I], %w[A O], %w[A U], %w[B V], %w[E I], %w[E O], %w[E U], %w[I O],
-    %w[I U], %w[O U], %w[I Y], %w[E Y], %w[C G], %w[E F], %w[W U], %w[W V], %w[X K],
-    %w[S Z], %w[X S], %w[Q C], %w[U V], %w[M N], %w[L I], %w[Q O], %w[P R], %w[I J],
-    %w[2 Z], %w[5 S], %w[8 B], %w[1 I], %w[1 L], %w[0 O], %w[0 Q], %w[C K], %w[G J],
-    ['E', ' '], ['Y', ' '], ['S', ' ']
-  ].each do |s1, s2|
-    DEFAULT_ADJ_TABLE[s1][s2] = DEFAULT_ADJ_TABLE[s2][s1] = true
-  end
-end

data/vendor/bundle/ruby/2.6.0/gems/jaro_winkler-1.5.4/lib/jaro_winkler/jaro_winkler_pure.rb

@@ -1,135 +0,0 @@
-# frozen_string_literal: true
-
-require 'jaro_winkler/adjusting_table'
-module JaroWinkler
-  class Error < RuntimeError; end
-  class InvalidWeightError < Error; end
-
-  DEFAULT_WEIGHT = 0.1
-  DEFAULT_THRESHOLD = 0.7
-  DEFAULT_OPTIONS = {
-    jaro: { adj_table: false, ignore_case: false },
-    jaro_winkler: { weight: DEFAULT_WEIGHT, threshold: DEFAULT_THRESHOLD }
-  }.freeze
-
-  class << self
-    def distance(str1, str2, options = {})
-      validate!(str1, str2)
-      _distance str1.codepoints.to_a, str2.codepoints.to_a, options
-    end
-
-    def jaro_distance(str1, str2, options = {})
-      validate!(str1, str2)
-      _jaro_distance str1.codepoints.to_a, str2.codepoints.to_a, options
-    end
-
-    private
-
-    def _distance(codes1, codes2, options = {})
-      options = DEFAULT_OPTIONS[:jaro_winkler].merge options
-      raise InvalidWeightError if options[:weight] > 0.25
-      jaro_distance = _jaro_distance(codes1, codes2, options)
-
-      if jaro_distance < options[:threshold]
-        jaro_distance
-      else
-        codes1, codes2 = codes2, codes1 if codes1.length > codes2.length
-        len1 = codes1.length
-        len2 = codes2.length
-        max_4 = len1 > 4 ? 4 : len1
-        prefix = 0
-        prefix += 1 while prefix < max_4 && codes1[prefix] == codes2[prefix]
-        jaro_distance + prefix * options[:weight] * (1 - jaro_distance)
-      end
-    end
-
-    def _jaro_distance(codes1, codes2, options = {})
-      options = DEFAULT_OPTIONS[:jaro].merge options
-
-      codes1, codes2 = codes2, codes1 if codes1.length > codes2.length
-      len1 = codes1.length
-      len2 = codes2.length
-      return 0.0 if len1 == 0 || len2 == 0
-
-      if options[:ignore_case]
-        codes1.map! { |c| c >= 97 && c <= 122 ? c -= 32 : c }
-        codes2.map! { |c| c >= 97 && c <= 122 ? c -= 32 : c }
-      end
-
-      window = len2 / 2 - 1
-      window = 0 if window < 0
-      flags1 = 0
-      flags2 = 0
-
-      # // count number of matching characters
-      match_count = 0
-      i = 0
-      while i < len1
-        left = i >= window ? i - window : 0
-        right = i + window <= len2 - 1 ? (i + window) : (len2 - 1)
-        right = len2 - 1 if right > len2 - 1
-        j = left
-        while j <= right
-          if flags2[j] == 0 && codes1[i] == codes2[j]
-            flags1 |= (1 << i)
-            flags2 |= (1 << j)
-            match_count += 1
-            break
-          end
-          j += 1
-        end
-        i += 1
-      end
-
-      return 0.0 if match_count == 0
-
-      # // count number of transpositions
-      transposition_count = j = k = 0
-      i = 0
-      while i < len1
-        if flags1[i] == 1
-          j = k
-          while j < len2
-            if flags2[j] == 1
-              k = j + 1
-              break
-            end
-            j += 1
-          end
-          transposition_count += 1 if codes1[i] != codes2[j]
-        end
-        i += 1
-      end
-
-      # // count similarities in nonmatched characters
-      similar_count = 0
-      if options[:adj_table] && len1 > match_count
-        i = 0
-        while i < len1
-          if flags1[i] == 0
-            j = 0
-            while j < len2
-              if flags2[j] == 0
-                if DEFAULT_ADJ_TABLE[codes1[i].chr(Encoding::UTF_8)][codes2[j].chr(Encoding::UTF_8)]
-                  similar_count += 3
-                  break
-                end
-              end
-              j += 1
-            end
-          end
-          i += 1
-        end
-      end
-
-      m = match_count.to_f
-      t = transposition_count / 2
-      m = similar_count / 10.0 + m if options[:adj_table]
-      (m / len1 + m / len2 + (m - t) / m) / 3
-    end
-
-    def validate!(str1, str2)
-      raise TypeError unless str1.is_a?(String) && str2.is_a?(String)
-    end
-  end
-end

data/vendor/bundle/ruby/2.6.0/gems/jaro_winkler-1.5.4/lib/jaro_winkler/version.rb

@@ -1,5 +0,0 @@
-# frozen_string_literal: true
-
-module JaroWinkler
-  VERSION = '1.5.4'
-end

data/vendor/bundle/ruby/2.6.0/gems/jaro_winkler-1.5.4/lib/jaro_winkler.rb

@@ -1,15 +0,0 @@
-# frozen_string_literal: true
-
-require 'jaro_winkler/version'
-
-if RUBY_ENGINE == 'ruby'
-  begin
-    require 'jaro_winkler/jaro_winkler_ext'
-  rescue LoadError
-    # Fall back to the pure implementation if the extension
-    # can't be loaded for any reason (e.g. it was never built)
-    require 'jaro_winkler/jaro_winkler_pure'
-  end
-else
-  require 'jaro_winkler/jaro_winkler_pure'
-end

data/vendor/bundle/ruby/2.6.0/gems/method_source-1.0.0/.circleci/config.yml

@@ -1,139 +0,0 @@
-version: 2
-references:
-  repo_restore_cache: &repo_restore_cache
-    restore_cache:
-      keys:
-        - repo-{{ .Environment.CIRCLE_SHA1 }}
-
-  repo_save_cache: &repo_save_cache
-    save_cache:
-      key: repo-{{ .Environment.CIRCLE_SHA1 }}-{{ epoch }}
-      paths:
-        - ~/method_source
-
-  bundle_install: &bundle_install
-    run:
-      name: Install Bundler dependencies
-      command: bundle install --path ~/method_source/vendor/bundle --jobs 15
-
-  unit: &unit
-    run:
-      name: Run unit tests
-      command: bundle exec rake
-
-jobs:
-  "ruby-1.9":
-    docker:
-      - image: kyrylo/ruby-1.9.3p551
-    working_directory: /home/circleci/method_source
-    steps:
-      - checkout
-      - <<: *repo_restore_cache
-      - <<: *bundle_install
-      - <<: *unit
-  "ruby-2.0":
-    docker:
-      - image: kyrylo/ruby-2.0.0p648
-    working_directory: /home/circleci/method_source
-    steps:
-      - checkout
-      - <<: *repo_restore_cache
-      - <<: *bundle_install
-      - <<: *unit
-  "ruby-2.1":
-    docker:
-      - image: circleci/ruby:2.1
-    working_directory: ~/method_source
-    steps:
-      - checkout
-      - <<: *repo_restore_cache
-      - <<: *bundle_install
-      - <<: *unit
-  "ruby-2.2":
-    docker:
-      - image: circleci/ruby:2.2
-    working_directory: ~/method_source
-    steps:
-      - checkout
-      - <<: *repo_restore_cache
-      - <<: *bundle_install
-      - <<: *unit
-  "ruby-2.3":
-    docker:
-      - image: circleci/ruby:2.3
-    working_directory: ~/method_source
-    steps:
-      - checkout
-      - <<: *repo_restore_cache
-      - <<: *bundle_install
-      - <<: *unit
-  "ruby-2.4":
-    docker:
-      - image: circleci/ruby:2.4
-    working_directory: ~/method_source
-    steps:
-      - checkout
-      - <<: *repo_restore_cache
-      - <<: *bundle_install
-      - <<: *unit
-  "ruby-2.5":
-    docker:
-      - image: circleci/ruby:2.5
-    working_directory: ~/method_source
-    steps:
-      - checkout
-      - <<: *repo_restore_cache
-      - <<: *bundle_install
-      - <<: *unit
-  "ruby-2.6":
-    docker:
-      - image: circleci/ruby:2.6
-    working_directory: ~/method_source
-    steps:
-      - checkout
-      - <<: *repo_restore_cache
-      - <<: *bundle_install
-      - <<: *unit
-  "ruby-2.7":
-    docker:
-      - image: circleci/ruby:2.7.0
-    working_directory: ~/method_source
-    steps:
-      - checkout
-      - <<: *repo_restore_cache
-      - <<: *bundle_install
-      - <<: *unit
-  "jruby-9.1-jdk":
-    docker:
-      - image: circleci/jruby:9.1-jdk
-    working_directory: ~/method_source
-    steps:
-      - checkout
-      - <<: *repo_restore_cache
-      - <<: *bundle_install
-      - <<: *unit
-  "jruby-9.2-jdk":
-    docker:
-      - image: circleci/jruby:9.2-jdk
-    working_directory: ~/method_source
-    steps:
-      - checkout
-      - <<: *repo_restore_cache
-      - <<: *bundle_install
-      - <<: *unit
-
-workflows:
-  version: 2
-  build:
-    jobs:
-      - "ruby-1.9"
-      - "ruby-2.0"
-      - "ruby-2.1"
-      - "ruby-2.2"
-      - "ruby-2.3"
-      - "ruby-2.4"
-      - "ruby-2.5"
-      - "ruby-2.6"
-      - "ruby-2.7"
-      - "jruby-9.1-jdk"
-      - "jruby-9.2-jdk"

data/vendor/bundle/ruby/2.6.0/gems/method_source-1.0.0/.yardopts

@@ -1 +0,0 @@
--m markdown 

data/vendor/bundle/ruby/2.6.0/gems/method_source-1.0.0/CHANGELOG.md

@@ -1,10 +0,0 @@
-method_source changelog
-=======================
-
-### master
-
-### [v1.0.0][v1.0.0] (March 19, 2020)
-
-* Added Ruby 2.7 support
-
-[v1.0.0]: https://github.com/banister/method_source/releases/tag/v1.0.0

data/vendor/bundle/ruby/2.6.0/gems/method_source-1.0.0/Gemfile

@@ -1,2 +0,0 @@
-source 'https://rubygems.org'
-gemspec

data/vendor/bundle/ruby/2.6.0/gems/method_source-1.0.0/LICENSE

@@ -1,22 +0,0 @@
-MIT License
-
-Copyright (c) 2011 John Mair (banisterfiend)
-
-Permission is hereby granted, free of charge, to any person obtaining
-a copy of this software and associated documentation files (the
-'Software'), to deal in the Software without restriction, including
-without limitation the rights to use, copy, modify, merge, publish,
-distribute, sublicense, and/or sell copies of the Software, and to
-permit persons to whom the Software is furnished to do so, subject to
-the following conditions:
-
-The above copyright notice and this permission notice shall be
-included in all copies or substantial portions of the Software.
-
-THE SOFTWARE IS PROVIDED 'AS IS', WITHOUT WARRANTY OF ANY KIND,
-EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
-MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
-IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
-CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
-TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
-SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.

data/vendor/bundle/ruby/2.6.0/gems/method_source-1.0.0/README.markdown

@@ -1,93 +0,0 @@
-method_source
-=============
-
-[![Circle Build Status](https://circleci.com/gh/banister/method_source.svg?style=shield)](https://circleci.com/gh/banister/method_source)
-
-(C) John Mair (banisterfiend) 2011
-
-_retrieve the sourcecode for a method_
-
-*NOTE:* This simply utilizes `Method#source_location`; it
- does not access the live AST.
-
-`method_source` is a utility to return a method's sourcecode as a
-Ruby string. Also returns `Proc` and `Lambda` sourcecode.
-
-Method comments can also be extracted using the `comment` method.
-
-It is written in pure Ruby (no C).
-
-* Some Ruby 1.8 support now available.
-* Support for MRI, RBX, JRuby, REE
-
-`method_source` provides the `source` and `comment` methods to the `Method` and
-`UnboundMethod` and `Proc` classes.
-
-* Install the [gem](https://rubygems.org/gems/method_source): `gem install method_source`
-* Read the [documentation](https://www.rubydoc.info/github/banister/method_source/master)
-* See the [source code](http://github.com/banister/method_source)
-
-Example: display method source
-------------------------------
-
-    Set.instance_method(:merge).source.display
-    # =>
-    def merge(enum)
-      if enum.instance_of?(self.class)
-        @hash.update(enum.instance_variable_get(:@hash))
-      else
-        do_with_enum(enum) { |o| add(o) }
-      end
-
-      self
-    end
-
-Example: display method comments
---------------------------------
-
-    Set.instance_method(:merge).comment.display
-    # =>
-    # Merges the elements of the given enumerable object to the set and
-    # returns self.
-
-Limitations:
-------------
-
-* Occasional strange behaviour in Ruby 1.8
-* Cannot return source for C methods.
-* Cannot return source for dynamically defined methods.
-
-Special Thanks
---------------
-
-[Adam Sanderson](https://github.com/adamsanderson) for `comment` functionality.
-
-[Dmitry Elastic](https://github.com/dmitryelastic) for the brilliant Ruby 1.8 `source_location` hack.
-
-[Samuel Kadolph](https://github.com/samuelkadolph) for the JRuby 1.8 `source_location`.
-
-License
--------
-
-(The MIT License)
-
-Copyright (c) 2011 John Mair (banisterfiend)
-
-Permission is hereby granted, free of charge, to any person obtaining
-a copy of this software and associated documentation files (the
-'Software'), to deal in the Software without restriction, including
-without limitation the rights to use, copy, modify, merge, publish,
-distribute, sublicense, and/or sell copies of the Software, and to
-permit persons to whom the Software is furnished to do so, subject to
-the following conditions:
-
-The above copyright notice and this permission notice shall be
-included in all copies or substantial portions of the Software.
-
-THE SOFTWARE IS PROVIDED 'AS IS', WITHOUT WARRANTY OF ANY KIND,
-EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
-MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
-IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
-CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
-TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
-SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.