graph 1.0.0

data/.autotest

@@ -0,0 +1,23 @@
+# -*- ruby -*-
+
+require 'autotest/restart'
+
+# Autotest.add_hook :initialize do |at|
+#   at.extra_files << "../some/external/dependency.rb"
+#
+#   at.libs << ":../some/external"
+#
+#   at.add_exception 'vendor'
+#
+#   at.add_mapping(/dependency.rb/) do |f, _|
+#     at.files_matching(/test_.*rb$/)
+#   end
+#
+#   %w(TestA TestB).each do |klass|
+#     at.extra_class_map[klass] = "test/test_misc.rb"
+#   end
+# end
+
+# Autotest.add_hook :run_command do |at|
+#   system "rake build"
+# end

data/History.txt

@@ -0,0 +1,6 @@
+=== 1.0.0 / 2009-03-27
+
+* 1 major enhancement
+
+  * Birthday!
+

data/Manifest.txt

@@ -0,0 +1,11 @@
+.autotest
+History.txt
+Manifest.txt
+README.txt
+Rakefile
+bin/graph
+lib/freebsd_analyzer.rb
+lib/graph.rb
+lib/macports_analyzer.rb
+lib/rubygems_analyzer.rb
+test/test_graph.rb

data/README.txt

@@ -0,0 +1,68 @@
+= graph
+
+* http://rubyforge.org/projects/seattlerb
+
+== DESCRIPTION:
+
+Graph is a type of hash that outputs in graphviz's dot format. It
+comes with a command-line interface that is easily pluggable.
+
+It ships with plugins to graph dependencies and status of installed
+rubygems, mac ports, and freebsd ports, coloring leaf nodes blue,
+outdated nodes red, and outdated leaf nodes purple (red+blue).
+
+== FEATURES/PROBLEMS:
+
+* Very easy hash interface.
+* Saves to dot and automatically converts to png (or whatever).
+* edge and node attributes are easy to set.
+* bin/graph includes a caching mechanism for slower fairly static data.
+
+== SYNOPSIS:
+
+    deps = Graph.new
+    
+    ObjectSpace.each_object Class do |mod|
+      next if mod.name =~ /Errno/
+      next unless mod < Exception
+      deps[mod.to_s] = mod.superclass.to_s
+    end
+    
+    deps.attribs["StandardError"] << "color = blue"
+    deps.attribs["RuntimeError"]  << "color = red"
+    deps.prefix << "rankdir = BT" # put Exception on top
+    
+    deps.save "exceptions"
+
+== REQUIREMENTS:
+
+* hoe
+
+== INSTALL:
+
+* sudo gem install graph
+
+== LICENSE:
+
+(The MIT License)
+
+Copyright (c) 2009 Ryan Davis, seattle.rb
+
+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/Rakefile

@@ -0,0 +1,12 @@
+# -*- ruby -*-
+
+require 'rubygems'
+require 'hoe'
+require './lib/graph.rb'
+
+Hoe.new('graph', Graph::VERSION) do |p|
+  p.rubyforge_name = 'seattlerb'
+  p.developer('Ryan Davis', 'ryand-ruby@zenspider.com')
+end
+
+# vim: syntax=Ruby

data/bin/graph

