object_tree 0.0.5

checksums.yaml

@@ -0,0 +1,15 @@
+---
+!binary "U0hBMQ==":
+  metadata.gz: !binary |-
+    MGM0NTg2ZTdmMTRlYzBjNjdkYjc1ZDcxOGM0MDUwM2JhOGZiZTYwNg==
+  data.tar.gz: !binary |-
+    YjQwYWEyYWI0MzFkODFmMjE3OGY0Mzk3NDRmZjZiOGFmOWY0MDczMQ==
+!binary "U0hBNTEy":
+  metadata.gz: !binary |-
+    OGFhNjI4YWI2Mjk0MDdlNWMwNmQwYWE1NjYxNzg0ZjMxMTgwMjJlMGMxYWM3
+    YjE3YWNlZmYzYzU5MjQwOGNhZmU3YzAzOTI1MzgxYmFmZDUzY2ZmOTMzMWU1
+    MDUzNDA3MmNiZDRjZWI3MDQzMDZlYWQxMzZjMGI4NzA2ODg1NjE=
+  data.tar.gz: !binary |-
+    M2RlNTEzZjY3NDhkZGU5MTFlNGQxNjlmOGUyNWM3MWY1ZTY5YWE2MjhjZjlj
+    MWRiODRmYTI0MjRhM2ZkNTcyOGM5NDNhZDA5MzE1OGY3ZDg5N2U2MjlhOWEy
+    Mjg1MDk4ODRmMGRkOTZlMTVhZGMxZDlmYTliYTQ2N2VjNDk4NDk=

data/.gitignore

@@ -0,0 +1,23 @@
+*.gem
+*.rbc
+.bundle
+.config
+.yardoc
+Gemfile.lock
+InstalledFiles
+_yardoc
+coverage
+doc/
+lib/bundler/man
+pkg
+rdoc
+spec/reports
+test/tmp
+test/version_tmp
+tmp
+
+**/*.swp
+*.swp
+**/*~
+*.*~
+*~

data/Gemfile

@@ -0,0 +1,4 @@
+source 'https://rubygems.org'
+
+# Specify your gem's dependencies in object_tree.gemspec
+gemspec

data/LICENSE.txt

@@ -0,0 +1,22 @@
+Copyright (c) 2013 siman-man
+
+MIT License
+
+Permission is hereby granted, free of charge, to any person obtaining
+a copy of this software and associated documentation files (the
+"Software"), to deal in the Software without restriction, including
+without limitation the rights to use, copy, modify, merge, publish,
+distribute, sublicense, and/or sell copies of the Software, and to
+permit persons to whom the Software is furnished to do so, subject to
+the following conditions:
+
+The above copyright notice and this permission notice shall be
+included in all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
+EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
+MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
+NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
+LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
+OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
+WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.

data/README.md

@@ -0,0 +1,32 @@
+# ObjectTree
+
+Rubyのオブジェクト関係をtreeっぽく表示
+
+## Installation
+
+Add this line to your application's Gemfile:
+
+    gem 'object_tree'
+
+And then execute:
+
+    $ bundle
+
+Or install it yourself as:
+
+    $ gem install object_tree
+
+## Usage
+
+Object以下のクラス関係を表示
+
+tree = ObjectTree::Tree.create(Object)
+tree.draw
+
+## Contributing
+
+1. Fork it
+2. Create your feature branch (`git checkout -b my-new-feature`)
+3. Commit your changes (`git commit -am 'Add some feature'`)
+4. Push to the branch (`git push origin my-new-feature`)
+5. Create new Pull Request

data/Rakefile

@@ -0,0 +1 @@
+require "bundler/gem_tasks"

data/example/sample.rb

@@ -0,0 +1,39 @@
+require 'object_tree'
+require 'active_record'
+
+module D
+end
+
+module E
+end
+
+module F
+end
+
+module G
+end
+
+class A 
+  prepend F
+end
+
+class H
+end
+
+class B < A
+  include D
+  include E
+  prepend G
+end
+
+class C < A
+  include E
+  include D
+end
+
+
+tree = ObjectTree::Tree.create(A)
+tree.draw
+
+tree = ObjectTree::Tree.create(A, true)
+tree.draw

data/example/sample.rb~

@@ -0,0 +1,39 @@
+require 'object_tree'
+require 'active_record'
+
+module D
+end
+
+module E
+end
+
+module F
+end
+
+module G
+end
+
+class A 
+  prepend F
+end
+
+class H
+end
+
+class B < A
+  include D
+  include E
+  prepend G
+end
+
+class C < A
+  include E
+  include D
+end
+
+
+tree = ObjectTree::Tree.create(BasicObject)
+tree.draw
+
+tree = ObjectTree::Tree.create(BasicObject, true)
+tree.draw

