brakeman 4.3.1 → 5.0.0

data/bundle/ruby/2.5.0/gems/sass-3.4.25/lib/sass/selector/pseudo.rb

@@ -1,266 +0,0 @@
-module Sass
-  module Selector
-    # A pseudoclass (e.g. `:visited`) or pseudoelement (e.g. `::first-line`)
-    # selector. It can have arguments (e.g. `:nth-child(2n+1)`) which can
-    # contain selectors (e.g. `:nth-child(2n+1 of .foo)`).
-    class Pseudo < Simple
-      # Some pseudo-class-syntax selectors are actually considered
-      # pseudo-elements and must be treated differently. This is a list of such
-      # selectors.
-      #
-      # @return [Set<String>]
-      ACTUALLY_ELEMENTS = %w(after before first-line first-letter).to_set
-
-      # Like \{#type}, but returns the type of selector this looks like, rather
-      # than the type it is semantically. This only differs from type for
-      # selectors in \{ACTUALLY\_ELEMENTS}.
-      #
-      # @return [Symbol]
-      attr_reader :syntactic_type
-
-      # The name of the selector.
-      #
-      # @return [String]
-      attr_reader :name
-
-      # The argument to the selector,
-      # or `nil` if no argument was given.
-      #
-      # @return [String, nil]
-      attr_reader :arg
-
-      # The selector argument, or `nil` if no selector exists.
-      #
-      # If this and \{#arg\} are both set, \{#arg\} is considered a non-selector
-      # prefix.
-      #
-      # @return [CommaSequence]
-      attr_reader :selector
-
-      # @param syntactic_type [Symbol] See \{#syntactic_type}
-      # @param name [String] See \{#name}
-      # @param arg [nil, String] See \{#arg}
-      # @param selector [nil, CommaSequence] See \{#selector}
-      def initialize(syntactic_type, name, arg, selector)
-        @syntactic_type = syntactic_type
-        @name = name
-        @arg = arg
-        @selector = selector
-      end
-
-      # Returns a copy of this with \{#selector} set to \{#new\_selector}.
-      #
-      # @param new_selector [CommaSequence]
-      # @return [Array<Simple>]
-      def with_selector(new_selector)
-        result = Pseudo.new(syntactic_type, name, arg,
-          CommaSequence.new(new_selector.members.map do |seq|
-            next seq unless seq.members.length == 1
-            sseq = seq.members.first
-            next seq unless sseq.is_a?(SimpleSequence) && sseq.members.length == 1
-            sel = sseq.members.first
-            next seq unless sel.is_a?(Pseudo) && sel.selector
-
-            case normalized_name
-            when 'not'
-              # In theory, if there's a nested :not its contents should be
-              # unified with the return value. For example, if :not(.foo)
-              # extends .bar, :not(.bar) should become .foo:not(.bar). However,
-              # this is a narrow edge case and supporting it properly would make
-              # this code and the code calling it a lot more complicated, so
-              # it's not supported for now.
-              next [] unless sel.normalized_name == 'matches'
-              sel.selector.members
-            when 'matches', 'any', 'current', 'nth-child', 'nth-last-child'
-              # As above, we could theoretically support :not within :matches, but
-              # doing so would require this method and its callers to handle much
-              # more complex cases that likely aren't worth the pain.
-              next [] unless sel.name == name && sel.arg == arg
-              sel.selector.members
-            when 'has', 'host', 'host-context'
-              # We can't expand nested selectors here, because each layer adds an
-              # additional layer of semantics. For example, `:has(:has(img))`
-              # doesn't match `<div><img></div>` but `:has(img)` does.
-              sel
-            else
-              []
-            end
-          end.flatten))
-
-        # Older browsers support :not but only with a single complex selector.
-        # In order to support those browsers, we break up the contents of a :not
-        # unless it originally contained a selector list.
-        return [result] unless normalized_name == 'not'
-        return [result] if selector.members.length > 1
-        result.selector.members.map do |seq|
-          Pseudo.new(syntactic_type, name, arg, CommaSequence.new([seq]))
-        end
-      end
-
-      # The type of the selector. `:class` if this is a pseudoclass selector,
-      # `:element` if it's a pseudoelement.
-      #
-      # @return [Symbol]
-      def type
-        ACTUALLY_ELEMENTS.include?(normalized_name) ? :element : syntactic_type
-      end
-
-      # Like \{#name\}, but without any vendor prefix.
-      #
-      # @return [String]
-      def normalized_name
-        @normalized_name ||= name.gsub(/^-[a-zA-Z0-9]+-/, '')
-      end
-
-      # @see Selector#to_s
-      def to_s(opts = {})
-        res = (syntactic_type == :class ? ":" : "::") + @name
-        if @arg || @selector
-          res << "("
-          res << @arg.strip if @arg
-          res << " " if @arg && @selector
-          res << @selector.to_s(opts) if @selector
-          res << ")"
-        end
-        res
-      end
-
-      # Returns `nil` if this is a pseudoelement selector
-      # and `sels` contains a pseudoelement selector different than this one.
-      #
-      # @see SimpleSequence#unify
-      def unify(sels)
-        return if type == :element && sels.any? do |sel|
-          sel.is_a?(Pseudo) && sel.type == :element &&
-            (sel.name != name || sel.arg != arg || sel.selector != selector)
-        end
-        super
-      end
-
-      # Returns whether or not this selector matches all elements
-      # that the given selector matches (as well as possibly more).
-      #
-      # @example
-      #   (.foo).superselector?(.foo.bar) #=> true
-      #   (.foo).superselector?(.bar) #=> false
-      # @param their_sseq [SimpleSequence]
-      # @param parents [Array<SimpleSequence, String>] The parent selectors of `their_sseq`, if any.
-      # @return [Boolean]
-      def superselector?(their_sseq, parents = [])
-        case normalized_name
-        when 'matches', 'any'
-          # :matches can be a superselector of another selector in one of two
-          # ways. Either its constituent selectors can be a superset of those of
-          # another :matches in the other selector, or any of its constituent
-          # selectors can individually be a superselector of the other selector.
-          (their_sseq.selector_pseudo_classes[normalized_name] || []).any? do |their_sel|
-            next false unless their_sel.is_a?(Pseudo)
-            next false unless their_sel.name == name
-            selector.superselector?(their_sel.selector)
-          end || selector.members.any? do |our_seq|
-            their_seq = Sequence.new(parents + [their_sseq])
-            our_seq.superselector?(their_seq)
-          end
-        when 'has', 'host', 'host-context'
-          # Like :matches, :has (et al) can be a superselector of another
-          # selector if its constituent selectors are a superset of those of
-          # another :has in the other selector. However, the :matches other case
-          # doesn't work, because :has refers to nested elements.
-          (their_sseq.selector_pseudo_classes[normalized_name] || []).any? do |their_sel|
-            next false unless their_sel.is_a?(Pseudo)
-            next false unless their_sel.name == name
-            selector.superselector?(their_sel.selector)
-          end
-        when 'not'
-          selector.members.all? do |our_seq|
-            their_sseq.members.any? do |their_sel|
-              if their_sel.is_a?(Element) || their_sel.is_a?(Id)
-                # `:not(a)` is a superselector of `h1` and `:not(#foo)` is a
-                # superselector of `#bar`.
-                our_sseq = our_seq.members.last
-                next false unless our_sseq.is_a?(SimpleSequence)
-                our_sseq.members.any? do |our_sel|
-                  our_sel.class == their_sel.class && our_sel != their_sel
-                end
-              else
-                next false unless their_sel.is_a?(Pseudo)
-                next false unless their_sel.name == name
-                # :not(X) is a superselector of :not(Y) exactly when Y is a
-                # superselector of X.
-                their_sel.selector.superselector?(CommaSequence.new([our_seq]))
-              end
-            end
-          end
-        when 'current'
-          (their_sseq.selector_pseudo_classes['current'] || []).any? do |their_current|
-            next false if their_current.name != name
-            # Explicitly don't check for nested superselector relationships
-            # here. :current(.foo) isn't always a superselector of
-            # :current(.foo.bar), since it matches the *innermost* ancestor of
-            # the current element that matches the selector. For example:
-            #
-            #     <div class="foo bar">
-            #       <p class="foo">
-            #         <span>current element</span>
-            #       </p>
-            #     </div>
-            #
-            # Here :current(.foo) would match the p element and *not* the div
-            # element, whereas :current(.foo.bar) would match the div and not
-            # the p.
-            selector == their_current.selector
-          end
-        when 'nth-child', 'nth-last-child'
-          their_sseq.members.any? do |their_sel|
-            # This misses a few edge cases. For example, `:nth-child(n of X)`
-            # is a superselector of `X`, and `:nth-child(2n of X)` is a
-            # superselector of `:nth-child(4n of X)`. These seem rare enough
-            # not to be worth worrying about, though.
-            next false unless their_sel.is_a?(Pseudo)
-            next false unless their_sel.name == name
-            next false unless their_sel.arg == arg
-            selector.superselector?(their_sel.selector)
-          end
-        else
-          throw "[BUG] Unknown selector pseudo class #{name}"
-        end
-      end
-
-      # @see AbstractSequence#specificity
-      def specificity
-        return 1 if type == :element
-        return SPECIFICITY_BASE unless selector
-        @specificity ||=
-          if normalized_name == 'not'
-            min = 0
-            max = 0
-            selector.members.each do |seq|
-              spec = seq.specificity
-              if spec.is_a?(Range)
-                min = Sass::Util.max(spec.begin, min)
-                max = Sass::Util.max(spec.end, max)
-              else
-                min = Sass::Util.max(spec, min)
-                max = Sass::Util.max(spec, max)
-              end
-            end
-            min == max ? max : (min..max)
-          else
-            min = 0
-            max = 0
-            selector.members.each do |seq|
-              spec = seq.specificity
-              if spec.is_a?(Range)
-                min = Sass::Util.min(spec.begin, min)
-                max = Sass::Util.max(spec.end, max)
-              else
-                min = Sass::Util.min(spec, min)
-                max = Sass::Util.max(spec, max)
-              end
-            end
-            min == max ? max : (min..max)
-          end
-      end
-    end
-  end
-end

