public
Description: HTML Abstraction Markup Language - A Markup Haiku
Homepage: http://haml.hamptoncatlin.com
Clone URL: git://github.com/nex3/haml.git
css2sass compatibility with new Node constructor.
nex3 (author)
Tue Aug 12 18:35:16 -0700 2008
commit  b8388bad0032da23451d50208da9a33ba29211c4
tree    e277dc34fc746ff2c897c0f5f8273469573c758c
parent  4f41cf00fcb59e9b80c911a4b2e742970870a3eb
...
130
131
132
133
 
134
135
136
...
154
155
156
157
 
158
159
160
...
165
166
167
168
 
169
170
171
...
188
189
190
191
 
192
193
194
...
236
237
238
239
 
240
241
242
...
282
283
284
285
 
286
287
288
...
130
131
132
 
133
134
135
136
...
154
155
156
 
157
158
159
160
...
165
166
167
 
168
169
170
171
...
188
189
190
 
191
192
193
194
...
236
237
238
 
239
240
241
242
...
282
283
284
 
285
286
287
288
0
@@ -130,7 +130,7 @@ module Sass
0
     private
0
 
0
     def build_tree
0
- root = Tree::Node.new(nil)
0
+ root = Tree::Node.new({})
0
       whitespace
0
       directives root
0
       rules root
0
@@ -154,7 +154,7 @@ module Sass
0
           value = $2
0
         end
0
 
0
- root << Tree::ValueNode.new("@#{name} #{value};", nil)
0
+ root << Tree::ValueNode.new("@#{name} #{value};", {})
0
       end
0
     end
0
 
0
@@ -165,7 +165,7 @@ module Sass
0
         whitespace
0
 
0
         if @template.scan(/\{/)
0
- result = Tree::RuleNode.new(rules.join(' '), nil)
0
+ result = Tree::RuleNode.new(rules.join(' '), {})
0
           root << result
0
           rules = []
0
 
0
@@ -188,7 +188,7 @@ module Sass
0
         end
0
 
0
         assert_match /(;|(?=\}))/
0
- rule << Tree::AttrNode.new(name, value, nil)
0
+ rule << Tree::AttrNode.new(name, value, {})
0
       end
0
 
0
       assert_match /\}/
0
@@ -236,7 +236,7 @@ module Sass
0
       root.children.map! do |child|
0
         next child unless Tree::RuleNode === child && child.rule.include?(',')
0
         child.rule.split(',').map do |rule|
0
- node = Tree::RuleNode.new(rule, nil)
0
+ node = Tree::RuleNode.new(rule, {})
0
           node.children = child.children
0
           node
0
         end
0
@@ -282,7 +282,7 @@ module Sass
0
       root.children.select { |c| Tree::RuleNode === c }.each do |child|
0
         root.children.delete child
0
         first, rest = child.rule.scan(/^(&?(?: .|[^ ])[^.#: \[]*)([.#: \[].*)?$/).first
0
- rules[first] ||= Tree::RuleNode.new(first, nil)
0
+ rules[first] ||= Tree::RuleNode.new(first, {})
0
         if rest
0
           child.rule = "&" + rest
0
           rules[first] << child

Comments

    No one has commented yet.