tnode 0.0.0 → 0.0.3

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: 93248f7cb8d5019ed4509edff46e1bc95d8ce593bfaa2f5358fcf87754257144
-  data.tar.gz: 03bb7c311605111f2c8f8ce93ae698548c942a7bd74db7e18ef0c082bc841212
+  metadata.gz: 31c82cfdf9d0b03e794553ada962ee3a1bed80421939bcaf455cb5d434c74f26
+  data.tar.gz: 329c673910cfe946af01c839e50add3bcbcfc83b2b3b2362876e1cdff7c54f20
 SHA512:
-  metadata.gz: d4c61cb15cb6396dbb67a1e655dfc86ea9b952033b2dfac7a8ba28f089ffaf361bcd3978d2ac62d6e876a98e5283393c495e8c51a5971026d785447557b8ec80
-  data.tar.gz: 788557d15716a52773be284d3171d0632a353a652a9fcba2cd965df36af064870e9298bd097bbe5e7addbd548d0b5ccb2ca9fba71f3686187a345a667fc054dc
+  metadata.gz: 8c7a9cbe1216ab6db072014ecf6e3e6ad0060b58b7ea49edff99f64ae3fa76538d7f3e1df4c1f4eda2fb236ff869bfe513462aa36601155f0b076275a8ffe02b
+  data.tar.gz: dc2aad78d813c103280d2170944535f71da7755293c559ae3f8d8bf8d93d42f5af121474be9c22b069e05f434a83cc62f1af8432bd5b43eb33d06383909d4c8e

data/lib/tnode.rb

@@ -1,43 +1,102 @@
 class Tnode
-  attr_accessor :data, :links
+  attr_accessor :data, :links, :trav_links
 
   def initialize(data)
     @data = data
     @links = []
+    @trav_links = []
   end
 
   def insert(data)
-    @links << Tnode.new(data)
+    new_node = Tnode.new(data)
+    @links << new_node
+    new_node.links << self
+  end
+
+  def init_trav_links
+    re_init_trav_links(nil)
+  end
+
+  def re_init_trav_links(parent)
+    @trav_links = links.clone
+    trav_links.delete(parent)
+    trav_links.each do |child|
+      child.trav_links.delete(self)
+      child.re_init_trav_links(self)
+    end
   end
 
   def traverse_dfs
+    init_trav_links
+    re_traverse_dfs
+  end
+
+  def re_traverse_dfs
     traverse_dfs_arr = [data]
-    unless links.empty?
-      links.each do |child|
-        traverse_dfs_arr += child.traverse_dfs
+    unless trav_links.empty?
+      trav_links.each do |child|
+        traverse_dfs_arr += child.re_traverse_dfs
       end
     end
     traverse_dfs_arr
   end
 
   def traverse_bfs
+    init_trav_links
     traverse_bfs_arr = [data]
-    @traverse_bfs_q = links.clone
+    @traverse_bfs_q = trav_links.clone
     until @traverse_bfs_q.empty?
       traverse_bfs_arr << @traverse_bfs_q.first.data
-      @traverse_bfs_q += @traverse_bfs_q.shift.links
+      @traverse_bfs_q += @traverse_bfs_q.shift.trav_links
     end
     traverse_bfs_arr
   end
 
+  def print_struct
+    init_trav_links
+    re_print_struct
+  end
+
+  # '├── '
+  # '│   '
+  # '└── '
+  # '    '
+  def re_print_struct(depth = 0, prefs = [])
+    puts data if depth == 0
+
+    # prefixes
+    trav_links.each_with_index do |child, i|
+      prefs.each do |pref|
+        print pref
+      end
+      if i == trav_links.size - 1 # is last?
+        prefs.push '    ' unless child.trav_links.empty? # has childs
+        print '└── '
+        puts child.data
+        child.re_print_struct(depth + 1, prefs) unless child.trav_links.empty?
+        prefs.pop
+      else
+        prefs.push '│   ' unless child.trav_links.empty? # has childs
+        print '├── '
+        puts child.data
+        child.re_print_struct(depth + 1, prefs) unless child.trav_links.empty?
+      end
+    end
+  end
+
   def tree_find(key_data)
+    init_trav_links
+    re_tree_find(key_data)
+  end
+
+  def re_tree_find(key_data)
     target_node = nil
     if key_data == data
       return self
     else
-      unless links.empty?
-        links.each do |child|
-          target_node = child.tree_find(key_data)
+      unless trav_links.empty?
+        trav_links.each do |child|
+          target_node = child.re_tree_find(key_data)
           return target_node unless target_node.nil?
         end
       end
@@ -47,21 +106,46 @@ class Tnode
   end
 
   def remove_node(key_data)
-    links.each do |child|
+    init_trav_links
+    re_remove_node(key_data)
+  end
+
+  def re_remove_node(key_data)
+    trav_links.each do |child|
       if child.data == key_data
         links.delete(child)
         return
       else
-        child.remove_node(key_data)
+        child.re_remove_node(key_data)
       end
     end
   end
 
-  def tree_apart(tnode)
-    traverse.intersection(tnode.traverse).empty?
+  def apart?(another)
+    traverse_dfs.intersection(another.traverse_dfs).empty?
+  end
+
+  def tree_inter(another)
+    traverse_dfs.intersection(another.traverse_dfs)
   end
 
   def insert_under(key_data, data)
     tree_find(key_data).insert(data)
   end
+
+  def insert_tnode_under(key_data, newnode)
+    tree_find(key_data).links << newnode
+    newnode.links << tree_find(key_data)
+  end
+
+  def merge(another)
+    internodes = tree_inter(another)
+    if internodes.count == 1
+      another.tree_find(internodes.first).data = nil
+      another.tree_find(nil).links.each do |child|
+        child.remove_node(nil)
+        insert_tnode_under(internodes.first, child)
+      end
+    end
+  end
 end

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: tnode
 version: !ruby/object:Gem::Version
-  version: 0.0.0
+  version: 0.0.3
 platform: ruby
 authors:
 - Rurika Misaka
 autorequire:
 bindir: bin
 cert_chain: []
-date: 2022-06-09 00:00:00.000000000 Z
+date: 2022-06-14 00:00:00.000000000 Z
 dependencies: []
 description: My data structure homework
 email: goblinmaiden1931@gmail.com
@@ -19,7 +19,7 @@ files:
 - lib/tnode.rb
 homepage:
 licenses:
-- GLWTPL
+- Nonstandard
 metadata: {}
 post_install_message:
 rdoc_options: []