haml 3.2.0.alpha.10 → 3.2.0.alpha.13

data/vendor/sass/lib/sass/tree/visitors/set_options.rb

@@ -1,97 +0,0 @@
-# A visitor for setting options on the Sass tree
-class Sass::Tree::Visitors::SetOptions < Sass::Tree::Visitors::Base
-  # @param root [Tree::Node] The root node of the tree to visit.
-  # @param options [{Symbol => Object}] The options has to set.
-  def self.visit(root, options); new(options).send(:visit, root); end
-
-  protected
-
-  def initialize(options)
-    @options = options
-  end
-
-  def visit(node)
-    node.instance_variable_set('@options', @options)
-    super
-  end
-
-  def visit_debug(node)
-    node.expr.options = @options
-    yield
-  end
-
-  def visit_each(node)
-    node.list.options = @options
-    yield
-  end
-
-  def visit_extend(node)
-    node.selector.each {|c| c.options = @options if c.is_a?(Sass::Script::Node)}
-    yield
-  end
-
-  def visit_for(node)
-    node.from.options = @options
-    node.to.options = @options
-    yield
-  end
-
-  def visit_function(node)
-    node.args.each do |k, v|
-      k.options = @options
-      v.options = @options if v
-    end
-    yield
-  end
-
-  def visit_if(node)
-    node.expr.options = @options if node.expr
-    visit(node.else) if node.else
-    yield
-  end
-
-  def visit_mixindef(node)
-    node.args.each do |k, v|
-      k.options = @options
-      v.options = @options if v
-    end
-    yield
-  end
-
-  def visit_mixin(node)
-    node.args.each {|a| a.options = @options}
-    node.keywords.each {|k, v| v.options = @options}
-    yield
-  end
-
-  def visit_prop(node)
-    node.name.each {|c| c.options = @options if c.is_a?(Sass::Script::Node)}
-    node.value.options = @options
-    yield
-  end
-
-  def visit_return(node)
-    node.expr.options = @options
-    yield
-  end
-
-  def visit_rule(node)
-    node.rule.each {|c| c.options = @options if c.is_a?(Sass::Script::Node)}
-    yield
-  end
-
-  def visit_variable(node)
-    node.expr.options = @options
-    yield
-  end
-
-  def visit_warn(node)
-    node.expr.options = @options
-    yield
-  end
-
-  def visit_while(node)
-    node.expr.options = @options
-    yield
-  end
-end

data/vendor/sass/lib/sass/tree/visitors/to_css.rb

