mindwords 0.1.0 → 0.3.1

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: f4d617b7606074c5392810716b83f5ea18a45bd2f9bcbc3cbd3c8264c4efda15
-  data.tar.gz: 77459002b1868120333d8d173ef7012db25e29b977a265dd60f85405825a377b
+  metadata.gz: 6221b29c92e35c56991faead9b0065df928bb5ce5664f9511ad36a41b9382e9c
+  data.tar.gz: 9aefdce231368e36caf338567b5b8063a12e12c5468a5bd92c7395db04ff28bc
 SHA512:
-  metadata.gz: f9bafe174e81786a07e60e1665116f5c9fd0c966642322bddf5f9898f95ce5474d1a3ec80573ed6a0056751e63cbf1e13210610459db5d8b85d77865db0daa39
-  data.tar.gz: 6aedd18fb09a55aa78b3cc2c7c59db08edca77a2ed5e47c1049bb5bd069d34f1d4b5438fb36367d35a4ae9c91c5ec4970eb975eebfe3b0c286982f322b2b16b9
+  metadata.gz: cf7874e88c03ae3148102bf2ad8ecc539502c16bd620208303f54ea750262b9041de7c97b4c5bbf90b0aaf33a381f935b03be9228b1131be467c314bbd6b8344
+  data.tar.gz: d98408eab67356ef1312e3464ec671a381d149e7d2584ab63df6c87e4098d22c59e032dc360cd819fca2cd74d94071a5a8e400f4f87616e058f6f59a4b467c25

data/lib/mindwords.rb

@@ -3,32 +3,51 @@
 # file: mindwords.rb
 
 require 'rexle'
+require 'line-tree'
 
-class MindWords
+module HashCopy
+  refine Hash do
+    
+    def deep_clone()
+      Marshal.load(Marshal.dump(self))
+    end
+    
+  end
+end
 
-  def initialize(s, debug: false)
+class MindWords
+  using ColouredText
+  using HashCopy
+  
+  
+  def initialize(s, parent: nil, debug: false)
 
     @debug = debug