data/lib/object_tree/version.rb

@@ -0,0 +1,3 @@
+module ObjectTree
+  VERSION = "0.0.5"
+end

data/lib/object_tree.rb

@@ -0,0 +1,145 @@
+# encoding: utf-8
+require "object_tree/version"
+
+class Module
+  def prepended_modules
+    ancestors = self.ancestors
+    ancestors[0..ancestors.find_index(self)] - [self]
+  end
+end
+
+module ObjectTree
+  class Tree
+    attr_reader :tree
+    SPACE_SIZE = 6
+
+    # 31: red, 32: green, 33: yellow, 34: blue, 35: pink, 36: aqua, 37: gray
+    MCOLOR = 31
+    CCOLOR = 32
+
+    def initialize(klass, mflag = false)
+      @tree = Hash.new{|h, k| h[k] = [] }
+      @mflag = mflag
+      @root_class = klass
+
+      if klass == BasicObject
+        klass = Object
+        @tree[BasicObject] << Object
+      end
+
+      create_object_tree(object_list(klass))
+    end
+
+    class << self
+      alias :create :new
+    end
+
+    def singleton(klass)
+      class << klass; self end
+    end
+
+    def object_list(klass)
+      ObjectSpace.each_object(singleton(klass)) do |subclass| 
+        if klass != subclass
+          @tree[klass] << subclass
+          object_list(subclass) unless @tree.has_key?(subclass)
+        end
+      end
+
+      @tree
+    end
+
+    def create_object_tree(tree)
+      tree.each do |klass1, subclasses1|
+        tree.each do |klass2, subclasses2|
+          if klass1 > klass2
+            tree[klass1] -= (subclasses2 - [klass2])
+          end
+        end
+      end
+
+      tree
+    end
+
+    def draw
+      if @tree.size.zero? 
+        puts "\e[#{CCOLOR}m<C>\e[m#{@root_class}"
+      else
+        @last_check = []
+        draw_tree({ @root_class => @tree[@root_class] }, 0)
+      end
+    end
+
+    def draw_tree(tree, nest, root = true, last = false)
+
+      @last_check[nest-1] = last if nest > 0
+
+      tree.each do |klass, subclasses|
+        if ( @mflag && klass.kind_of?(Class) && !klass.superclass.nil? )
+          module_list = klass.ancestors[0..klass.ancestors.find_index(klass.superclass)-1].reverse - [klass, klass.superclass] - klass.prepended_modules
+
+          module_list.each_with_index do |m, add|
+            puts "\e[#{MCOLOR}m<M>\e[m#{m.inspect}"
+            @last_check[nest] = true
+
+            nest.times do |column_number|
+              print ((@last_check[column_number])? "  " : "│ ") + " " * SPACE_SIZE
+            end
+            print "└─ ─ ── "
+            nest += 1
+          end
+        end
+
+        puts ( klass.kind_of?(Class) )? "\e[#{CCOLOR}m<C>\e[m#{klass.inspect}" : "\e[#{MCOLOR}m<M>\e[m#{klass.inspect}"
+
+        subclasses.each do |sub|
+          @last_check[nest] = true if sub == subclasses.last
+
+          nest.times do |column_number|
+            print ((@last_check[column_number])? "  " : "│ ") + " " * SPACE_SIZE
+          end
+
+          if @tree.has_key?(sub)
+            print ( sub == subclasses.last )? "└─ ─ ── " : "├─ ─ ── "
+            if sub == subclasses.last
+              draw_tree({ sub => @tree[sub]}, nest + 1, false, true)
+            else
+              draw_tree({ sub => @tree[sub]}, nest + 1, false, false)
+            end
+          else
+            print ( sub == subclasses.last )? "└─ ─ ── " : "├─ ─ ── "
+            nest_count = 0
+            if( @mflag && sub.kind_of?(Class) ) 
+              module_list = sub.ancestors[0..sub.ancestors.find_index(klass)-1].reverse - ([sub, klass] + sub.prepended_modules)
+              @last_check[nest] = ( sub == subclasses.last )? true : false
+
+              module_list.each_with_index do |m, add|
+                puts "\e[#{MCOLOR}m<M>\e[m#{m.inspect}"
+                @last_check[nest+add+1] = true
+
+                (nest+add+1).times do |column_number|
+                  print ((@last_check[column_number])? "  " : "│ ") + " " * SPACE_SIZE
+                end
+                print "└─ ─ ── "
+                nest_count += 1
+              end
+            end
+            puts ( sub.kind_of?(Class) )? "\e[#{CCOLOR}m<C>\e[m#{sub.inspect}" : "\e[#{MCOLOR}m<M>\e[m#{sub.inspect}"
+
+            if ( @mflag && sub.kind_of?(Class) )
+              prepended_modules = sub.prepended_modules
+
+              prepended_modules.each_with_index do |m, add|
+                (nest+nest_count+add+1).times do |column_number|
+                  print ((@last_check[column_number])? "  " : "│ ") + " " * SPACE_SIZE
+                end
+                puts "└─ ─ ── \e[#{MCOLOR}m<M>\e[m#{m.inspect}"
+                @last_check[nest+add+1] = true
+              end
+            end
+          end
+        end
+      end
+    end
+  end
+end