@@ -0,0 +1,149 @@
+#!/usr/bin/env ruby -w
+
+require 'graph'
+require 'set'
+require 'tsort'
+
+class Cache
+  def initialize(cache, timeout=24)
+    @cache = cache
+    @timeout = timeout
+  end
+
+  def cache(id, timeout=@timeout)
+    Dir.mkdir @cache unless test ?d, @cache
+    path = File.join @cache, id
+
+    age = test(?f, path) ? (Time.now - test( ?M, path )) / 3600 : -1
+
+    if age >= 0 and timeout > age then
+      warn "from cache" if $DEBUG
+      data = File.read(path)
+    else
+      warn "NOT from cache (#{age} hours old)" if $DEBUG
+      data = yield
+      File.open(path, "w") do |f|
+        f.write data
+      end
+    end
+    return data
+  end
+end
+
+class Set
+  def push *v
+    v.each do |o|
+      add(o)
+    end
+  end
+end
+
+class Hash
+  include TSort
+
+  alias tsort_each_node each_key
+
+  def tsort_each_child(node, &block)
+    fetch(node).each(&block)
+  end
+
+  def minvert
+    r = Hash.new { |h,k| h[k] = [] }
+    invert.each do |keys, val|
+      keys.each do |key|
+        r[key] << val
+      end
+    end
+    r.each do |k,v|
+      r[k] = v.sort
+    end
+    r
+  end
+
+  def transitive
+    r = Hash.new { |h,k| h[k] = [] }
+    each do |k,v|
+      r[k].push(*t(k))
+    end
+    r
+  end
+
+  def t(k)
+    r = Set.new
+    self[k].each do |v|
+      r.push(v, *t(v))
+    end
+    r.to_a.sort
+  end
+end
+
+class DepAnalyzer < Cache
+  def initialize
+    super ".#{self.class}.cache"
+  end
+
+  def run
+    g = Graph.new
+    ports = {}
+    installed.each do |port|
+      ports[port] = nil
+    end
+
+    old = {}
+    outdated.each do |port|
+      old[port] = nil
+    end
+
+    all_ports = ports.keys
+
+    ports.each_key do |port|
+      deps = self.deps(port)
+      # remove things that don't intersect with installed list
+      deps -= (deps - all_ports)
+      deps.each do |dep|
+        g[port] << dep
+      end
+      ports[port] = deps
+    end
+
+    indies = ports.keys - ports.minvert.keys
+    indies.each do |k|
+      g.attribs[k] << "color = blue"
+    end
+    old.each do |k,v|
+      if indies.include? k then
+        g.attribs[k] << "color = purple4"
+      else
+        g.attribs[k] << "color = red"
+      end
+    end
+
+    puts "Looks like you can nuke:\n\t#{indies.join("\n\t")}"
+
+    unless ARGV.empty? then
+      ARGV.each do |pkg|
+        hits = ports.transitive[pkg]
+        sorted = ports.tsort.reverse
+        topo = [pkg] + sorted.select { |o| hits.include? o }
+        prune = ports.dup
+        topo.each do |k|
+          prune.delete(k)
+        end
+        topo -= prune.values.flatten.uniq
+
+        puts topo.join(' ')
+      end
+    end
+
+    g.save "#{self.class}"
+    system "open #{self.class}.png"
+  end
+end
+
+type     = (ARGV.shift || "macports")
+
+require "#{type}_analyzer"
+
+klass    = Object.const_get "#{type.capitalize}Analyzer"
+analyzer = klass.new
+analyzer.run

data/lib/freebsd_analyzer.rb

@@ -0,0 +1,19 @@
+class FreebsdAnalyzer < DepAnalyzer
+  def installed
+    # don't cache so it updates every delete
+    puts "scanning installed ports"
+    `pkg_info`.split(/\n/).map { |s| s.split.first }
+  end
+
+  def outdated
+    # don't cache so it updates every delete
+    puts "scanning outdated ports"
+    `pkg_version -vL=`.split(/\n/)[1..-1].map { |s| s.split.first }
+  end
+
+  def deps port
+    cache("#{port}.deps") {
+      `pkg_info -r #{port}`
+    }.grep(/Dependency:/).map { |s| s.split[1] }
+  end
+end

data/lib/graph.rb

