flat2tree 1.0.0

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA1:
+  metadata.gz: 40fe4e65857c12b476f96109574f6ea44df7307b
+  data.tar.gz: f100449c0118537c06170cf72b2882b44c3697cc
+SHA512:
+  metadata.gz: e8609d72a7fcc7583b28336edf353f6abf54bd07baf012752b6e9e833a27473327f12c473d16ac524c1867a324785c129622bbd1582f3f96a146bfd4977f8ce1
+  data.tar.gz: ed093429c879bc925bc14245703b91a382f65ccd89f1f59d50ed727a7abfe4621a10de2d1e4eed8806abf05d6cd7af33811b4b751cc41f827599d6bd0d218f7e

data/.gitignore

@@ -0,0 +1 @@
+/*.gem

data/LICENCE

@@ -0,0 +1,14 @@
+Copyright (c) 2013 Michal Papis
+
+Licensed under the Apache License, Version 2.0 (the "License");
+you may not use this file except in compliance with the License.
+You may obtain a copy of the License at
+
+    http://www.apache.org/licenses/LICENSE-2.0
+
+Unless required by applicable law or agreed to in writing, software
+distributed under the License is distributed on an "AS IS" BASIS,
+WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+See the License for the specific language governing permissions and
+limitations under the License.
+

data/README.md

@@ -0,0 +1,60 @@
+# Flat2Tree
+
+Transform flat list into (reverse) dependency tree.
+
+## Installation
+
+    gem install Flat2Tree
+
+## Example data
+
+Initialize + enter data for examples:
+
+    require 'flat2tree'
+    list = {
+      "Tom"=>["Kate", "John"],
+      "Kate"=>["John"],
+      "John"=>[]
+    }.map{|name, list| Flat2Tree::Entry.new(name, list)}
+
+## Example print dependency tree from starting point
+
+`.to_s` produces tree like output compatible with YAML.
+
+    puts Flat2Tree.dependencies_from(list, 'Kate')
+
+    Kate:
+        - John
+
+## Example print dependency tree
+
+When no starting node name is given an nameless root container is created, use `.nodes` to get array.
+
+    puts Flat2Tree.dependencies_from(list).nodes
+
+    Tom:
+        - Kate:
+            - John
+        - John
+    Kate:
+        - John
+    John
+
+## Example print simplified reverse dependency tree
+
+It is also to reverse the dependency tree so last leafs end up as roots
+
+    puts Flat2Tree.reverse_dependencies_from(list).simplify.nodes
+
+    John:
+        - Tom
+        - Kate:
+            - Tom
+
+## TODO:
+
+ - handle missing node
+
+## Authors
+
+ - Michal Papis <mpapis@gmail.com>

data/flat2tree.gemspec

@@ -0,0 +1,18 @@
+#!/usr/bin/env ruby
+# -*- encoding: utf-8 -*-
+
+Kernel.load File.expand_path("../lib/flat2tree/version.rb", __FILE__)
+
+Gem::Specification.new do |s|
+  s.name        = "flat2tree"
+  s.version     = Flat2Tree::VERSION
+  s.authors     = ["Michal Papis"]
+  s.email       = ["mpapis@gmail.com"]
+  s.homepage    = "https://github.com/mpapis/flat2tree"
+  s.summary     = %q{Transform flat list into (reverse) dependency tree}
+
+  s.files       = `git ls-files`.split("\n")
+  s.test_files  = `git ls-files -- {test,spec,features}/*`.split("\n")
+
+  #s.add_development_dependency "smf-gem"
+end

data/lib/flat2tree.rb

@@ -0,0 +1,13 @@
+module Flat2Tree
+  # build dependency tree from the list
+  def self.dependencies_from(flat_list, name = nil)
+    Flat2Tree::Entry.new(name).dependencies(flat_list)
+  end
+
+  # build reverse dependency tree from the list
+  def self.reverse_dependencies_from(flat_list, name = nil)
+    Flat2Tree::Entry.new(name).reverse_dependencies(flat_list)
+  end
+end
+
+require_relative "flat2tree/entry"

data/lib/flat2tree/entry.rb

@@ -0,0 +1,60 @@
+class Flat2Tree::Entry
+  attr_accessor :name, :nodes, :meta
+
+  def initialize(name = nil, nodes = nil, meta = nil)
+    @name, @nodes, @meta = name, nodes, meta
+  end
+
+  # expand flat list into tree
+  def dependencies(flat_list)
+    @nodes = flat_list.map(&:clone)
+    @nodes.each do |entry|
+      entry.nodes = entry.nodes.map do |node|
+        @nodes.detect{|entry| entry.name == node }
+      end
+    end
+    # extract the start node if name was given
+    @nodes = @nodes.detect{|node| node.name == name }.nodes unless name.nil?
+    self
+  end
+
+  # reverse the dependency tree
+  def reverse_dependencies(flat_list)
+    if name.nil?
+      @nodes = flat_list.map(&:clone) # .select{|entry| entry.nodes.empty? }
+    else
+      @nodes = flat_list.select{|entry| entry.nodes.include?(name) }.map(&:clone)
+    end
+    nodes.each{|node| node.reverse_dependencies(flat_list) }
+    self
+  end
+
+  def simplify
+    @nodes.reject! do |search_node|
+      @nodes.detect{|iteration_node|
+        iteration_node.nodes.detect{|node| node.name == search_node.name }
+      }
+    end
+    self
+  end
+
+  # printout the tree
+  def to_s(level = 0)
+    out = "#{prefix(level)}#{name}"
+    out << ":\n" if nodes.size > 0 and name
+    out << nodes.map do |n|
+      if n.is_a?(Flat2Tree::Entry)
+        n.to_s(level + 1)
+      else
+  n.to_s.split(/\n/).map{|line| "#{prefix(level + 1)}#{line}"}.join("\n")
+      end
+    end.join("\n") if nodes.size > 0
+    out
+  end
+
+private
+  # calculate spaces prefix for given level
+  def prefix(level)
+    level == 0 ? "" : "%#{level * 4}s- " % " "
+  end
+end

data/lib/flat2tree/version.rb

@@ -0,0 +1,3 @@
+module Flat2Tree
+  VERSION = '1.0.0'
+end

metadata

@@ -0,0 +1,50 @@
+--- !ruby/object:Gem::Specification
+name: flat2tree
+version: !ruby/object:Gem::Version
+  version: 1.0.0
+platform: ruby
+authors:
+- Michal Papis
+autorequire: 
+bindir: bin
+cert_chain: []
+date: 2013-06-15 00:00:00.000000000 Z
+dependencies: []
+description: 
+email:
+- mpapis@gmail.com
+executables: []
+extensions: []
+extra_rdoc_files: []
+files:
+- .gitignore
+- LICENCE
+- README.md
+- flat2tree.gemspec
+- lib/flat2tree.rb
+- lib/flat2tree/entry.rb
+- lib/flat2tree/version.rb
+homepage: https://github.com/mpapis/flat2tree
+licenses: []
+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: Transform flat list into (reverse) dependency tree
+test_files: []