data/lib/object_tree.rb~

@@ -0,0 +1,145 @@
+# encoding: utf-8
+require "object_tree/version"
+
+class Module
+  def prepended_modules
+    ancestors = self.ancestors
+    ancestors[0..ancestors.find_index(self)] - [self]
+  end
+end
+
+module ObjectTree
+  class Tree
+    attr_reader :tree
+    SPACE_SIZE = 6
+
+    # 31: red, 32: green, 33: yellow, 34: blue, 35: pink, 36: aqua, 37: gray
+    MCOLOR = 31
+    CCOLOR = 32
+
+    def initialize(klass, mflag = false)
+      @tree = Hash.new{|h, k| h[k] = [] }
+      @mflag = mflag
+      @root_class = klass
+
+      if klass == BasicObject
+        klass = Object
+        @tree[BasicObject] << Object
+      end
+
+      create_object_tree(object_list(klass))
+    end
+
+    class << self
+      alias :create :new
+    end
+
+    def singleton(klass)
+      class << klass; self end
+    end
+
+    def object_list(klass)
+      ObjectSpace.each_object(singleton(klass)) do |subclass| 
+        if klass != subclass
+          @tree[klass] << subclass
+          object_list(subclass) unless @tree.has_key?(subclass)
+        end
+      end
+
+      @tree
+    end
+
+    def create_object_tree(tree)
+      tree.each do |klass1, subclasses1|
+        tree.each do |klass2, subclasses2|
+          if klass1 > klass2
+            tree[klass1] -= (subclasses2 - [klass2])
+          end
+        end
+      end
+
+      tree
+    end
+
+    def draw
+      if @tree.size.zero? 
+        puts "\e[#{CCOLOR}m<C>\e[m#{@root_class}"
+      else
+        @last_check = []
+        draw_tree({ @root_class => @tree.first.last }, 0)
+      end
+    end
+
+    def draw_tree(tree, nest, root = true, last = false)
+
+      @last_check[nest-1] = last if nest > 0
+
+      tree.each do |klass, subclasses|
+        if ( @mflag && klass.kind_of?(Class) && !klass.superclass.nil? )
+          module_list = klass.ancestors[0..klass.ancestors.find_index(klass.superclass)-1].reverse - [klass, klass.superclass] - klass.prepended_modules
+
+          module_list.each_with_index do |m, add|
+            puts "\e[#{MCOLOR}m<M>\e[m#{m.inspect}"
+            @last_check[nest] = true
+
+            nest.times do |column_number|
+              print ((@last_check[column_number])? "  " : "│ ") + " " * SPACE_SIZE
+            end
+            print "└─ ─ ── "
+            nest += 1
+          end
+        end
+
+        puts ( klass.kind_of?(Class) )? "\e[#{CCOLOR}m<C>\e[m#{klass.inspect}" : "\e[#{MCOLOR}m<M>\e[m#{klass.inspect}"
+
+        subclasses.each do |sub|
+          @last_check[nest] = true if sub == subclasses.last
+
+          nest.times do |column_number|
+            print ((@last_check[column_number])? "  " : "│ ") + " " * SPACE_SIZE
+          end
+
+          if @tree.has_key?(sub)
+            print ( sub == subclasses.last )? "└─ ─ ── " : "├─ ─ ── "
+            if sub == subclasses.last
+              draw_tree({ sub => @tree[sub]}, nest + 1, false, true)
+            else
+              draw_tree({ sub => @tree[sub]}, nest + 1, false, false)
+            end
+          else
+            print ( sub == subclasses.last )? "└─ ─ ── " : "├─ ─ ── "
+            nest_count = 0
+            if( @mflag && sub.kind_of?(Class) ) 
+              module_list = sub.ancestors[0..sub.ancestors.find_index(klass)-1].reverse - ([sub, klass] + sub.prepended_modules)
+              @last_check[nest] = ( sub == subclasses.last )? true : false
+
+              module_list.each_with_index do |m, add|
+                puts "\e[#{MCOLOR}m<M>\e[m#{m.inspect}"
+                @last_check[nest+add+1] = true
+
+                (nest+add+1).times do |column_number|
+                  print ((@last_check[column_number])? "  " : "│ ") + " " * SPACE_SIZE
+                end
+                print "└─ ─ ── "
+                nest_count += 1
+              end
+            end
+            puts ( sub.kind_of?(Class) )? "\e[#{CCOLOR}m<C>\e[m#{sub.inspect}" : "\e[#{MCOLOR}m<M>\e[m#{sub.inspect}"
+
+            if ( @mflag && sub.kind_of?(Class) )
+              prepended_modules = sub.prepended_modules
+
+              prepended_modules.each_with_index do |m, add|
+                (nest+nest_count+add+1).times do |column_number|
+                  print ((@last_check[column_number])? "  " : "│ ") + " " * SPACE_SIZE
+                end
+                puts "└─ ─ ── \e[#{MCOLOR}m<M>\e[m#{m.inspect}"
+                @last_check[nest+add+1] = true
+              end
+            end
+          end
+        end
+      end
+    end
+  end
+end