data/bundle/ruby/2.5.0/gems/sass-3.4.25/lib/sass/selector/sequence.rb

@@ -1,636 +0,0 @@
-module Sass
-  module Selector
-    # An operator-separated sequence of
-    # {SimpleSequence simple selector sequences}.
-    class Sequence < AbstractSequence
-      # Sets the line of the Sass template on which this selector was declared.
-      # This also sets the line for all child selectors.
-      #
-      # @param line [Integer]
-      # @return [Integer]
-      def line=(line)
-        members.each {|m| m.line = line if m.is_a?(SimpleSequence)}
-        @line = line
-      end
-
-      # Sets the name of the file in which this selector was declared,
-      # or `nil` if it was not declared in a file (e.g. on stdin).
-      # This also sets the filename for all child selectors.
-      #
-      # @param filename [String, nil]
-      # @return [String, nil]
-      def filename=(filename)
-        members.each {|m| m.filename = filename if m.is_a?(SimpleSequence)}
-        filename
-      end
-
-      # The array of {SimpleSequence simple selector sequences}, operators, and
-      # newlines. The operators are strings such as `"+"` and `">"` representing
-      # the corresponding CSS operators, or interpolated SassScript. Newlines
-      # are also newline strings; these aren't semantically relevant, but they
-      # do affect formatting.
-      #
-      # @return [Array<SimpleSequence, String|Array<Sass::Tree::Node, String>>]
-      attr_reader :members
-
-      # @param seqs_and_ops [Array<SimpleSequence, String|Array<Sass::Tree::Node, String>>]
-      #   See \{#members}
-      def initialize(seqs_and_ops)
-        @members = seqs_and_ops
-      end
-
-      # Resolves the {Parent} selectors within this selector
-      # by replacing them with the given parent selector,
-      # handling commas appropriately.
-      #
-      # @param super_cseq [CommaSequence] The parent selector
-      # @param implicit_parent [Boolean] Whether the the parent
-      #   selector should automatically be prepended to the resolved
-      #   selector if it contains no parent refs.
-      # @return [CommaSequence] This selector, with parent references resolved
-      # @raise [Sass::SyntaxError] If a parent selector is invalid
-      def resolve_parent_refs(super_cseq, implicit_parent)
-        members = @members.dup
-        nl = (members.first == "\n" && members.shift)
-        contains_parent_ref = contains_parent_ref?
-        return CommaSequence.new([self]) if !implicit_parent && !contains_parent_ref
-
-        unless contains_parent_ref
-          old_members, members = members, []
-          members << nl if nl
-          members << SimpleSequence.new([Parent.new], false)
-          members += old_members
-        end
-
-        CommaSequence.new(Sass::Util.paths(members.map do |sseq_or_op|
-          next [sseq_or_op] unless sseq_or_op.is_a?(SimpleSequence)
-          sseq_or_op.resolve_parent_refs(super_cseq).members
-        end).map do |path|
-          Sequence.new(path.map do |seq_or_op|
-            next seq_or_op unless seq_or_op.is_a?(Sequence)
-            seq_or_op.members
-          end.flatten)
-        end)
-      end
-
-      # Returns whether there's a {Parent} selector anywhere in this sequence.
-      #
-      # @return [Boolean]
-      def contains_parent_ref?
-        members.any? do |sseq_or_op|
-          next false unless sseq_or_op.is_a?(SimpleSequence)
-          next true if sseq_or_op.members.first.is_a?(Parent)
-          sseq_or_op.members.any? do |sel|
-            sel.is_a?(Pseudo) && sel.selector && sel.selector.contains_parent_ref?
-          end
-        end
-      end
-
-      # Non-destructively extends this selector with the extensions specified in a hash
-      # (which should come from {Sass::Tree::Visitors::Cssize}).
-      #
-      # @param extends [Sass::Util::SubsetMap{Selector::Simple =>
-      #                                       Sass::Tree::Visitors::Cssize::Extend}]
-      #   The extensions to perform on this selector
-      # @param parent_directives [Array<Sass::Tree::DirectiveNode>]
-      #   The directives containing this selector.
-      # @param replace [Boolean]
-      #   Whether to replace the original selector entirely or include
-      #   it in the result.
-      # @param seen [Set<Array<Selector::Simple>>]
-      #   The set of simple sequences that are currently being replaced.
-      # @param original [Boolean]
-      #   Whether this is the original selector being extended, as opposed to
-      #   the result of a previous extension that's being re-extended.
-      # @return [Array<Sequence>] A list of selectors generated
-      #   by extending this selector with `extends`.
-      #   These correspond to a {CommaSequence}'s {CommaSequence#members members array}.
-      # @see CommaSequence#do_extend
-      def do_extend(extends, parent_directives, replace, seen, original)
-        extended_not_expanded = members.map do |sseq_or_op|
-          next [[sseq_or_op]] unless sseq_or_op.is_a?(SimpleSequence)
-          extended = sseq_or_op.do_extend(extends, parent_directives, replace, seen)
-
-          # The First Law of Extend says that the generated selector should have
-          # specificity greater than or equal to that of the original selector.
-          # In order to ensure that, we record the original selector's
-          # (`extended.first`) original specificity.
-          extended.first.add_sources!([self]) if original && !has_placeholder?
-
-          extended.map {|seq| seq.members}
-        end
-        weaves = Sass::Util.paths(extended_not_expanded).map {|path| weave(path)}
-        trim(weaves).map {|p| Sequence.new(p)}
-      end
-
-      # Unifies this with another selector sequence to produce a selector
-      # that matches (a subset of) the intersection of the two inputs.
-      #
-      # @param other [Sequence]
-      # @return [CommaSequence, nil] The unified selector, or nil if unification failed.
-      # @raise [Sass::SyntaxError] If this selector cannot be unified.
-      #   This will only ever occur when a dynamic selector,
-      #   such as {Parent} or {Interpolation}, is used in unification.
-      #   Since these selectors should be resolved
-      #   by the time extension and unification happen,
-      #   this exception will only ever be raised as a result of programmer error
-      def unify(other)
-        base = members.last
-        other_base = other.members.last
-        return unless base.is_a?(SimpleSequence) && other_base.is_a?(SimpleSequence)
-        return unless (unified = other_base.unify(base))
-
-        woven = weave([members[0...-1], other.members[0...-1] + [unified]])
-        CommaSequence.new(woven.map {|w| Sequence.new(w)})
-      end
-
-      # Returns whether or not this selector matches all elements
-      # that the given selector matches (as well as possibly more).
-      #
-      # @example
-      #   (.foo).superselector?(.foo.bar) #=> true
-      #   (.foo).superselector?(.bar) #=> false
-      # @param cseq [Sequence]
-      # @return [Boolean]
-      def superselector?(seq)
-        _superselector?(members, seq.members)
-      end
-
-      # @see AbstractSequence#to_s
-      def to_s(opts = {})
-        @members.map {|m| m.is_a?(String) ? m : m.to_s(opts)}.join(" ").gsub(/ ?\n ?/, "\n")
-      end
-
-      # Returns a string representation of the sequence.
-      # This is basically the selector string.
-      #
-      # @return [String]
-      def inspect
-        members.map {|m| m.inspect}.join(" ")
-      end
-
-      # Add to the {SimpleSequence#sources} sets of the child simple sequences.
-      # This destructively modifies this sequence's members array, but not the
-      # child simple sequences.
-      #
-      # @param sources [Set<Sequence>]
-      def add_sources!(sources)
-        members.map! {|m| m.is_a?(SimpleSequence) ? m.with_more_sources(sources) : m}
-      end
-
-      # Converts the subject operator "!", if it exists, into a ":has()"
-      # selector.
-      #
-      # @retur [Sequence]
-      def subjectless
-        pre_subject = []
-        has = []
-        subject = nil
-        members.each do |sseq_or_op|
-          if subject
-            has << sseq_or_op
-          elsif sseq_or_op.is_a?(String) || !sseq_or_op.subject?
-            pre_subject << sseq_or_op
-          else
-            subject = sseq_or_op.dup
-            subject.members = sseq_or_op.members.dup
-            subject.subject = false
-            has = []
-          end
-        end
-
-        return self unless subject
-
-        unless has.empty?
-          subject.members << Pseudo.new(:class, 'has', nil, CommaSequence.new([Sequence.new(has)]))
-        end
-        Sequence.new(pre_subject + [subject])
-      end
-
-      private
-
-      # Conceptually, this expands "parenthesized selectors". That is, if we
-      # have `.A .B {@extend .C}` and `.D .C {...}`, this conceptually expands
-      # into `.D .C, .D (.A .B)`, and this function translates `.D (.A .B)` into
-      # `.D .A .B, .A .D .B`. For thoroughness, `.A.D .B` would also be
-      # required, but including merged selectors results in exponential output
-      # for very little gain.
-      #
-      # @param path [Array<Array<SimpleSequence or String>>]
-      #   A list of parenthesized selector groups.
-      # @return [Array<Array<SimpleSequence or String>>] A list of fully-expanded selectors.
-      def weave(path)
-        # This function works by moving through the selector path left-to-right,
-        # building all possible prefixes simultaneously.
-        prefixes = [[]]
-
-        path.each do |current|
-          next if current.empty?
-          current = current.dup
-          last_current = [current.pop]
-          prefixes = prefixes.map do |prefix|
-            sub = subweave(prefix, current)
-            next [] unless sub
-            sub.map {|seqs| seqs + last_current}
-          end.flatten(1)
-        end
-        prefixes
-      end
-
-      # This interweaves two lists of selectors,
-      # returning all possible orderings of them (including using unification)
-      # that maintain the relative ordering of the input arrays.
-      #
-      # For example, given `.foo .bar` and `.baz .bang`,
-      # this would return `.foo .bar .baz .bang`, `.foo .bar.baz .bang`,
-      # `.foo .baz .bar .bang`, `.foo .baz .bar.bang`, `.foo .baz .bang .bar`,
-      # and so on until `.baz .bang .foo .bar`.
-      #
-      # Semantically, for selectors A and B, this returns all selectors `AB_i`
-      # such that the union over all i of elements matched by `AB_i X` is
-      # identical to the intersection of all elements matched by `A X` and all
-      # elements matched by `B X`. Some `AB_i` are elided to reduce the size of
-      # the output.
-      #
-      # @param seq1 [Array<SimpleSequence or String>]
-      # @param seq2 [Array<SimpleSequence or String>]
-      # @return [Array<Array<SimpleSequence or String>>]
-      def subweave(seq1, seq2)
-        return [seq2] if seq1.empty?
-        return [seq1] if seq2.empty?
-
-        seq1, seq2 = seq1.dup, seq2.dup
-        return unless (init = merge_initial_ops(seq1, seq2))
-        return unless (fin = merge_final_ops(seq1, seq2))
-
-        # Make sure there's only one root selector in the output.
-        root1 = has_root?(seq1.first) && seq1.shift
-        root2 = has_root?(seq2.first) && seq2.shift
-        if root1 && root2
-          return unless (root = root1.unify(root2))
-          seq1.unshift root
-          seq2.unshift root
-        elsif root1
-          seq2.unshift root1
-        elsif root2
-          seq1.unshift root2
-        end
-
-        seq1 = group_selectors(seq1)
-        seq2 = group_selectors(seq2)
-        lcs = Sass::Util.lcs(seq2, seq1) do |s1, s2|
-          next s1 if s1 == s2
-          next unless s1.first.is_a?(SimpleSequence) && s2.first.is_a?(SimpleSequence)
-          next s2 if parent_superselector?(s1, s2)
-          next s1 if parent_superselector?(s2, s1)
-        end
-
-        diff = [[init]]
-
-        until lcs.empty?
-          diff << chunks(seq1, seq2) {|s| parent_superselector?(s.first, lcs.first)} << [lcs.shift]
-          seq1.shift
-          seq2.shift
-        end
-        diff << chunks(seq1, seq2) {|s| s.empty?}
-        diff += fin.map {|sel| sel.is_a?(Array) ? sel : [sel]}
-        diff.reject! {|c| c.empty?}
-
-        Sass::Util.paths(diff).map {|p| p.flatten}.reject {|p| path_has_two_subjects?(p)}
-      end
-
-      # Extracts initial selector combinators (`"+"`, `">"`, `"~"`, and `"\n"`)
-      # from two sequences and merges them together into a single array of
-      # selector combinators.
-      #
-      # @param seq1 [Array<SimpleSequence or String>]
-      # @param seq2 [Array<SimpleSequence or String>]
-      # @return [Array<String>, nil] If there are no operators in the merged
-      #   sequence, this will be the empty array. If the operators cannot be
-      #   merged, this will be nil.
-      def merge_initial_ops(seq1, seq2)
-        ops1, ops2 = [], []
-        ops1 << seq1.shift while seq1.first.is_a?(String)
-        ops2 << seq2.shift while seq2.first.is_a?(String)
-
-        newline = false
-        newline ||= !!ops1.shift if ops1.first == "\n"
-        newline ||= !!ops2.shift if ops2.first == "\n"
-
-        # If neither sequence is a subsequence of the other, they cannot be
-        # merged successfully
-        lcs = Sass::Util.lcs(ops1, ops2)
-        return unless lcs == ops1 || lcs == ops2
-        (newline ? ["\n"] : []) + (ops1.size > ops2.size ? ops1 : ops2)
-      end
-
-      # Extracts final selector combinators (`"+"`, `">"`, `"~"`) and the
-      # selectors to which they apply from two sequences and merges them
-      # together into a single array.
-      #
-      # @param seq1 [Array<SimpleSequence or String>]
-      # @param seq2 [Array<SimpleSequence or String>]
-      # @return [Array<SimpleSequence or String or
-      #     Array<Array<SimpleSequence or String>>]
-      #   If there are no trailing combinators to be merged, this will be the
-      #   empty array. If the trailing combinators cannot be merged, this will
-      #   be nil. Otherwise, this will contained the merged selector. Array
-      #   elements are [Sass::Util#paths]-style options; conceptually, an "or"
-      #   of multiple selectors.
-      # @comment
-      #   rubocop:disable MethodLength
-      def merge_final_ops(seq1, seq2, res = [])
-        ops1, ops2 = [], []
-        ops1 << seq1.pop while seq1.last.is_a?(String)
-        ops2 << seq2.pop while seq2.last.is_a?(String)
-
-        # Not worth the headache of trying to preserve newlines here. The most
-        # important use of newlines is at the beginning of the selector to wrap
-        # across lines anyway.
-        ops1.reject! {|o| o == "\n"}
-        ops2.reject! {|o| o == "\n"}
-
-        return res if ops1.empty? && ops2.empty?
-        if ops1.size > 1 || ops2.size > 1
-          # If there are multiple operators, something hacky's going on. If one
-          # is a supersequence of the other, use that, otherwise give up.
-          lcs = Sass::Util.lcs(ops1, ops2)
-          return unless lcs == ops1 || lcs == ops2
-          res.unshift(*(ops1.size > ops2.size ? ops1 : ops2).reverse)
-          return res
-        end
-
-        # This code looks complicated, but it's actually just a bunch of special
-        # cases for interactions between different combinators.
-        op1, op2 = ops1.first, ops2.first
-        if op1 && op2
-          sel1 = seq1.pop
-          sel2 = seq2.pop
-          if op1 == '~' && op2 == '~'
-            if sel1.superselector?(sel2)
-              res.unshift sel2, '~'
-            elsif sel2.superselector?(sel1)
-              res.unshift sel1, '~'
-            else
-              merged = sel1.unify(sel2)
-              res.unshift [
-                [sel1, '~', sel2, '~'],
-                [sel2, '~', sel1, '~'],
-                ([merged, '~'] if merged)
-              ].compact
-            end
-          elsif (op1 == '~' && op2 == '+') || (op1 == '+' && op2 == '~')
-            if op1 == '~'
-              tilde_sel, plus_sel = sel1, sel2
-            else
-              tilde_sel, plus_sel = sel2, sel1
-            end
-
-            if tilde_sel.superselector?(plus_sel)
-              res.unshift plus_sel, '+'
-            else
-              merged = plus_sel.unify(tilde_sel)
-              res.unshift [
-                [tilde_sel, '~', plus_sel, '+'],
-                ([merged, '+'] if merged)
-              ].compact
-            end
-          elsif op1 == '>' && %w(~ +).include?(op2)
-            res.unshift sel2, op2
-            seq1.push sel1, op1
-          elsif op2 == '>' && %w(~ +).include?(op1)
-            res.unshift sel1, op1
-            seq2.push sel2, op2
-          elsif op1 == op2
-            merged = sel1.unify(sel2)
-            return unless merged
-            res.unshift merged, op1
-          else
-            # Unknown selector combinators can't be unified
-            return
-          end
-          return merge_final_ops(seq1, seq2, res)
-        elsif op1
-          seq2.pop if op1 == '>' && seq2.last && seq2.last.superselector?(seq1.last)
-          res.unshift seq1.pop, op1
-          return merge_final_ops(seq1, seq2, res)
-        else # op2
-          seq1.pop if op2 == '>' && seq1.last && seq1.last.superselector?(seq2.last)
-          res.unshift seq2.pop, op2
-          return merge_final_ops(seq1, seq2, res)
-        end
-      end
-      # @comment
-      #   rubocop:enable MethodLength
-
-      # Takes initial subsequences of `seq1` and `seq2` and returns all
-      # orderings of those subsequences. The initial subsequences are determined
-      # by a block.
-      #
-      # Destructively removes the initial subsequences of `seq1` and `seq2`.
-      #
-      # For example, given `(A B C | D E)` and `(1 2 | 3 4 5)` (with `|`
-      # denoting the boundary of the initial subsequence), this would return
-      # `[(A B C 1 2), (1 2 A B C)]`. The sequences would then be `(D E)` and
-      # `(3 4 5)`.
-      #
-      # @param seq1 [Array]
-      # @param seq2 [Array]
-      # @yield [a] Used to determine when to cut off the initial subsequences.
-      #   Called repeatedly for each sequence until it returns true.
-      # @yieldparam a [Array] A final subsequence of one input sequence after
-      #   cutting off some initial subsequence.
-      # @yieldreturn [Boolean] Whether or not to cut off the initial subsequence
-      #   here.
-      # @return [Array<Array>] All possible orderings of the initial subsequences.
-      def chunks(seq1, seq2)
-        chunk1 = []
-        chunk1 << seq1.shift until yield seq1
-        chunk2 = []
-        chunk2 << seq2.shift until yield seq2
-        return [] if chunk1.empty? && chunk2.empty?
-        return [chunk2] if chunk1.empty?
-        return [chunk1] if chunk2.empty?
-        [chunk1 + chunk2, chunk2 + chunk1]
-      end
-
-      # Groups a sequence into subsequences. The subsequences are determined by
-      # strings; adjacent non-string elements will be put into separate groups,
-      # but any element adjacent to a string will be grouped with that string.
-      #
-      # For example, `(A B "C" D E "F" G "H" "I" J)` will become `[(A) (B "C" D)
-      # (E "F" G "H" "I" J)]`.
-      #
-      # @param seq [Array]
-      # @return [Array<Array>]
-      def group_selectors(seq)
-        newseq = []
-        tail = seq.dup
-        until tail.empty?
-          head = []
-          begin
-            head << tail.shift
-          end while !tail.empty? && head.last.is_a?(String) || tail.first.is_a?(String)
-          newseq << head
-        end
-        newseq
-      end
-
-      # Given two selector sequences, returns whether `seq1` is a
-      # superselector of `seq2`; that is, whether `seq1` matches every
-      # element `seq2` matches.
-      #
-      # @param seq1 [Array<SimpleSequence or String>]
-      # @param seq2 [Array<SimpleSequence or String>]
-      # @return [Boolean]
-      def _superselector?(seq1, seq2)
-        seq1 = seq1.reject {|e| e == "\n"}
-        seq2 = seq2.reject {|e| e == "\n"}
-        # Selectors with leading or trailing operators are neither
-        # superselectors nor subselectors.
-        return if seq1.last.is_a?(String) || seq2.last.is_a?(String) ||
-          seq1.first.is_a?(String) || seq2.first.is_a?(String)
-        # More complex selectors are never superselectors of less complex ones
-        return if seq1.size > seq2.size
-        return seq1.first.superselector?(seq2.last, seq2[0...-1]) if seq1.size == 1
-
-        _, si = Sass::Util.enum_with_index(seq2).find do |e, i|
-          return if i == seq2.size - 1
-          next if e.is_a?(String)
-          seq1.first.superselector?(e, seq2[0...i])
-        end
-        return unless si
-
-        if seq1[1].is_a?(String)
-          return unless seq2[si + 1].is_a?(String)
-
-          # .foo ~ .bar is a superselector of .foo + .bar
-          return unless seq1[1] == "~" ? seq2[si + 1] != ">" : seq1[1] == seq2[si + 1]
-
-          # .foo > .baz is not a superselector of .foo > .bar > .baz or .foo >
-          # .bar .baz, despite the fact that .baz is a superselector of .bar >
-          # .baz and .bar .baz. Same goes for + and ~.
-          return if seq1.length == 3 && seq2.length > 3
-
-          return _superselector?(seq1[2..-1], seq2[si + 2..-1])
-        elsif seq2[si + 1].is_a?(String)
-          return unless seq2[si + 1] == ">"
-          return _superselector?(seq1[1..-1], seq2[si + 2..-1])
-        else
-          return _superselector?(seq1[1..-1], seq2[si + 1..-1])
-        end
-      end
-
-      # Like \{#_superselector?}, but compares the selectors in the
-      # context of parent selectors, as though they shared an implicit
-      # base simple selector. For example, `B` is not normally a
-      # superselector of `B A`, since it doesn't match `A` elements.
-      # However, it is a parent superselector, since `B X` is a
-      # superselector of `B A X`.
-      #
-      # @param seq1 [Array<SimpleSequence or String>]
-      # @param seq2 [Array<SimpleSequence or String>]
-      # @return [Boolean]
-      def parent_superselector?(seq1, seq2)
-        base = Sass::Selector::SimpleSequence.new([Sass::Selector::Placeholder.new('<temp>')],
-                                                  false)
-        _superselector?(seq1 + [base], seq2 + [base])
-      end
-
-      # Removes redundant selectors from between multiple lists of
-      # selectors. This takes a list of lists of selector sequences;
-      # each individual list is assumed to have no redundancy within
-      # itself. A selector is only removed if it's redundant with a
-      # selector in another list.
-      #
-      # "Redundant" here means that one selector is a superselector of
-      # the other. The more specific selector is removed.
-      #
-      # @param seqses [Array<Array<Array<SimpleSequence or String>>>]
-      # @return [Array<Array<SimpleSequence or String>>]
-      def trim(seqses)
-        # Avoid truly horrific quadratic behavior. TODO: I think there
-        # may be a way to get perfect trimming without going quadratic.
-        return seqses.flatten(1) if seqses.size > 100
-
-        # Keep the results in a separate array so we can be sure we aren't
-        # comparing against an already-trimmed selector. This ensures that two
-        # identical selectors don't mutually trim one another.
-        result = seqses.dup
-
-        # This is n^2 on the sequences, but only comparing between
-        # separate sequences should limit the quadratic behavior.
-        seqses.each_with_index do |seqs1, i|
-          result[i] = seqs1.reject do |seq1|
-            # The maximum specificity of the sources that caused [seq1] to be
-            # generated. In order for [seq1] to be removed, there must be
-            # another selector that's a superselector of it *and* that has
-            # specificity greater or equal to this.
-            max_spec = _sources(seq1).map do |seq|
-              spec = seq.specificity
-              spec.is_a?(Range) ? spec.max : spec
-            end.max || 0
-
-            result.any? do |seqs2|
-              next if seqs1.equal?(seqs2)
-              # Second Law of Extend: the specificity of a generated selector
-              # should never be less than the specificity of the extending
-              # selector.
-              #
-              # See https://github.com/nex3/sass/issues/324.
-              seqs2.any? do |seq2|
-                spec2 = _specificity(seq2)
-                spec2 = spec2.begin if spec2.is_a?(Range)
-                spec2 >= max_spec && _superselector?(seq2, seq1)
-              end
-            end
-          end
-        end
-        result.flatten(1)
-      end
-
-      def _hash
-        members.reject {|m| m == "\n"}.hash
-      end
-
-      def _eql?(other)
-        other.members.reject {|m| m == "\n"}.eql?(members.reject {|m| m == "\n"})
-      end
-
-      private
-
-      def path_has_two_subjects?(path)
-        subject = false
-        path.each do |sseq_or_op|
-          next unless sseq_or_op.is_a?(SimpleSequence)
-          next unless sseq_or_op.subject?
-          return true if subject
-          subject = true
-        end
-        false
-      end
-
-      def _sources(seq)
-        s = Set.new
-        seq.map {|sseq_or_op| s.merge sseq_or_op.sources if sseq_or_op.is_a?(SimpleSequence)}
-        s
-      end
-
-      def extended_not_expanded_to_s(extended_not_expanded)
-        extended_not_expanded.map do |choices|
-          choices = choices.map do |sel|
-            next sel.first.to_s if sel.size == 1
-            "#{sel.join ' '}"
-          end
-          next choices.first if choices.size == 1 && !choices.include?(' ')
-          "(#{choices.join ', '})"
-        end.join ' '
-      end
-
-      def has_root?(sseq)
-        sseq.is_a?(SimpleSequence) &&
-          sseq.members.any? {|sel| sel.is_a?(Pseudo) && sel.normalized_name == "root"}
-      end
-    end
-  end
-end