@@ -0,0 +1,89 @@
+#!/usr/local/bin/ruby -w
+
+class Graph < Hash
+  VERSION = '1.0.0'
+
+  attr_reader :attribs
+  attr_reader :prefix
+  attr_reader :order
+  attr_reader :edge
+
+  def initialize
+    super { |h,k| h[k] = [] }
+    @prefix = []
+    @attribs = Hash.new { |h,k| h[k] = [] }
+    @edge = Hash.new { |h,k| h[k] = Hash.new { |h2,k2| h2[k2] = [] } }
+    @order = []
+  end
+
+  def []= key, val
+    @order << key unless self.has_key? key
+    super
+  end
+
+  def delete key
+    @order.delete key
+    super
+  end
+
+  def filter_size minimum
+    counts.each do |node, count|
+      next unless count < minimum
+      delete node
+    end
+  end
+
+  def each_pair
+    @order.each do |from|
+      self[from].each do |to|
+        yield from, to
+      end
+    end
+  end
+
+  def invert
+    result = self.class.new
+    each_pair do |from, to|
+      result[to] << from
+    end
+    result
+  end
+
+  def counts
+    result = Hash.new 0
+    each_pair do |from, to|
+      result[from] += 1
+    end
+    result
+  end
+
+  def keys_by_count
+    counts.sort_by { |key, count| -count }.map {|key, count| key }
+  end
+
+  def to_s
+    result = []
+    result << "digraph absent"
+    result << "  {"
+    @prefix.each do |line|
+      result << line
+    end
+    @attribs.sort.each do |node, attribs|
+      result << "    #{node.inspect} [ #{attribs.join ','} ]"
+    end
+    each_pair do |from, to|
+      edge = @edge[from][to].join ", "
+      edge = " [ #{edge} ]" unless edge.empty?
+      result << "    #{from.inspect} -> #{to.inspect}#{edge};"
+    end
+    result << "  }"
+    result.join "\n"
+  end
+
+  def save path, type="png"
+    File.open "#{path}.dot", "w" do |f|
+      f.puts self.to_s
+    end
+    system "dot -T#{type} #{path}.dot > #{path}.#{type}"
+  end
+end

data/lib/macports_analyzer.rb

@@ -0,0 +1,19 @@
+class MacportsAnalyzer < DepAnalyzer
+  def installed
+    # don't cache so it updates every delete
+    puts "scanning installed ports"
+    `port installed`.split(/\n/)[1..-1].map { |s| s.split.first }
+  end
+
+  def outdated
+    # don't cache so it updates every delete
+    puts "scanning outdated ports"
+    `port outdated`.split(/\n/)[1..-1].map { |s| s.split.first }
+  end
+
+  def deps port
+    cache("#{port}.deps") {
+      `port deps #{port}`
+    }.scan(/^\t(\S+)$/).flatten
+  end
+end

data/lib/rubygems_analyzer.rb

@@ -0,0 +1,20 @@
+class RubygemsAnalyzer < DepAnalyzer
+  def installed
+    require 'rubygems'
+    ENV['GEM_PATH'] = `gem env home`
+    Gem.clear_paths
+    # don't cache so it updates every delete
+    puts "scanning installed rubygems"
+    Gem.source_index.gems.values.map { |gem| gem.name }.sort
+  end
+
+  def outdated
+    # don't cache so it updates every delete
+    puts "scanning outdated rubygems"
+    Gem.source_index.outdated.sort
+  end
+
+  def deps port
+    Gem.source_index.find_name(port).first.dependencies.map { |dep| dep.name }
+  end
+end

data/test/test_graph.rb

@@ -0,0 +1,8 @@
+require "test/unit"
+require "graph"
+
+class TestGraph < Test::Unit::TestCase
+  def test_sanity
+    flunk "write tests or I will kneecap you"
+  end
+end

metadata

