sass 3.2.0.alpha.75 → 3.2.0.alpha.76

data/REVISION

@@ -1 +1 @@
-b551f92303175e7651794dcf5a70f6148042bf69
+02ece03560e12575005f7583a43d4e999823447d

data/VERSION

@@ -1 +1 @@
-3.2.0.alpha.75
+3.2.0.alpha.76

data/lib/sass/scss/parser.rb

@@ -835,11 +835,11 @@ MESSAGE
         @strs.pop
       end
 
-      def str?
+      def str?(&block)
         pos = @scanner.pos
         line = @line
         @strs.push ""
-        throw_error {yield} && @strs.last
+        throw_error(&block) && @strs.last
       rescue Sass::SyntaxError => e
         @scanner.pos = pos
         @line = line

data/lib/sass/tree/node.rb

@@ -159,9 +159,9 @@ module Sass
       #
       # @yield node
       # @yieldparam node [Node] a node in the tree
-      def each
+      def each(&block)
         yield self
-        children.each {|c| c.each {|n| yield n}}
+        children.each {|c| c.each(&block)}
       end
 
       # Converts a node to Sass code that will generate it.

data/lib/sass/tree/visitors/check_nesting.rb

@@ -143,9 +143,9 @@ class Sass::Tree::Visitors::CheckNesting < Sass::Tree::Visitors::Base
     return false
   end
 
-  def try_send(method, *args)
+  def try_send(method, *args, &block)
     return unless respond_to?(method)
-    send(method, *args)
+    send(method, *args, &block)
   end
 end
 

data/lib/sass/util.rb

@@ -212,11 +212,11 @@ module Sass
     # @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)
+    def lcs(x, y, &block)
       x = [nil, *x]
       y = [nil, *y]
       block ||= proc {|a, b| a == b && a}
-      lcs_backtrace(lcs_table(x, y) {|a, b| yield a, b}, x, y, x.size-1, y.size-1) {|a, b| yield a, b}
+      lcs_backtrace(lcs_table(x, y, &block), x, y, x.size-1, y.size-1, &block)
     end
 
     # Converts a Hash to an Array. This is usually identical to `Hash#to_a`,
@@ -763,14 +763,14 @@ MSG
 
     # 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)
+    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) {|a, b| yield a, b} << v
+        return lcs_backtrace(c, x, y, i-1, j-1, &block) << v
       end
 
-      return lcs_backtrace(c, x, y, i, j-1) {|a, b| yield a, b} if c[i][j-1] > c[i-1][j]
-      return lcs_backtrace(c, x, y, i-1, j) {|a, b| yield a, b}
+      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

metadata

@@ -1,15 +1,15 @@
 --- !ruby/object:Gem::Specification 
 name: sass
 version: !ruby/object:Gem::Version 
-  hash: 592302987
+  hash: 592302981
   prerelease: 6
   segments: 
   - 3
   - 2
   - 0
   - alpha
-  - 75
-  version: 3.2.0.alpha.75
+  - 76
+  version: 3.2.0.alpha.76
 platform: ruby
 authors: 
 - Nathan Weizenbaum
@@ -151,7 +151,6 @@ files:
 - lib/sass/tree/root_node.rb
 - lib/sass/tree/rule_node.rb
 - lib/sass/tree/content_node.rb
-- lib/sass/tree/trace_node.rb
 - lib/sass/tree/variable_node.rb
 - lib/sass/tree/visitors/base.rb
 - lib/sass/tree/visitors/check_nesting.rb
@@ -163,6 +162,7 @@ files:
 - lib/sass/tree/visitors/to_css.rb
 - lib/sass/tree/warn_node.rb
 - lib/sass/tree/while_node.rb
+- lib/sass/tree/trace_node.rb
 - lib/sass/media.rb
 - lib/sass/util/multibyte_string_scanner.rb
 - lib/sass/util/subset_map.rb