@@ -1,210 +0,0 @@
-# A visitor for converting a Sass tree into CSS.
-class Sass::Tree::Visitors::ToCss < Sass::Tree::Visitors::Base
-  protected
-
-  def initialize
-    @tabs = 0
-  end
-
-  def visit(node)
-    super
-  rescue Sass::SyntaxError => e
-    e.modify_backtrace(:filename => node.filename, :line => node.line)
-    raise e
-  end
-
-  def with_tabs(tabs)
-    old_tabs, @tabs = @tabs, tabs
-    yield
-  ensure
-    @tabs = old_tabs
-  end
-
-  def visit_root(node)
-    result = String.new
-    node.children.each do |child|
-      next if child.invisible?
-      child_str = visit(child)
-      result << child_str + (node.style == :compressed ? '' : "\n")
-    end
-    result.rstrip!
-    return "" if result.empty?
-    result << "\n"
-    unless Sass::Util.ruby1_8? || result.ascii_only?
-      if node.children.first.is_a?(Sass::Tree::CharsetNode)
-        begin
-          encoding = node.children.first.name
-          # Default to big-endian encoding, because we have to decide somehow
-          encoding << 'BE' if encoding =~ /\Autf-(16|32)\Z/i
-          result = result.encode(Encoding.find(encoding))
-        rescue EncodingError
-        end
-      end
-
-      result = "@charset \"#{result.encoding.name}\";#{
-        node.style == :compressed ? '' : "\n"
-      }".encode(result.encoding) + result
-    end
-    result
-  rescue Sass::SyntaxError => e
-    e.sass_template ||= node.template
-    raise e
-  end
-
-  def visit_charset(node)
-    "@charset \"#{node.name}\";"
-  end 
-
-  def visit_comment(node)
-    return if node.invisible?
-    spaces = ('  ' * [@tabs - node.resolved_value[/^ */].size, 0].max)
-
-    content = node.resolved_value.gsub(/^/, spaces).gsub(%r{^(\s*)//(.*)$}) do |md|
-      "#{$1}/*#{$2} */"
-    end
-    content.gsub!(/\n +(\* *(?!\/))?/, ' ') if (node.style == :compact || node.style == :compressed) && !node.loud
-    content
-  end
-
-  def visit_directive(node)
-    return node.value + ";" unless node.has_children
-    return node.value + " {}" if node.children.empty?
-    result = if node.style == :compressed
-               "#{node.value}{"
-             else
-               "#{'  ' * @tabs}#{node.value} {" + (node.style == :compact ? ' ' : "\n")
-             end
-    was_prop = false
-    first = true
-    node.children.each do |child|
-      next if child.invisible?
-      if node.style == :compact
-        if child.is_a?(Sass::Tree::PropNode)
-          with_tabs(first || was_prop ? 0 : @tabs + 1) {result << visit(child) << ' '}
-        else
-          result[-1] = "\n" if was_prop
-          rendered = with_tabs(@tabs + 1) {visit(child).dup}
-          rendered = rendered.lstrip if first
-          result << rendered.rstrip + "\n"
-        end
-        was_prop = child.is_a?(Sass::Tree::PropNode)
-        first = false
-      elsif node.style == :compressed
-        result << (was_prop ? ";" : "") << with_tabs(0) {visit(child)}
-        was_prop = child.is_a?(Sass::Tree::PropNode)
-      else
-        result << with_tabs(@tabs + 1) {visit(child)} + "\n"
-      end
-    end
-    result.rstrip + if node.style == :compressed
-                      "}"
-                    else
-                      (node.style == :expanded ? "\n" : " ") + "}\n"
-                    end
-  end
-
-  def visit_media(node)
-    str = with_tabs(@tabs + node.tabs) {visit_directive(node)}
-    str.gsub!(/\n\Z/, '') unless node.style == :compressed || node.group_end
-    str
-  end
-
-  def visit_prop(node)
-    tab_str = '  ' * (@tabs + node.tabs)
-    if node.style == :compressed
-      "#{tab_str}#{node.resolved_name}:#{node.resolved_value}"
-    else
-      "#{tab_str}#{node.resolved_name}: #{node.resolved_value};"
-    end
-  end
-
-  def visit_rule(node)
-    with_tabs(@tabs + node.tabs) do
-      rule_separator = node.style == :compressed ? ',' : ', '
-      line_separator =
-        case node.style
-          when :nested, :expanded; "\n"
-          when :compressed; ""
-          else; " "
-        end
-      rule_indent = '  ' * @tabs
-      per_rule_indent, total_indent = [:nested, :expanded].include?(node.style) ? [rule_indent, ''] : ['', rule_indent]
-
-      joined_rules = node.resolved_rules.members.map do |seq|
-        rule_part = seq.to_a.join
-        rule_part.gsub!(/\s*([^,])\s*\n\s*/m, '\1 ') if node.style == :compressed
-        rule_part
-      end.join(rule_separator)
-
-      joined_rules.sub!(/\A\s*/, per_rule_indent)
-      joined_rules.gsub!(/\s*\n\s*/, "#{line_separator}#{per_rule_indent}")
-      total_rule = total_indent << joined_rules
-
-      to_return = ''
-      old_spaces = '  ' * @tabs
-      spaces = '  ' * (@tabs + 1)
-      if node.style != :compressed
-        if node.options[:debug_info]
-          to_return << visit(debug_info_rule(node.debug_info, node.options)) << "\n"
-        elsif node.options[:trace_selectors]
-          to_return << "#{old_spaces}/* "
-          to_return << node.stack_trace.join("\n   #{old_spaces}")
-          to_return << " */\n"
-        elsif node.options[:line_comments]
-          to_return << "#{old_spaces}/* line #{node.line}"
-
-          if node.filename
-            relative_filename = if node.options[:css_filename]
-              begin
-                Pathname.new(node.filename).relative_path_from(
-                  Pathname.new(File.dirname(node.options[:css_filename]))).to_s
-              rescue ArgumentError
-                nil
-              end
-            end
-            relative_filename ||= node.filename
-            to_return << ", #{relative_filename}"
-          end
-
-          to_return << " */\n"
-        end
-      end
-
-      if node.style == :compact
-        properties = with_tabs(0) {node.children.map {|a| visit(a)}.join(' ')}
-        to_return << "#{total_rule} { #{properties} }#{"\n" if node.group_end}"
-      elsif node.style == :compressed
-        properties = with_tabs(0) {node.children.map {|a| visit(a)}.join(';')}
-        to_return << "#{total_rule}{#{properties}}"
-      else
-        properties = with_tabs(@tabs + 1) {node.children.map {|a| visit(a)}.join("\n")}
-        end_props = (node.style == :expanded ? "\n" + old_spaces : ' ')
-        to_return << "#{total_rule} {\n#{properties}#{end_props}}#{"\n" if node.group_end}"
-      end
-
-      to_return
-    end
-  end
-
-  private
-
-  def debug_info_rule(debug_info, options)
-    node = Sass::Tree::DirectiveNode.new("@media -sass-debug-info")
-    debug_info.map {|k, v| [k.to_s, v.to_s]}.sort.each do |k, v|
-      rule = Sass::Tree::RuleNode.new([""])
-      rule.resolved_rules = Sass::Selector::CommaSequence.new(
-        [Sass::Selector::Sequence.new(
-            [Sass::Selector::SimpleSequence.new(
-                [Sass::Selector::Element.new(k.to_s.gsub(/[^\w-]/, "\\\\\\0"), nil)])
-            ])
-        ])
-      prop = Sass::Tree::PropNode.new([""], Sass::Script::String.new(''), :new)
-      prop.resolved_name = "font-family"
-      prop.resolved_value = Sass::SCSS::RX.escape_ident(v.to_s)
-      rule << prop
-      node << rule
-    end
-    node.options = options.merge(:debug_info => false, :line_comments => false, :style => :compressed)
-    node
-  end
-end

data/vendor/sass/lib/sass/tree/warn_node.rb

@@ -1,18 +0,0 @@
-module Sass
-  module Tree
-    # A dynamic node representing a Sass `@warn` statement.
-    #
-    # @see Sass::Tree
-    class WarnNode < Node
-      # The expression to print.
-      # @return [Script::Node]
-      attr_accessor :expr
-
-      # @param expr [Script::Node] The expression to print
-      def initialize(expr)
-        @expr = expr
-        super()
-      end
-    end
-  end
-end

data/vendor/sass/lib/sass/tree/while_node.rb

@@ -1,18 +0,0 @@
-require 'sass/tree/node'
-
-module Sass::Tree
-  # A dynamic node representing a Sass `@while` loop.
-  #
-  # @see Sass::Tree
-  class WhileNode < Node
-    # The parse tree for the continuation expression.
-    # @return [Script::Node]
-    attr_accessor :expr
-
-    # @param expr [Script::Node] See \{#expr}
-    def initialize(expr)
-      @expr = expr
-      super()
-    end
-  end
-end

data/vendor/sass/lib/sass/util.rb

@@ -1,721 +0,0 @@
-require 'erb'
-require 'set'
-require 'enumerator'
-require 'stringio'
-require 'strscan'
-require 'rbconfig'
-
-require 'sass/root'
-require 'sass/util/subset_map'
-
-module Sass
-  # A module containing various useful functions.
-  module Util
-    extend self
-
-    # An array of ints representing the Ruby version number.
-    # @api public
-    RUBY_VERSION = ::RUBY_VERSION.split(".").map {|s| s.to_i}
-
-    # The Ruby engine we're running under. Defaults to `"ruby"`
-    # if the top-level constant is undefined.
-    # @api public
-    RUBY_ENGINE = defined?(::RUBY_ENGINE) ? ::RUBY_ENGINE : "ruby"
-
-    # Returns the path of a file relative to the Sass root directory.
-    #
-    # @param file [String] The filename relative to the Sass root
-    # @return [String] The filename relative to the the working directory
-    def scope(file)
-      File.join(Sass::ROOT_DIR, file)
-    end
-
-    # Converts an array of `[key, value]` pairs to a hash.
-    #
-    # @example
-    #   to_hash([[:foo, "bar"], [:baz, "bang"]])
-    #     #=> {:foo => "bar", :baz => "bang"}
-    # @param arr [Array<(Object, Object)>] An array of pairs
-    # @return [Hash] A hash
-    def to_hash(arr)
-      Hash[arr.compact]
-    end
-
-    # Maps the keys in a hash according to a block.
-    #
-    # @example
-    #   map_keys({:foo => "bar", :baz => "bang"}) {|k| k.to_s}
-    #     #=> {"foo" => "bar", "baz" => "bang"}
-    # @param hash [Hash] The hash to map
-    # @yield [key] A block in which the keys are transformed
-    # @yieldparam key [Object] The key that should be mapped
-    # @yieldreturn [Object] The new value for the key
-    # @return [Hash] The mapped hash
-    # @see #map_vals
-    # @see #map_hash
-    def map_keys(hash)
-      to_hash(hash.map {|k, v| [yield(k), v]})
-    end
-
-    # Maps the values in a hash according to a block.
-    #
-    # @example
-    #   map_values({:foo => "bar", :baz => "bang"}) {|v| v.to_sym}
-    #     #=> {:foo => :bar, :baz => :bang}
-    # @param hash [Hash] The hash to map
-    # @yield [value] A block in which the values are transformed
-    # @yieldparam value [Object] The value that should be mapped
-    # @yieldreturn [Object] The new value for the value
-    # @return [Hash] The mapped hash
-    # @see #map_keys
-    # @see #map_hash
-    def map_vals(hash)
-      to_hash(hash.map {|k, v| [k, yield(v)]})
-    end
-
-    # Maps the key-value pairs of a hash according to a block.
-    #
-    # @example
-    #   map_hash({:foo => "bar", :baz => "bang"}) {|k, v| [k.to_s, v.to_sym]}
-    #     #=> {"foo" => :bar, "baz" => :bang}
-    # @param hash [Hash] The hash to map
-    # @yield [key, value] A block in which the key-value pairs are transformed
-    # @yieldparam [key] The hash key
-    # @yieldparam [value] The hash value
-    # @yieldreturn [(Object, Object)] The new value for the `[key, value]` pair
-    # @return [Hash] The mapped hash
-    # @see #map_keys
-    # @see #map_vals
-    def map_hash(hash, &block)
-      to_hash(hash.map(&block))
-    end
-
-    # Computes the powerset of the given array.
-    # This is the set of all subsets of the array.
-    #
-    # @example
-    #   powerset([1, 2, 3]) #=>
-    #     Set[Set[], Set[1], Set[2], Set[3], Set[1, 2], Set[2, 3], Set[1, 3], Set[1, 2, 3]]
-    # @param arr [Enumerable]
-    # @return [Set<Set>] The subsets of `arr`
-    def powerset(arr)
-      arr.inject([Set.new].to_set) do |powerset, el|
-        new_powerset = Set.new
-        powerset.each do |subset|
-          new_powerset << subset
-          new_powerset << subset + [el]
-        end
-        new_powerset
-      end
-    end
-
-    # Restricts a number to falling within a given range.
-    # Returns the number if it falls within the range,
-    # or the closest value in the range if it doesn't.
-    #
-    # @param value [Numeric]
-    # @param range [Range<Numeric>]
-    # @return [Numeric]
-    def restrict(value, range)
-      [[value, range.first].max, range.last].min
-    end
-
-    # Concatenates all strings that are adjacent in an array,
-    # while leaving other elements as they are.
-    #
-    # @example
-    #   merge_adjacent_strings([1, "foo", "bar", 2, "baz"])
-    #     #=> [1, "foobar", 2, "baz"]
-    # @param arr [Array]
-    # @return [Array] The enumerable with strings merged
-    def merge_adjacent_strings(arr)
-      # Optimize for the common case of one element
-      return arr if arr.size < 2
-      arr.inject([]) do |a, e|
-        if e.is_a?(String)
-          if a.last.is_a?(String)
-            a.last << e
-          else
-            a << e.dup
-          end
-        else
-          a << e
-        end
-        a
-      end
-    end
-
-    # Intersperses a value in an enumerable, as would be done with `Array#join`
-    # but without concatenating the array together afterwards.
-    #
-    # @param enum [Enumerable]
-    # @param val
-    # @return [Array]
-    def intersperse(enum, val)
-      enum.inject([]) {|a, e| a << e << val}[0...-1]
-    end
-
-    # Substitutes a sub-array of one array with another sub-array.
-    #
-    # @param ary [Array] The array in which to make the substitution
-    # @param from [Array] The sequence of elements to replace with `to`
-    # @param to [Array] The sequence of elements to replace `from` with
-    def substitute(ary, from, to)
-      res = ary.dup
-      i = 0
-      while i < res.size
-        if res[i...i+from.size] == from
-          res[i...i+from.size] = to
-        end
-        i += 1
-      end
-      res
-    end
-
-    # Destructively strips whitespace from the beginning and end
-    # of the first and last elements, respectively,
-    # in the array (if those elements are strings).
-    #
-    # @param arr [Array]
-    # @return [Array] `arr`
-    def strip_string_array(arr)
-      arr.first.lstrip! if arr.first.is_a?(String)
-      arr.last.rstrip! if arr.last.is_a?(String)
-      arr
-    end
-
-    # Return an array of all possible paths through the given arrays.
-    #
-    # @param arrs [Array<Array>]
-    # @return [Array<Arrays>]
-    #
-    # @example
-    #   paths([[1, 2], [3, 4], [5]]) #=>
-    #     # [[1, 3, 5],
-    #     #  [2, 3, 5],
-    #     #  [1, 4, 5],
-    #     #  [2, 4, 5]]
-    def paths(arrs)
-      arrs.inject([[]]) do |paths, arr|
-        flatten(arr.map {|e| paths.map {|path| path + [e]}}, 1)
-      end
-    end
-
-    # Computes a single longest common subsequence for `x` and `y`.
-    # If there are more than one longest common subsequences,
-    # the one returned is that which starts first in `x`.
-    #
-    # @param x [Array]
-    # @param y [Array]
-    # @yield [a, b] An optional block to use in place of a check for equality
-    #   between elements of `x` and `y`.
-    # @yieldreturn [Object, nil] If the two values register as equal,
-    #   this will return the value to use in the LCS array.
-    # @return [Array] The LCS
-    def lcs(x, y, &block)
-      x = [nil, *x]
-      y = [nil, *y]
-      block ||= proc {|a, b| a == b && a}
-      lcs_backtrace(lcs_table(x, y, &block), x, y, x.size-1, y.size-1, &block)
-    end
-
-    # Returns information about the caller of the previous method.
-    #
-    # @param entry [String] An entry in the `#caller` list, or a similarly formatted string
-    # @return [[String, Fixnum, (String, nil)]] An array containing the filename, line, and method name of the caller.
-    #   The method name may be nil
-    def caller_info(entry = caller[1])
-      info = entry.scan(/^(.*?):(-?.*?)(?::.*`(.+)')?$/).first
-      info[1] = info[1].to_i
-      # This is added by Rubinius to designate a block, but we don't care about it.
-      info[2].sub!(/ \{\}\Z/, '') if info[2]
-      info
-    end
-
-    # Returns whether one version string represents a more recent version than another.
-    #
-    # @param v1 [String] A version string.
-    # @param v2 [String] Another version string.
-    # @return [Boolean]
-    def version_gt(v1, v2)
-      # Construct an array to make sure the shorter version is padded with nil
-      Array.new([v1.length, v2.length].max).zip(v1.split("."), v2.split(".")) do |_, p1, p2|
-        p1 ||= "0"
-        p2 ||= "0"
-        release1 = p1 =~ /^[0-9]+$/
-        release2 = p2 =~ /^[0-9]+$/
-        if release1 && release2
-          # Integer comparison if both are full releases
-          p1, p2 = p1.to_i, p2.to_i
-          next if p1 == p2
-          return p1 > p2
-        elsif !release1 && !release2
-          # String comparison if both are prereleases
-          next if p1 == p2
-          return p1 > p2
-        else
-          # If only one is a release, that one is newer
-          return release1
-        end
-      end
-    end
-
-    # Returns whether one version string represents the same or a more
-    # recent version than another.
-    #
-    # @param v1 [String] A version string.
-    # @param v2 [String] Another version string.
-    # @return [Boolean]
-    def version_geq(v1, v2)
-      version_gt(v1, v2) || !version_gt(v2, v1)
-    end
-
-    # Throws a NotImplementedError for an abstract method.
-    #
-    # @param obj [Object] `self`
-    # @raise [NotImplementedError]
-    def abstract(obj)
-      raise NotImplementedError.new("#{obj.class} must implement ##{caller_info[2]}")
-    end
-
-    # Silence all output to STDERR within a block.
-    #
-    # @yield A block in which no output will be printed to STDERR
-    def silence_warnings
-      the_real_stderr, $stderr = $stderr, StringIO.new
-      yield
-    ensure
-      $stderr = the_real_stderr
-    end
-
-    @@silence_warnings = false
-    # Silences all Sass warnings within a block.
-    #
-    # @yield A block in which no Sass warnings will be printed
-    def silence_sass_warnings
-      old_level, Sass.logger.log_level = Sass.logger.log_level, :error
-      yield
-    ensure
-      Sass.logger.log_level = old_level
-    end
-
-    # The same as `Kernel#warn`, but is silenced by \{#silence\_sass\_warnings}.
-    #
-    # @param msg [String]
-    def sass_warn(msg)
-      Sass.logger.warn(msg)
-    end
-
-    ## Cross Rails Version Compatibility
-
-    # Returns the root of the Rails application,
-    # if this is running in a Rails context.
-    # Returns `nil` if no such root is defined.
-    #
-    # @return [String, nil]
-    def rails_root
-      if defined?(::Rails.root)
-        return ::Rails.root.to_s if ::Rails.root
-        raise "ERROR: Rails.root is nil!"
-      end
-      return RAILS_ROOT.to_s if defined?(RAILS_ROOT)
-      return nil
-    end
-
-    # Returns the environment of the Rails application,
-    # if this is running in a Rails context.
-    # Returns `nil` if no such environment is defined.
-    #
-    # @return [String, nil]
-    def rails_env
-      return ::Rails.env.to_s if defined?(::Rails.env)
-      return RAILS_ENV.to_s if defined?(RAILS_ENV)
-      return nil
-    end
-
-    # Returns whether this environment is using ActionPack
-    # version 3.0.0 or greater.
-    #
-    # @return [Boolean]
-    def ap_geq_3?
-      ap_geq?("3.0.0.beta1")
-    end
-
-    # Returns whether this environment is using ActionPack
-    # of a version greater than or equal to that specified.
-    #
-    # @param version [String] The string version number to check against.
-    #   Should be greater than or equal to Rails 3,
-    #   because otherwise ActionPack::VERSION isn't autoloaded
-    # @return [Boolean]
-    def ap_geq?(version)
-      # The ActionPack module is always loaded automatically in Rails >= 3
-      return false unless defined?(ActionPack) && defined?(ActionPack::VERSION) &&
-        defined?(ActionPack::VERSION::STRING)
-
-      version_geq(ActionPack::VERSION::STRING, version)
-    end
-
-    # Returns an ActionView::Template* class.
-    # In pre-3.0 versions of Rails, most of these classes
-    # were of the form `ActionView::TemplateFoo`,
-    # while afterwards they were of the form `ActionView;:Template::Foo`.
-    #
-    # @param name [#to_s] The name of the class to get.
-    #   For example, `:Error` will return `ActionView::TemplateError`
-    #   or `ActionView::Template::Error`.
-    def av_template_class(name)
-      return ActionView.const_get("Template#{name}") if ActionView.const_defined?("Template#{name}")
-      return ActionView::Template.const_get(name.to_s)
-    end
-
-    ## Cross-OS Compatibility
-
-    # Whether or not this is running on Windows.
-    #
-    # @return [Boolean]
-    def windows?
-      RbConfig::CONFIG['host_os'] =~ /mswin|windows|mingw/i
-    end
-
-    # Whether or not this is running on IronRuby.
-    #
-    # @return [Boolean]
-    def ironruby?
-      RUBY_ENGINE == "ironruby"
-    end
-
-    ## Cross-Ruby-Version Compatibility
-
-    # Whether or not this is running under Ruby 1.8 or lower.
-    #
-    # Note that IronRuby counts as Ruby 1.8,
-    # because it doesn't support the Ruby 1.9 encoding API.
-    #
-    # @return [Boolean]
-    def ruby1_8?
-      # IronRuby says its version is 1.9, but doesn't support any of the encoding APIs.
-      # We have to fall back to 1.8 behavior.
-      ironruby? || (Sass::Util::RUBY_VERSION[0] == 1 && Sass::Util::RUBY_VERSION[1] < 9)
-    end
-
-    # Whether or not this is running under Ruby 1.8.6 or lower.
-    # Note that lower versions are not officially supported.
-    #
-    # @return [Boolean]
-    def ruby1_8_6?
-      ruby1_8? && Sass::Util::RUBY_VERSION[2] < 7
-    end
-
-    # Checks that the encoding of a string is valid in Ruby 1.9
-    # and cleans up potential encoding gotchas like the UTF-8 BOM.
-    # If it's not, yields an error string describing the invalid character
-    # and the line on which it occurrs.
-    #
-    # @param str [String] The string of which to check the encoding
-    # @yield [msg] A block in which an encoding error can be raised.
-    #   Only yields if there is an encoding error
-    # @yieldparam msg [String] The error message to be raised
-    # @return [String] `str`, potentially with encoding gotchas like BOMs removed
-    def check_encoding(str)
-      if ruby1_8?
-        return str.gsub(/\A\xEF\xBB\xBF/, '') # Get rid of the UTF-8 BOM
-      elsif str.valid_encoding?
-        # Get rid of the Unicode BOM if possible
-        if str.encoding.name =~ /^UTF-(8|16|32)(BE|LE)?$/
-          return str.gsub(Regexp.new("\\A\uFEFF".encode(str.encoding.name)), '')
-        else
-          return str
-        end
-      end
-
-      encoding = str.encoding
-      newlines = Regexp.new("\r\n|\r|\n".encode(encoding).force_encoding("binary"))
-      str.force_encoding("binary").split(newlines).each_with_index do |line, i|
-        begin
-          line.encode(encoding)
-        rescue Encoding::UndefinedConversionError => e
-          yield <<MSG.rstrip, i + 1
-Invalid #{encoding.name} character #{e.error_char.dump}
-MSG
-        end
-      end
-      return str
-    end
-
-    # Like {\#check\_encoding}, but also checks for a `@charset` declaration
-    # at the beginning of the file and uses that encoding if it exists.
-    #
-    # The Sass encoding rules are simple.
-    # If a `@charset` declaration exists,
-    # we assume that that's the original encoding of the document.
-    # Otherwise, we use whatever encoding Ruby has.
-    # Then we convert that to UTF-8 to process internally.
-    # The UTF-8 end result is what's returned by this method.
-    #
-    # @param str [String] The string of which to check the encoding
-    # @yield [msg] A block in which an encoding error can be raised.
-    #   Only yields if there is an encoding error
-    # @yieldparam msg [String] The error message to be raised
-    # @return [(String, Encoding)] The original string encoded as UTF-8,
-    #   and the source encoding of the string (or `nil` under Ruby 1.8)
-    # @raise [Encoding::UndefinedConversionError] if the source encoding
-    #   cannot be converted to UTF-8
-    # @raise [ArgumentError] if the document uses an unknown encoding with `@charset`
-    def check_sass_encoding(str, &block)
-      return check_encoding(str, &block), nil if ruby1_8?
-      # We allow any printable ASCII characters but double quotes in the charset decl
-      bin = str.dup.force_encoding("BINARY")
-      encoding = Sass::Util::ENCODINGS_TO_CHECK.find do |enc|
-        re = Sass::Util::CHARSET_REGEXPS[enc]
-        re && bin =~ re
-      end
-      charset, bom = $1, $2
-      if charset
-        charset = charset.force_encoding(encoding).encode("UTF-8")
-        if endianness = encoding[/[BL]E$/]
-          begin
-            Encoding.find(charset + endianness)
-            charset << endianness
-          rescue ArgumentError # Encoding charset + endianness doesn't exist
-          end
-        end
-        str.force_encoding(charset)
-      elsif bom
-        str.force_encoding(encoding)
-      end
-
-      str = check_encoding(str, &block)
-      return str.encode("UTF-8"), str.encoding
-    end
-
-    unless ruby1_8?
-      # @private
-      def _enc(string, encoding)
-        string.encode(encoding).force_encoding("BINARY")
-      end
-
-      # We could automatically add in any non-ASCII-compatible encodings here,
-      # but there's not really a good way to do that
-      # without manually checking that each encoding
-      # encodes all ASCII characters properly,
-      # which takes long enough to affect the startup time of the CLI.
-      ENCODINGS_TO_CHECK = %w[UTF-8 UTF-16BE UTF-16LE UTF-32BE UTF-32LE]
-
-      CHARSET_REGEXPS = Hash.new do |h, e|
-        h[e] =
-          begin
-            # /\A(?:\uFEFF)?@charset "(.*?)"|\A(\uFEFF)/
-            Regexp.new(/\A(?:#{_enc("\uFEFF", e)})?#{
-              _enc('@charset "', e)}(.*?)#{_enc('"', e)}|\A(#{
-              _enc("\uFEFF", e)})/)
-          rescue Encoding::ConverterNotFound => _
-            nil # JRuby on Java 5 doesn't support UTF-32
-          rescue
-            # /\A@charset "(.*?)"/
-            Regexp.new(/\A#{_enc('@charset "', e)}(.*?)#{_enc('"', e)}/)
-          end
-      end
-    end
-
-    # Checks to see if a class has a given method.
-    # For example:
-    #
-    #     Sass::Util.has?(:public_instance_method, String, :gsub) #=> true
-    #
-    # Method collections like `Class#instance_methods`
-    # return strings in Ruby 1.8 and symbols in Ruby 1.9 and on,
-    # so this handles checking for them in a compatible way.
-    #
-    # @param attr [#to_s] The (singular) name of the method-collection method
-    #   (e.g. `:instance_methods`, `:private_methods`)
-    # @param klass [Module] The class to check the methods of which to check
-    # @param method [String, Symbol] The name of the method do check for
-    # @return [Boolean] Whether or not the given collection has the given method
-    def has?(attr, klass, method)
-      klass.send("#{attr}s").include?(ruby1_8? ? method.to_s : method.to_sym)
-    end
-
-    # A version of `Enumerable#enum_with_index` that works in Ruby 1.8 and 1.9.
-    #
-    # @param enum [Enumerable] The enumerable to get the enumerator for
-    # @return [Enumerator] The with-index enumerator
-    def enum_with_index(enum)
-      ruby1_8? ? enum.enum_with_index : enum.each_with_index
-    end
-
-    # A version of `Enumerable#enum_cons` that works in Ruby 1.8 and 1.9.
-    #
-    # @param enum [Enumerable] The enumerable to get the enumerator for
-    # @param n [Fixnum] The size of each cons
-    # @return [Enumerator] The consed enumerator
-    def enum_cons(enum, n)
-      ruby1_8? ? enum.enum_cons(n) : enum.each_cons(n)
-    end
-
-    # A version of `Enumerable#enum_slice` that works in Ruby 1.8 and 1.9.
-    #
-    # @param enum [Enumerable] The enumerable to get the enumerator for
-    # @param n [Fixnum] The size of each slice
-    # @return [Enumerator] The consed enumerator
-    def enum_slice(enum, n)
-      ruby1_8? ? enum.enum_slice(n) : enum.each_slice(n)
-    end
-
-    # Returns the ASCII code of the given character.
-    #
-    # @param c [String] All characters but the first are ignored.
-    # @return [Fixnum] The ASCII code of `c`.
-    def ord(c)
-      ruby1_8? ? c[0] : c.ord
-    end
-
-    # Flattens the first `n` nested arrays in a cross-version manner.
-    #
-    # @param arr [Array] The array to flatten
-    # @param n [Fixnum] The number of levels to flatten
-    # @return [Array] The flattened array
-    def flatten(arr, n)
-      return arr.flatten(n) unless ruby1_8_6?
-      return arr if n == 0
-      arr.inject([]) {|res, e| e.is_a?(Array) ? res.concat(flatten(e, n - 1)) : res << e}
-    end
-
-    # Returns the hash code for a set in a cross-version manner.
-    # Aggravatingly, this is order-dependent in Ruby 1.8.6.
-    #
-    # @param set [Set]
-    # @return [Fixnum] The order-independent hashcode of `set`
-    def set_hash(set)
-      return set.hash unless ruby1_8_6?
-      set.map {|e| e.hash}.uniq.sort.hash
-    end
-
-    # Tests the hash-equality of two sets in a cross-version manner.
-    # Aggravatingly, this is order-dependent in Ruby 1.8.6.
-    #
-    # @param set1 [Set]
-    # @param set2 [Set]
-    # @return [Boolean] Whether or not the sets are hashcode equal
-    def set_eql?(set1, set2)
-      return set1.eql?(set2) unless ruby1_8_6?
-      set1.to_a.uniq.sort_by {|e| e.hash}.eql?(set2.to_a.uniq.sort_by {|e| e.hash})
-    end
-
-    # Like `Object#inspect`, but preserves non-ASCII characters rather than escaping them under Ruby 1.9.2.
-    # This is necessary so that the precompiled Haml template can be `#encode`d into `@options[:encoding]`
-    # before being evaluated.
-    #
-    # @param obj {Object}
-    # @return {String}
-    def inspect_obj(obj)
-      return obj.inspect unless version_geq(::RUBY_VERSION, "1.9.2")
-      return ':' + inspect_obj(obj.to_s) if obj.is_a?(Symbol)
-      return obj.inspect unless obj.is_a?(String)
-      '"' + obj.gsub(/[\x00-\x7F]+/) {|s| s.inspect[1...-1]} + '"'
-    end
-
-    # Extracts the non-string vlaues from an array containing both strings and non-strings.
-    # These values are replaced with escape sequences.
-    # This can be undone using \{#inject\_values}.
-    #
-    # This is useful e.g. when we want to do string manipulation
-    # on an interpolated string.
-    #
-    # The precise format of the resulting string is not guaranteed.
-    # However, it is guaranteed that newlines and whitespace won't be affected.
-    #
-    # @param arr [Array] The array from which values are extracted.
-    # @return [(String, Array)] The resulting string, and an array of extracted values.
-    def extract_values(arr)
-      values = []
-      return arr.map do |e|
-        next e.gsub('{', '{{') if e.is_a?(String)
-        values << e
-        next "{#{values.count - 1}}"
-      end.join, values
-    end
-
-    # Undoes \{#extract\_values} by transforming a string with escape sequences
-    # into an array of strings and non-string values.
-    #
-    # @param str [String] The string with escape sequences.
-    # @param values [Array] The array of values to inject.
-    # @return [Array] The array of strings and values.
-    def inject_values(str, values)
-      return [str.gsub('{{', '{')] if values.empty?
-      # Add an extra { so that we process the tail end of the string
-      result = (str + '{{').scan(/(.*?)(?:(\{\{)|\{(\d+)\})/m).map do |(pre, esc, n)|
-        [pre, esc ? '{' : '', n ? values[n.to_i] : '']
-      end.flatten(1)
-      result[-2] = '' # Get rid of the extra {
-      merge_adjacent_strings(result).reject {|s| s == ''}
-    end
-
-    # Allows modifications to be performed on the string form
-    # of an array containing both strings and non-strings.
-    #
-    # @param arr [Array] The array from which values are extracted.
-    # @yield [str] A block in which string manipulation can be done to the array.
-    # @yieldparam str [String] The string form of `arr`.
-    # @yieldreturn [String] The modified string.
-    # @return [Array] The modified, interpolated array.
-    def with_extracted_values(arr)
-      str, vals = extract_values(arr)
-      str = yield str
-      inject_values(str, vals)
-    end
-
-    ## Static Method Stuff
-
-    # The context in which the ERB for \{#def\_static\_method} will be run.
-    class StaticConditionalContext
-      # @param set [#include?] The set of variables that are defined for this context.
-      def initialize(set)
-        @set = set
-      end
-
-      # Checks whether or not a variable is defined for this context.
-      #
-      # @param name [Symbol] The name of the variable
-      # @return [Boolean]
-      def method_missing(name, *args, &block)
-        super unless args.empty? && block.nil?
-        @set.include?(name)
-      end
-    end
-
-    private
-
-    # Calculates the memoization table for the Least Common Subsequence algorithm.
-    # Algorithm from [Wikipedia](http://en.wikipedia.org/wiki/Longest_common_subsequence_problem#Computing_the_length_of_the_LCS)
-    def lcs_table(x, y)
-      c = Array.new(x.size) {[]}
-      x.size.times {|i| c[i][0] = 0}
-      y.size.times {|j| c[0][j] = 0}
-      (1...x.size).each do |i|
-        (1...y.size).each do |j|
-          c[i][j] =
-            if yield x[i], y[j]
-              c[i-1][j-1] + 1
-            else
-              [c[i][j-1], c[i-1][j]].max
-            end
-        end
-      end
-      return c
-    end
-
-    # Computes a single longest common subsequence for arrays x and y.
-    # Algorithm from [Wikipedia](http://en.wikipedia.org/wiki/Longest_common_subsequence_problem#Reading_out_an_LCS)
-    def lcs_backtrace(c, x, y, i, j, &block)
-      return [] if i == 0 || j == 0
-      if v = yield(x[i], y[j])
-        return lcs_backtrace(c, x, y, i-1, j-1, &block) << v
-      end
-
-      return lcs_backtrace(c, x, y, i, j-1, &block) if c[i][j-1] > c[i-1][j]
-      return lcs_backtrace(c, x, y, i-1, j, &block)
-    end
-  end
-end