@@ -0,0 +1,97 @@
+--- !ruby/object:Gem::Specification 
+name: graph
+version: !ruby/object:Gem::Version 
+  version: 1.0.0
+platform: ruby
+authors: 
+- Ryan Davis
+autorequire: 
+bindir: bin
+cert_chain: 
+- |
+  -----BEGIN CERTIFICATE-----
+  MIIDPjCCAiagAwIBAgIBADANBgkqhkiG9w0BAQUFADBFMRMwEQYDVQQDDApyeWFu
+  ZC1ydWJ5MRkwFwYKCZImiZPyLGQBGRYJemVuc3BpZGVyMRMwEQYKCZImiZPyLGQB
+  GRYDY29tMB4XDTA5MDMwNjE4NTMxNVoXDTEwMDMwNjE4NTMxNVowRTETMBEGA1UE
+  AwwKcnlhbmQtcnVieTEZMBcGCgmSJomT8ixkARkWCXplbnNwaWRlcjETMBEGCgmS
+  JomT8ixkARkWA2NvbTCCASIwDQYJKoZIhvcNAQEBBQADggEPADCCAQoCggEBALda
+  b9DCgK+627gPJkB6XfjZ1itoOQvpqH1EXScSaba9/S2VF22VYQbXU1xQXL/WzCkx
+  taCPaLmfYIaFcHHCSY4hYDJijRQkLxPeB3xbOfzfLoBDbjvx5JxgJxUjmGa7xhcT
+  oOvjtt5P8+GSK9zLzxQP0gVLS/D0FmoE44XuDr3iQkVS2ujU5zZL84mMNqNB1znh
+  GiadM9GHRaDiaxuX0cIUBj19T01mVE2iymf9I6bEsiayK/n6QujtyCbTWsAS9Rqt
+  qhtV7HJxNKuPj/JFH0D2cswvzznE/a5FOYO68g+YCuFi5L8wZuuM8zzdwjrWHqSV
+  gBEfoTEGr7Zii72cx+sCAwEAAaM5MDcwCQYDVR0TBAIwADALBgNVHQ8EBAMCBLAw
+  HQYDVR0OBBYEFEfFe9md/r/tj/Wmwpy+MI8d9k/hMA0GCSqGSIb3DQEBBQUAA4IB
+  AQAY59gYvDxqSqgC92nAP9P8dnGgfZgLxP237xS6XxFGJSghdz/nI6pusfCWKM8m
+  vzjjH2wUMSSf3tNudQ3rCGLf2epkcU13/rguI88wO6MrE0wi4ZqLQX+eZQFskJb/
+  w6x9W1ur8eR01s397LSMexySDBrJOh34cm2AlfKr/jokKCTwcM0OvVZnAutaovC0
+  l1SVZ0ecg88bsWHA0Yhh7NFxK1utWoIhtB6AFC/+trM0FQEB/jZkIS8SaNzn96Rl
+  n0sZEf77FLf5peR8TP/PtmIg7Cyqz23sLM4mCOoTGIy5OcZ8TdyiyINUHtb5ej/T
+  FBHgymkyj/AOSqKRIpXPhjC6
+  -----END CERTIFICATE-----
+
+date: 2009-03-31 00:00:00 -07:00
+default_executable: 
+dependencies: 
+- !ruby/object:Gem::Dependency 
+  name: hoe
+  type: :development
+  version_requirement: 
+  version_requirements: !ruby/object:Gem::Requirement 
+    requirements: 
+    - - ">="
+      - !ruby/object:Gem::Version 
+        version: 1.12.0
+    version: 
+description: Graph is a type of hash that outputs in graphviz's dot format. It comes with a command-line interface that is easily pluggable.  It ships with plugins to graph dependencies and status of installed rubygems, mac ports, and freebsd ports, coloring leaf nodes blue, outdated nodes red, and outdated leaf nodes purple (red+blue).
+email: 
+- ryand-ruby@zenspider.com
+executables: 
+- graph
+extensions: []
+
+extra_rdoc_files: 
+- History.txt
+- Manifest.txt
+- README.txt
+files: 
+- .autotest
+- History.txt
+- Manifest.txt
+- README.txt
+- Rakefile
+- bin/graph
+- lib/freebsd_analyzer.rb
+- lib/graph.rb
+- lib/macports_analyzer.rb
+- lib/rubygems_analyzer.rb
+- test/test_graph.rb
+has_rdoc: true
+homepage: http://rubyforge.org/projects/seattlerb
+post_install_message: 
+rdoc_options: 
+- --main
+- README.txt
+require_paths: 
+- lib
+required_ruby_version: !ruby/object:Gem::Requirement 
+  requirements: 
+  - - ">="
+    - !ruby/object:Gem::Version 
+      version: "0"
+  version: 
+required_rubygems_version: !ruby/object:Gem::Requirement 
+  requirements: 
+  - - ">="
+    - !ruby/object:Gem::Version 
+      version: "0"
+  version: 
+requirements: []
+
+rubyforge_project: seattlerb
+rubygems_version: 1.3.1
+signing_key: 
+specification_version: 2
+summary: Graph is a type of hash that outputs in graphviz's dot format
+test_files: 
+- test/test_graph.rb