Method make_switch has 125 lines of code (exceeds 30 allowed). Consider refactoring.

Open

  def make_switch(opts, block = nil)
    short, long, nolong, style, pattern, conv, not_pattern, not_conv, not_style = [], [], []
    ldesc, sdesc, desc, arg = [], [], []
    default_style = Switch::NoArgument
    default_pattern = nil

Method _racc_yyparse_rb has a Cognitive Complexity of 32 (exceeds 5 allowed). Consider refactoring.

Open

    def _racc_yyparse_rb(recv, mid, arg, c_debug)
      action_table, action_check, action_default, action_pointer,
      _,             _,            _,              _,
      _,            _,            token_table,    _,
      _,            _,            * = arg

• Read up
  Read up

File optparse.rb has 1110 lines of code (exceeds 1000 allowed). Consider refactoring.

Open

class OptionParser
  OptionParser::Version = '0.1.1'

  # :stopdoc:
  NoArgument = [NO_ARGUMENT = :NONE, nil].freeze

Method compile has a Cognitive Complexity of 30 (exceeds 5 allowed). Consider refactoring.

Open

      def compile
        scope.rescue_else_sexp = children[1..-1].detect { |sexp| sexp && sexp.type != :resbody }
        _has_rescue_handlers = false

        if handle_rescue_else_manually?

• Read up
  Read up

Method Integer has 108 lines of code (exceeds 30 allowed). Consider refactoring.

Open

  def Integer(value, base = undefined, exception: true)
    %x{
      var i, str, base_digits;

      exception = $truthy(#{exception});

Method show_version has a Cognitive Complexity of 28 (exceeds 5 allowed). Consider refactoring.

Open

  def show_version(*pkgs)
    progname = ARGV.options.program_name
    result = false
    show = proc do |klass, cname, version|
      str = progname.to_s

• Read up
  Read up

Method cover? has a Cognitive Complexity of 27 (exceeds 5 allowed). Consider refactoring.

Open

  def cover?(value)
    compare = ->(a, b) {
      a <=> b || 1
    }

• Read up
  Read up

Method compile has a Cognitive Complexity of 27 (exceeds 5 allowed). Consider refactoring.

Open

      def compile
        return push('[]') if children.empty?

        code, work = [], []

• Read up
  Read up

Method plus has a Cognitive Complexity of 27 (exceeds 5 allowed). Consider refactoring.

Open

  def plus(path1, path2) # -> path # :nodoc:
    prefix2 = path2
    index_list2 = []
    basename_list2 = []
    while (r2 = chop_basename(prefix2))

• Read up
  Read up

Method one? has a Cognitive Complexity of 26 (exceeds 5 allowed). Consider refactoring.

Open

  def one?(pattern = undefined, &block)
    count = 0

    if `pattern !== undefined`
      each do |*value|

• Read up
  Read up

Method compile has a Cognitive Complexity of 26 (exceeds 5 allowed). Consider refactoring.

Open

      def compile
        code, work = [], []

        children.each do |current|
          splat = current.type == :splat

• Read up
  Read up

Method summarize has a Cognitive Complexity of 26 (exceeds 5 allowed). Consider refactoring.

Open

    def summarize(sdone = {}, ldone = {}, width = 1, max = width - 1, indent = '')
      sopts, lopts = [], [], nil
      @short.each { |s| sdone.fetch(s) { sopts << s }; sdone[s] = true } if @short
      @long.each { |s| ldone.fetch(s) { lopts << s }; ldone[s] = true } if @long
      return if sopts.empty? && lopts.empty? # completely hidden

• Read up
  Read up

Method candidate has a Cognitive Complexity of 25 (exceeds 5 allowed). Consider refactoring.

Open

  def candidate(word)
    list = []
    case word
    when '-'
      long = short = true

• Read up
  Read up

Method tridiagonalize has 91 lines of code (exceeds 30 allowed). Consider refactoring.

Open

    def tridiagonalize

      #  This is derived from the Algol procedures tred2 by
      #  Bowdler, Martin, Reinsch, and Wilkinson, Handbook for
      #  Auto. Comp., Vol.ii-Linear Algebra, and the corresponding

Method prefork_reactor has a Cognitive Complexity of 24 (exceeds 5 allowed). Consider refactoring.

Open

      def prefork_reactor(rel_path, requires, autoloads, options)
        prefork

        processed = []

• Read up
  Read up

Method source_map_name_for has a Cognitive Complexity of 24 (exceeds 5 allowed). Consider refactoring.

Open

    def source_map_name_for(sexp)
      case sexp.type
      when :top
        case sexp.meta[:kind]
        when :require

• Read up
  Read up

Method sample has 88 lines of code (exceeds 30 allowed). Consider refactoring.

Open

  def sample(count = undefined, options = undefined)
    return at ::Kernel.rand(`self.length`) if `count === undefined`

    if `options === undefined`
      if (o = ::Opal.coerce_to? count, ::Hash, :to_hash)

Method minor has a Cognitive Complexity of 23 (exceeds 5 allowed). Consider refactoring.

Open

  def minor(*param)
    case param.size
    when 2
      row_range, col_range = param
      from_row = row_range.first

• Read up
  Read up

Method returns has a Cognitive Complexity of 23 (exceeds 5 allowed). Consider refactoring.

Open

    def returns(sexp)
      return returns s(:nil) unless sexp

      case sexp.type
      when :undef

• Read up
  Read up

Method diagonalize has 86 lines of code (exceeds 30 allowed). Consider refactoring.

Open

    def diagonalize
      #  This is derived from the Algol procedures tql2, by
      #  Bowdler, Martin, Reinsch, and Wilkinson, Handbook for
      #  Auto. Comp., Vol.ii-Linear Algebra, and the corresponding
      #  Fortran subroutine in EISPACK.