data/object_tree.gemspec

@@ -0,0 +1,23 @@
+# coding: utf-8
+lib = File.expand_path('../lib', __FILE__)
+$LOAD_PATH.unshift(lib) unless $LOAD_PATH.include?(lib)
+require 'object_tree/version'
+
+Gem::Specification.new do |spec|
+  spec.name          = "object_tree"
+  spec.version       = ObjectTree::VERSION
+  spec.authors       = ["siman-man"]
+  spec.email         = ["k128585@ie.u-ryukyu.ac.jp"]
+  spec.description   = "this is object tree"
+  spec.summary       = "hoge piyo"
+  spec.homepage      = ""
+  spec.license       = "MIT"
+
+  spec.files         = `git ls-files`.split($/)
+  spec.executables   = spec.files.grep(%r{^bin/}) { |f| File.basename(f) }
+  spec.test_files    = spec.files.grep(%r{^(test|spec|features)/})
+  spec.require_paths = ["lib"]
+
+  spec.add_development_dependency "bundler", "~> 1.3"
+  spec.add_development_dependency "rake"
+end

metadata

@@ -0,0 +1,83 @@
+--- !ruby/object:Gem::Specification
+name: object_tree
+version: !ruby/object:Gem::Version
+  version: 0.0.5
+platform: ruby
+authors:
+- siman-man
+autorequire: 
+bindir: bin
+cert_chain: []
+date: 2013-09-19 00:00:00.000000000 Z
+dependencies:
+- !ruby/object:Gem::Dependency
+  name: bundler
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - ~>
+      - !ruby/object:Gem::Version
+        version: '1.3'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - ~>
+      - !ruby/object:Gem::Version
+        version: '1.3'
+- !ruby/object:Gem::Dependency
+  name: rake
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - ! '>='
+      - !ruby/object:Gem::Version
+        version: '0'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - ! '>='
+      - !ruby/object:Gem::Version
+        version: '0'
+description: this is object tree
+email:
+- k128585@ie.u-ryukyu.ac.jp
+executables: []
+extensions: []
+extra_rdoc_files: []
+files:
+- .gitignore
+- Gemfile
+- LICENSE.txt
+- README.md
+- Rakefile
+- example/sample.rb
+- example/sample.rb~
+- lib/object_tree.rb
+- lib/object_tree.rb~
+- lib/object_tree/version.rb
+- object_tree.gemspec
+homepage: ''
+licenses:
+- MIT
+metadata: {}
+post_install_message: 
+rdoc_options: []
+require_paths:
+- lib
+required_ruby_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - ! '>='
+    - !ruby/object:Gem::Version
+      version: '0'
+required_rubygems_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - ! '>='
+    - !ruby/object:Gem::Version
+      version: '0'
+requirements: []
+rubyforge_project: 
+rubygems_version: 2.0.3
+signing_key: 
+specification_version: 4
+summary: hoge piyo
+test_files: []