-
-    lines = s.strip.lines.map do |line|
+    @a = s.strip.gsub(/^\n/,'').lines
+    @a.shift if @a.first =~ /<\?mindwords\?>/
+    
+    lines = @a.map do |line|
 
       word = line.split(/ (?=#)/,2)
 
     end
-
+    
     h = {}
+    @hashtags = {}
 
-    lines.each do |x|
+    lines.each do |title, rawtags|
 
-      x.last.scan(/#(\w+)/).flatten(1).each do |rawtag|
+      rawtags.scan(/#(\w+)/).flatten(1).each do |rawtag|
         tag = rawtag.gsub(/ +/, '_')
         h[tag] ||= []
-        h[tag] << x.first
+        h[tag] << title
       end
 
     end
+    
+    @hashtags = h.deep_clone.sort.map {|tag, fields| [tag, fields.sort]}.to_h
 
-    # does the key exist as a field?
+    # does the key exist as a field? Nesting of hash object is performed here.
 
     h.keys.each do |key|
 
@@ -41,30 +60,16 @@ class MindWords
 
     end
 
+    @h = h
+    
     a = rexlize(h)
     doc = Rexle.new(['root', {}, '', *a])
 
-    duplicates = []
-    doc.root.each_recursive do |e|
-
-      puts 'e: ' + e.name.inspect if @debug
-      rows = e.parent.xpath('//' + e.name)
-      next if rows.length < 2
-
-      rows[1..-1].each do |e2|
-        puts 'e2: ' + e2.name.inspect if @debug
-        duplicates << [e.backtrack.to_s, e2.backtrack.to_s] #unless e2.has_elements?
-      end
-    end
-
-    duplicates.each do |path, oldpath| 
-      e = doc.element(path);
-      e2 = doc.element(oldpath);  
-      e2.parent.add e
-      e2.delete
-    end   
-
-    # remove redundant nodes
+    
+    # remove duplicates which appear in the same branch above the nested node
+    rm_duplicates(doc)
+    
+    # remove redundant nodes (outsiders)
     # a redundant node is where all children exist in existing nested nodes
 
     redundants = doc.root.elements.map do |e|
@@ -78,13 +83,138 @@ class MindWords
     end
 
     redundants.compact.each {|x| doc.element(x).delete }
+    rm_duplicates(doc)
+    
+    node = if parent then
+      found = doc.root.element('//' + parent)
+      found ? found : doc.root
+    else
+      doc.root
+    end
+    
+    @outline = treeize node
+    
+    node.root.each_recursive do |e|
+    
+      e.attributes[:id] = e.attributes[:title].downcase.gsub(/ +/,'-')      
+      
+      s = e.parent.attributes[:breadcrumb] ? \
+          e.parent.attributes[:breadcrumb].to_s  + ' / ' : ''
+      e.attributes[:breadcrumb] = s +  e.value.strip
+      
+      r = @a.grep(/^#{e.attributes[:title]} #/i)
+      next unless r.any?
+      e.attributes[:hashtags] = r[0].scan(/(?<=#)\w+/).join(' ')
+
+      
+    end
+    
+    @xml = node.xml pretty: true
+    
+  end
+  
+  def element(id)
+    
+    doc = Rexle.new(@xml)
+    e =  doc.root.element("//*[@id='#{id}']")
+    #e.attributes[:breadcrumb].to_s if e
+    
+  end  
+  
+  def search(keyword)
+    
+    a = @a.grep(/#{keyword}/i).map do |line|
+      
+      puts 'line: ' + line.inspect if @debug
+      
+      words = line.split
+      r = words.grep /#{keyword}/i
+      i = words.index r[0]
+      
+      [line, i]
+      
+    end
+    
+    return nil if a.empty?
+    #return a[0][0] if a.length < 2
 
-    @outline = treeize doc.root
+    a2 = a.sort_by(&:last).map(&:first)
+    puts 'a2: ' + a2.inspect if @debug
+    MindWords.new(a2.join, parent: keyword, debug: @debug)
+    
+  end
+  
+  def sort()
+    s = @a.sort.join
+    
+    def s.to_s()
+      self.lines.map do |x|
+        title, hashtags = x.split(/(?=#)/,2)
+        title + hashtags.chomp.brown
+      end.join("\n")
+    end    
+    
+    return s
+  end
+  
+  def sort!()
+    @a = sort().lines
+    self
+  end
+  
+  def tag_sort()
+    
+    h = @a.group_by  {|x| x[/#\w+/]}    
+    s = h.sort.map {|key, value| value.sort }.join
+    
+    def s.to_s()
+      self.lines.map do |x|
+        title, hashtags = x.split(/(?=#)/,2)
+        title + hashtags.chomp.brown
+      end.join("\n")
+    end
+    
+    return s
     
   end
+  
+  def tag_sort!()
+    @a = tag_sort().lines
+    self
+  end
+  
+  def to_h()
+    @h
+  end
+  
+  def to_hashtags()
+    @hashtags
+  end
 
-  def to_outline()
-    @outline
+  def to_outline(sort: true)
+    sort ? a2tree(tree_sort(LineTree.new(@outline).to_a)) : @outline
+  end
+  
+  def to_s(colour: false)
+    
+    header = "<?mindwords?>\n\n"
+    return header + @a.join unless colour
+    
+    body = @a.map do |x|
+        title, hashtags = x.split(/(?=#)/,2)
+        title + hashtags.chomp.brown
+    end.join("\n")
+    
+    header + body
+    
+  end
+  
+  def to_words()
+    to_outline.lines.map {|x| x[/\w[\w ]+/] }
+  end
+  
+  def to_xml()
+    @xml
   end
 
   private
@@ -97,15 +227,45 @@ class MindWords
 
       case x
       when String
-        [x.gsub(/ +/,'_'),  {}, x]
+        [x.gsub(/ +/,'_'),  {title: x}, x]
       when Hash
-        [x.keys.first, {}, x.keys.first.gsub(/_/,' '), *rexlize(x.values.first)]
+        [
+          x.keys.first.gsub(/_/,' '), 
+          {title: x.keys.first}, 
+          x.keys.first,
+         *rexlize(x.values.first)
+        ]
       when Array
-        [x.first, {}, x.first.gsub(/_/,' '), *rexlize(x.last)]
+        [x.first.gsub(/_/,' '), {title: x.first}, x.first, *rexlize(x.last)]
       end
     end
 
   end
+  
+  def rm_duplicates(doc)
+    
+    duplicates = []
+    doc.root.each_recursive do |e|
+
+      puts 'e: ' + e.name.inspect if @debug
+      rows = e.parent.xpath('//' + e.name)
+      next if rows.length < 2
+
+      rows[1..-1].each do |e2|
+        puts 'e2: ' + e2.name.inspect if @debug
+        duplicates << [e.backtrack.to_s, e2.backtrack.to_s]
+      end
+    end
+
+    duplicates.each do |path, oldpath| 
+      e = doc.element(path);
+      e2 = doc.element(oldpath);  
+      next unless e2
+      e2.parent.add e
+      e2.delete
+    end   
+
+  end
 
   def treeize(node, indent=0)
 
@@ -121,6 +281,27 @@ class MindWords
 
     lines.join
   end
+  
+  def tree_sort(a)
+
+    if a.first.is_a? Array then
+      a.sort_by(&:first).map {|x|  tree_sort(x) }
+    elsif a.any?
+      [a.first] + tree_sort(a[1..-1])
+    else
+      []
+    end
+  end
+
+  def a2tree(a, indent=0)
+
+    a.map do |row|
+      title, *remaining = row
+      children = remaining ? a2tree(remaining, indent+1) : ''
+      ('  ' * indent) + title + "\n" + children
+    end.join
+
+  end  
 
 end
 

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification
 name: mindwords
 version: !ruby/object:Gem::Version
-  version: 0.1.0
+  version: 0.3.1
 platform: ruby
 authors:
 - James Robertson
@@ -35,28 +35,28 @@ cert_chain:
   aWH7D2AmhOpqNwWnPHzWR/yzpigAVTrvpHfRxZleQj6Z/090nIH2KR0RdioMmPFq
   3+574KQzs/gR9Y5a+iMcvHRN
   -----END CERTIFICATE-----
-date: 2021-01-06 00:00:00.000000000 Z
+date: 2021-01-20 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
-  name: rexle
+  name: line-tree
   requirement: !ruby/object:Gem::Requirement
     requirements:
     - - "~>"
       - !ruby/object:Gem::Version
-        version: '1.5'
+        version: '0.9'
     - - ">="
       - !ruby/object:Gem::Version
-        version: 1.5.9
+        version: 0.9.1
   type: :runtime
   prerelease: false
   version_requirements: !ruby/object:Gem::Requirement
     requirements:
     - - "~>"
       - !ruby/object:Gem::Version
-        version: '1.5'
+        version: '0.9'
     - - ">="
       - !ruby/object:Gem::Version
-        version: 1.5.9
+        version: 0.9.1
 description: 
 email: digital.robertson@gmail.com
 executables: []