line-tree 0.2.7 → 0.3.0

data/lib/line-tree.rb

@@ -1,84 +1,31 @@
-require 'rexml/document'
+#!/usr/bin/ruby
 
-class LineTree
-  include REXML
+# file: line-tree.rb
 
-  def initialize(lines)
-    @lines = lines
-    a = lines.split(/\r?\n|\r(?!\n)/)
-    pattern = %r((\s+)?(.*))
-    a.map!{|x| x.match(pattern).captures}
+class LineTree  
 
-    new_a, history = [], []
-    history << new_a
-    build_tree(a, new_a, 0, history)
-    @a = new_a
+  def initialize(lines)
+    @a = scan_shift(lines)
   end
 
   def to_a()
     @a
   end
 
-  def to_xml()
-    
-    a = @lines.split(/\r?\n|\r(?!\n)/)
-    pattern = %r((\s+)?(((\/|.)[^\s]+)\s)?([^$]+))
-    a.map!{|x| x.match(pattern).captures.values_at(0,2,4)}
-
-    new_a, history = [], []
-    history << new_a
-    build_tree(a, new_a, 0, history)
-        
-    doc = Document.new '<root/>'
-    scan_line doc.root, new_a       
-    doc.to_s
-  end
-
   private
 
-  def build_tree(a, new_a, prev_indent, history=[])
-    if a.length > 0 then
-      x = a.shift
-      n = x.shift
-      cur_indent = n ? n.length : 0
-      indent, xr = build_branch(a, new_a, cur_indent, prev_indent, x, history )
-
-      if xr then
-        cur_indent, xr = build_branch(a, history[-1] || new_a, indent, prev_indent, xr, history ) 
-        return [cur_indent, xr] if xr
+  def scan_shift(lines)
+    a = lines.split(/^\b/)
+    a.map do |x|
+      rlines = x.split(/\n/)
+      label = [rlines.shift]
+      new_lines = rlines.map{|x| x[2..-1]}
+      if new_lines.length > 1 then
+        label + scan_shift(new_lines.join("\n")) 
+      else
+        new_lines.length > 0 ? label + [new_lines] : label
       end
     end
   end
 
-  def build_branch(a, new_a, cur_indent, prev_indent, x, history=[])
-    if cur_indent > prev_indent then
-      new_a = history[-1]
-      new_inner_a = [x]
-      new_a << new_inner_a
-      history << new_inner_a
-      build_tree(a, history[-2], cur_indent, history)
-    elsif cur_indent == prev_indent then
-      history.pop unless history.length <= 1
-      new_a = history[-1] if history[-1]
-      new_inner_a = [x]
-      new_a << new_inner_a
-      history << new_inner_a
-      build_tree(a, new_inner_a, cur_indent, history)
-    else
-      # revert to the earlier new_a
-      history.pop unless history.length <= 1
-      return [cur_indent, x]
-    end
-  end
-
-  def scan_line(node, a)
-    a.each do |x|
-      name, text = x.shift.compact
-      element = Element.new(name.gsub(/^[^a-zA-Z][^a-zA-Z0-9]?/,''))
-      element.add_text text
-      scan_line(element, x) unless x.empty?
-      node.add element
-    end
-  end
-
 end

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification 
 name: line-tree
 version: !ruby/object:Gem::Version 
-  version: 0.2.7
+  version: 0.3.0
 platform: ruby
 authors: []
 
@@ -9,7 +9,7 @@ autorequire:
 bindir: bin
 cert_chain: []
 
-date: 2010-05-24 00:00:00 +01:00
+date: 2010-06-06 00:00:00 +01:00
 default_executable: 
 dependencies: []