rdg 0.0.1
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- checksums.yaml +7 -0
- data/.gitignore +17 -0
- data/.rspec +2 -0
- data/.rubocop.yml +15 -0
- data/.travis.yml +8 -0
- data/Gemfile +5 -0
- data/LICENSE.txt +22 -0
- data/README.md +25 -0
- data/Rakefile +23 -0
- data/bin/ast +10 -0
- data/lib/rdg/tree/ast.rb +66 -0
- data/lib/rdg/tree/rgl/post_order_iterator.rb +84 -0
- data/lib/rdg/tree/rgl/pre_order_iterator.rb +94 -0
- data/lib/rdg/version.rb +3 -0
- data/rdg.gemspec +29 -0
- data/spec/spec_helper.rb +20 -0
- data/spec/unit/tree/ast_spec.rb +15 -0
- data/spec/unit/tree/rgl/post_order_iterator_spec.rb +37 -0
- data/spec/unit/tree/rgl/pre_order_iterator_spec.rb +37 -0
- metadata +166 -0
checksums.yaml
ADDED
@@ -0,0 +1,7 @@
|
|
1
|
+
---
|
2
|
+
SHA1:
|
3
|
+
metadata.gz: b4773e86f8072218af847f45bb3fd7144b17280d
|
4
|
+
data.tar.gz: bc71864a750e80a115446322711ace2d9a36684c
|
5
|
+
SHA512:
|
6
|
+
metadata.gz: d6194df5a3f39aab8a8d3819e2ec310a24611c53fa15ffc947edf7fec96aa02fa8b5bbad142b84bb228011b1bc65086ddf9e55ac527ed752f9e08cc571073225
|
7
|
+
data.tar.gz: 35e161070ace8d798444f3c857328fde3c5eb785989d7182e1b06a56b0c6c124c3190e3cb6b7e3183ed4cc30d1e39507023d8d5d25ea7512346780d5c05a814a
|
data/.gitignore
ADDED
data/.rspec
ADDED
data/.rubocop.yml
ADDED
data/.travis.yml
ADDED
data/Gemfile
ADDED
data/LICENSE.txt
ADDED
@@ -0,0 +1,22 @@
|
|
1
|
+
Copyright (c) 2015 Louis Rose
|
2
|
+
|
3
|
+
MIT License
|
4
|
+
|
5
|
+
Permission is hereby granted, free of charge, to any person obtaining
|
6
|
+
a copy of this software and associated documentation files (the
|
7
|
+
"Software"), to deal in the Software without restriction, including
|
8
|
+
without limitation the rights to use, copy, modify, merge, publish,
|
9
|
+
distribute, sublicense, and/or sell copies of the Software, and to
|
10
|
+
permit persons to whom the Software is furnished to do so, subject to
|
11
|
+
the following conditions:
|
12
|
+
|
13
|
+
The above copyright notice and this permission notice shall be
|
14
|
+
included in all copies or substantial portions of the Software.
|
15
|
+
|
16
|
+
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
|
17
|
+
EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
|
18
|
+
MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
|
19
|
+
NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
|
20
|
+
LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
|
21
|
+
OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
|
22
|
+
WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
|
data/README.md
ADDED
@@ -0,0 +1,25 @@
|
|
1
|
+
# RDG [](https://travis-ci.org/mutiny/rdg) [](https://codeclimate.com/github/mutiny/rdg) [](https://gemnasium.com/mutiny/rdg) [](https://codeclimate.com/github/mutiny/rdg)
|
2
|
+
|
3
|
+
Dependency analysis for Ruby programs
|
4
|
+
|
5
|
+
## Installation
|
6
|
+
|
7
|
+
Add these line to your application's Gemfile:
|
8
|
+
|
9
|
+
gem 'rdg'
|
10
|
+
|
11
|
+
And then execute:
|
12
|
+
|
13
|
+
$ bundle
|
14
|
+
|
15
|
+
Or install it yourself as:
|
16
|
+
|
17
|
+
$ gem install rdg
|
18
|
+
|
19
|
+
## Contributing
|
20
|
+
|
21
|
+
1. Fork it
|
22
|
+
2. Create your feature branch (`git checkout -b my-new-feature`)
|
23
|
+
3. Commit your changes (`git commit -am 'Add some feature'`)
|
24
|
+
4. Push to the branch (`git push origin my-new-feature`)
|
25
|
+
5. Create new Pull Request
|
data/Rakefile
ADDED
@@ -0,0 +1,23 @@
|
|
1
|
+
require "bundler/gem_tasks"
|
2
|
+
require "rspec/core/rake_task"
|
3
|
+
|
4
|
+
task default: ["test:unit", "test:integration", "style:check"]
|
5
|
+
|
6
|
+
namespace :test do
|
7
|
+
RSpec::Core::RakeTask.new(:unit) do |task|
|
8
|
+
task.pattern = "./spec/unit{,/*/**}/*_spec.rb"
|
9
|
+
end
|
10
|
+
|
11
|
+
RSpec::Core::RakeTask.new(:integration) do |task|
|
12
|
+
task.pattern = "./spec/integration{,/*/**}/*_spec.rb"
|
13
|
+
end
|
14
|
+
end
|
15
|
+
|
16
|
+
namespace :style do
|
17
|
+
require "rubocop/rake_task"
|
18
|
+
|
19
|
+
desc "Run RuboCop on the lib directory"
|
20
|
+
RuboCop::RakeTask.new(:check) do |task|
|
21
|
+
task.options = ["--auto-correct"]
|
22
|
+
end
|
23
|
+
end
|
data/bin/ast
ADDED
@@ -0,0 +1,10 @@
|
|
1
|
+
#!/usr/bin/env ruby
|
2
|
+
require_relative "../lib/rdg/tree/ast"
|
3
|
+
|
4
|
+
if ARGV.size == 1
|
5
|
+
RDG::Tree::AST.from_path(ARGV[0]).write_to_graphic_file('png', ARGV[0])
|
6
|
+
else
|
7
|
+
puts "ast: expected 1 argument but received #{ARGV.size}"
|
8
|
+
puts "Usage:"
|
9
|
+
puts " ast path/to/source.rb"
|
10
|
+
end
|
data/lib/rdg/tree/ast.rb
ADDED
@@ -0,0 +1,66 @@
|
|
1
|
+
require "rgl/adjacency"
|
2
|
+
require "rgl/dot"
|
3
|
+
require "parser/current"
|
4
|
+
require_relative "rgl/pre_order_iterator"
|
5
|
+
require_relative "rgl/post_order_iterator"
|
6
|
+
|
7
|
+
module RDG
|
8
|
+
module Tree
|
9
|
+
class AST
|
10
|
+
def self.from_path(path, parser = Parser::CurrentRuby)
|
11
|
+
from_source(File.read(path), parser)
|
12
|
+
end
|
13
|
+
|
14
|
+
def self.from_source(source, parser = Parser::CurrentRuby)
|
15
|
+
new(parser.parse(source))
|
16
|
+
end
|
17
|
+
|
18
|
+
def initialize(ast)
|
19
|
+
@graph = ::RGL::DirectedAdjacencyGraph.new
|
20
|
+
import(ast)
|
21
|
+
end
|
22
|
+
|
23
|
+
def pre_order_iterator
|
24
|
+
RGL::PreOrderIterator.new(@graph)
|
25
|
+
end
|
26
|
+
|
27
|
+
def post_order_iterator
|
28
|
+
RGL::PostOrderIterator.new(@graph)
|
29
|
+
end
|
30
|
+
|
31
|
+
def write_to_graphic_file(format = 'png', filename = "ast")
|
32
|
+
@graph.write_to_graphic_file(format, filename)
|
33
|
+
end
|
34
|
+
|
35
|
+
private
|
36
|
+
|
37
|
+
def import(ast)
|
38
|
+
Node.new(ast).tap do |current_node|
|
39
|
+
@graph.add_vertex(current_node)
|
40
|
+
|
41
|
+
current_node.children.each do |child|
|
42
|
+
@graph.add_edge(current_node, import(child))
|
43
|
+
end
|
44
|
+
end
|
45
|
+
end
|
46
|
+
|
47
|
+
class Node
|
48
|
+
def initialize(wrapped)
|
49
|
+
@wrapped = wrapped
|
50
|
+
end
|
51
|
+
|
52
|
+
def children
|
53
|
+
if @wrapped.is_a?(Parser::AST::Node)
|
54
|
+
@wrapped.children
|
55
|
+
else
|
56
|
+
[]
|
57
|
+
end
|
58
|
+
end
|
59
|
+
|
60
|
+
def to_s
|
61
|
+
@wrapped.to_s
|
62
|
+
end
|
63
|
+
end
|
64
|
+
end
|
65
|
+
end
|
66
|
+
end
|
@@ -0,0 +1,84 @@
|
|
1
|
+
require "rgl/traversal"
|
2
|
+
|
3
|
+
module RDG
|
4
|
+
module Tree
|
5
|
+
module RGL
|
6
|
+
class PostOrderIterator
|
7
|
+
include ::RGL::GraphIterator
|
8
|
+
|
9
|
+
def initialize(tree, root = tree.first)
|
10
|
+
super(tree)
|
11
|
+
@root = root
|
12
|
+
set_to_begin
|
13
|
+
end
|
14
|
+
|
15
|
+
def set_to_begin
|
16
|
+
@visited = Hash.new(false)
|
17
|
+
@stack = []
|
18
|
+
@start = descend(@root)
|
19
|
+
@current = @start
|
20
|
+
end
|
21
|
+
|
22
|
+
def at_beginning?
|
23
|
+
@current == @start
|
24
|
+
end
|
25
|
+
|
26
|
+
def at_end?
|
27
|
+
visited?(@root)
|
28
|
+
end
|
29
|
+
|
30
|
+
def basic_forward
|
31
|
+
@current = descend(@current)
|
32
|
+
visit(@current)
|
33
|
+
@current
|
34
|
+
end
|
35
|
+
|
36
|
+
def basic_backward
|
37
|
+
@current = ascend(@current)
|
38
|
+
unvisit(@current)
|
39
|
+
@current
|
40
|
+
end
|
41
|
+
|
42
|
+
private
|
43
|
+
|
44
|
+
def visit(node)
|
45
|
+
@visited[node.object_id] = true
|
46
|
+
end
|
47
|
+
|
48
|
+
def unvisit(node)
|
49
|
+
@visited[node.object_id] = false
|
50
|
+
end
|
51
|
+
|
52
|
+
def visited?(node)
|
53
|
+
@visited[node.object_id]
|
54
|
+
end
|
55
|
+
|
56
|
+
def descend(node)
|
57
|
+
next_child = graph.each_adjacent(node).detect { |c| !visited?(c) }
|
58
|
+
|
59
|
+
if visited?(node)
|
60
|
+
descend(@stack.pop)
|
61
|
+
elsif next_child.nil?
|
62
|
+
node
|
63
|
+
else
|
64
|
+
@stack.push(node)
|
65
|
+
descend(next_child)
|
66
|
+
end
|
67
|
+
end
|
68
|
+
|
69
|
+
def ascend(node)
|
70
|
+
last_child = graph.each_adjacent(node).select { |c| visited?(c) }.last
|
71
|
+
|
72
|
+
if visited?(node)
|
73
|
+
node
|
74
|
+
elsif last_child.nil?
|
75
|
+
ascend(@stack.pop)
|
76
|
+
else
|
77
|
+
@stack.push(node)
|
78
|
+
last_child
|
79
|
+
end
|
80
|
+
end
|
81
|
+
end
|
82
|
+
end
|
83
|
+
end
|
84
|
+
end
|
@@ -0,0 +1,94 @@
|
|
1
|
+
require "rgl/traversal"
|
2
|
+
|
3
|
+
module RDG
|
4
|
+
module Tree
|
5
|
+
module RGL
|
6
|
+
class PreOrderIterator
|
7
|
+
include ::RGL::GraphIterator
|
8
|
+
|
9
|
+
def initialize(tree, root = tree.first)
|
10
|
+
super(tree)
|
11
|
+
@root = root
|
12
|
+
set_to_begin
|
13
|
+
end
|
14
|
+
|
15
|
+
def set_to_begin
|
16
|
+
@visited = Hash.new(false)
|
17
|
+
@stack = []
|
18
|
+
@start = @root
|
19
|
+
@current = @start
|
20
|
+
end
|
21
|
+
|
22
|
+
def at_beginning?
|
23
|
+
@current == @start
|
24
|
+
end
|
25
|
+
|
26
|
+
def at_end?
|
27
|
+
visited?(last_leaf(@root))
|
28
|
+
end
|
29
|
+
|
30
|
+
def basic_forward
|
31
|
+
@current = descend(@current)
|
32
|
+
visit(@current)
|
33
|
+
@current
|
34
|
+
end
|
35
|
+
|
36
|
+
def basic_backward
|
37
|
+
@current = ascend(@current)
|
38
|
+
unvisit(@current)
|
39
|
+
@current
|
40
|
+
end
|
41
|
+
|
42
|
+
private
|
43
|
+
|
44
|
+
def visit(node)
|
45
|
+
@visited[node.object_id] = true
|
46
|
+
end
|
47
|
+
|
48
|
+
def unvisit(node)
|
49
|
+
@visited[node.object_id] = false
|
50
|
+
end
|
51
|
+
|
52
|
+
def visited?(node)
|
53
|
+
@visited[node.object_id]
|
54
|
+
end
|
55
|
+
|
56
|
+
def descend(node)
|
57
|
+
next_child = graph.each_adjacent(node).detect { |c| !visited?(c) }
|
58
|
+
|
59
|
+
if !visited?(node)
|
60
|
+
node
|
61
|
+
elsif next_child.nil?
|
62
|
+
descend(@stack.pop)
|
63
|
+
else
|
64
|
+
@stack.push(node)
|
65
|
+
next_child
|
66
|
+
end
|
67
|
+
end
|
68
|
+
|
69
|
+
def ascend(node)
|
70
|
+
last_child = graph.each_adjacent(node).select { |c| visited?(c) }.last
|
71
|
+
|
72
|
+
if last_child
|
73
|
+
@stack.push(node)
|
74
|
+
ascend(last_child)
|
75
|
+
elsif visited?(node)
|
76
|
+
node
|
77
|
+
else
|
78
|
+
ascend(@stack.pop)
|
79
|
+
end
|
80
|
+
end
|
81
|
+
|
82
|
+
def last_leaf(node)
|
83
|
+
last_child = graph.each_adjacent(node).select { |_c| true }.last
|
84
|
+
|
85
|
+
if last_child.nil?
|
86
|
+
node
|
87
|
+
else
|
88
|
+
last_leaf(last_child)
|
89
|
+
end
|
90
|
+
end
|
91
|
+
end
|
92
|
+
end
|
93
|
+
end
|
94
|
+
end
|
data/lib/rdg/version.rb
ADDED
data/rdg.gemspec
ADDED
@@ -0,0 +1,29 @@
|
|
1
|
+
# coding: utf-8
|
2
|
+
lib = File.expand_path('../lib', __FILE__)
|
3
|
+
$LOAD_PATH.unshift(lib) unless $LOAD_PATH.include?(lib)
|
4
|
+
require 'rdg/version'
|
5
|
+
|
6
|
+
Gem::Specification.new do |spec|
|
7
|
+
spec.name = "rdg"
|
8
|
+
spec.version = RDG::VERSION
|
9
|
+
spec.authors = ["Louis Rose"]
|
10
|
+
spec.email = ["louis.rose@york.ac.uk"]
|
11
|
+
spec.description = %q{Provides dependency analysis of Ruby programs, including control and data flow analysis.}
|
12
|
+
spec.summary = %q{Dependency analysis for Ruby programs}
|
13
|
+
spec.homepage = "https://github.com/mutiny/rdg"
|
14
|
+
spec.license = "MIT"
|
15
|
+
|
16
|
+
spec.files = `git ls-files`.split($/)
|
17
|
+
spec.executables = spec.files.grep(%r{^bin/}) { |f| File.basename(f) }
|
18
|
+
spec.test_files = spec.files.grep(%r{^(test|spec|features)/})
|
19
|
+
spec.require_paths = ["lib"]
|
20
|
+
|
21
|
+
spec.add_runtime_dependency "parser", "~> 2.2.0.2"
|
22
|
+
spec.add_runtime_dependency "rgl", "~> 0.5.0"
|
23
|
+
|
24
|
+
spec.add_development_dependency "bundler", "~> 1.8.0"
|
25
|
+
spec.add_development_dependency "rake", "~> 10.4.2"
|
26
|
+
spec.add_development_dependency "rspec", "~> 3.2.0"
|
27
|
+
spec.add_development_dependency "codeclimate-test-reporter", "~> 0.4.6"
|
28
|
+
spec.add_development_dependency "rubocop", "~> 0.29.0"
|
29
|
+
end
|
data/spec/spec_helper.rb
ADDED
@@ -0,0 +1,20 @@
|
|
1
|
+
require "codeclimate-test-reporter"
|
2
|
+
CodeClimate::TestReporter.start
|
3
|
+
|
4
|
+
# This file was generated by the `rspec --init` command. Conventionally, all
|
5
|
+
# specs live under a `spec` directory, which RSpec adds to the `$LOAD_PATH`.
|
6
|
+
# Require this file using `require "spec_helper"` to ensure that it is only
|
7
|
+
# loaded once.
|
8
|
+
#
|
9
|
+
# See http://rubydoc.info/gems/rspec-core/RSpec/Core/Configuration
|
10
|
+
RSpec.configure do |config|
|
11
|
+
config.treat_symbols_as_metadata_keys_with_true_values = true
|
12
|
+
config.run_all_when_everything_filtered = true
|
13
|
+
config.filter_run :focus
|
14
|
+
|
15
|
+
# Run specs in random order to surface order dependencies. If you find an
|
16
|
+
# order dependency and want to debug it, you can fix the order by providing
|
17
|
+
# the seed, which is printed after each run.
|
18
|
+
# --seed 1234
|
19
|
+
config.order = 'random'
|
20
|
+
end
|
@@ -0,0 +1,15 @@
|
|
1
|
+
require "rdg/tree/ast"
|
2
|
+
|
3
|
+
module RDG
|
4
|
+
module Tree
|
5
|
+
describe AST do
|
6
|
+
subject { AST.from_source("a.b") }
|
7
|
+
|
8
|
+
it "should render Ruby source as an AST" do
|
9
|
+
nodes = subject.pre_order_iterator.map(&:to_s).to_a
|
10
|
+
|
11
|
+
expect(nodes).to eq(["(send ...)", "(send ...)", "", "a", "b"])
|
12
|
+
end
|
13
|
+
end
|
14
|
+
end
|
15
|
+
end
|
@@ -0,0 +1,37 @@
|
|
1
|
+
require "rdg/tree/rgl/post_order_iterator"
|
2
|
+
require "rgl/adjacency"
|
3
|
+
|
4
|
+
module RDG
|
5
|
+
module Tree
|
6
|
+
module RGL
|
7
|
+
describe PostOrderIterator do
|
8
|
+
let(:tree) do
|
9
|
+
::RGL::DirectedAdjacencyGraph[
|
10
|
+
:f, :b, # F
|
11
|
+
:b, :a, # / \
|
12
|
+
:b, :d, # B G
|
13
|
+
:d, :c, # / \ \
|
14
|
+
:d, :e, # A D I
|
15
|
+
:f, :g, # / \ /
|
16
|
+
:g, :i, # C E H
|
17
|
+
:i, :h #
|
18
|
+
]
|
19
|
+
end
|
20
|
+
let(:post_order_traversal) { %i(a c e d b h i g f) }
|
21
|
+
subject { PostOrderIterator.new(tree) }
|
22
|
+
|
23
|
+
it "should return a correct post-order traversal" do
|
24
|
+
expect(subject.to_a).to eq(post_order_traversal)
|
25
|
+
end
|
26
|
+
|
27
|
+
it "should return a correct post-order traversal when iterated backwards" do
|
28
|
+
backwards = []
|
29
|
+
subject.set_to_end
|
30
|
+
backwards << subject.basic_backward until subject.at_beginning?
|
31
|
+
|
32
|
+
expect(backwards).to eq(post_order_traversal.reverse)
|
33
|
+
end
|
34
|
+
end
|
35
|
+
end
|
36
|
+
end
|
37
|
+
end
|
@@ -0,0 +1,37 @@
|
|
1
|
+
require "rdg/tree/rgl/pre_order_iterator"
|
2
|
+
require "rgl/adjacency"
|
3
|
+
|
4
|
+
module RDG
|
5
|
+
module Tree
|
6
|
+
module RGL
|
7
|
+
describe PreOrderIterator do
|
8
|
+
let(:tree) do
|
9
|
+
::RGL::DirectedAdjacencyGraph[
|
10
|
+
:f, :b, # F
|
11
|
+
:b, :a, # / \
|
12
|
+
:b, :d, # B G
|
13
|
+
:d, :c, # / \ \
|
14
|
+
:d, :e, # A D I
|
15
|
+
:f, :g, # / \ /
|
16
|
+
:g, :i, # C E H
|
17
|
+
:i, :h #
|
18
|
+
]
|
19
|
+
end
|
20
|
+
let(:pre_order_traversal) { %i(f b a d c e g i h) }
|
21
|
+
subject { PreOrderIterator.new(tree) }
|
22
|
+
|
23
|
+
it "should return a correct pre-order traversal" do
|
24
|
+
expect(subject.to_a).to eq(pre_order_traversal)
|
25
|
+
end
|
26
|
+
|
27
|
+
it "should return a correct pre-order traversal when iterated backwards" do
|
28
|
+
backwards = []
|
29
|
+
subject.set_to_end
|
30
|
+
backwards << subject.basic_backward until subject.at_beginning?
|
31
|
+
|
32
|
+
expect(backwards).to eq(pre_order_traversal.reverse)
|
33
|
+
end
|
34
|
+
end
|
35
|
+
end
|
36
|
+
end
|
37
|
+
end
|
metadata
ADDED
@@ -0,0 +1,166 @@
|
|
1
|
+
--- !ruby/object:Gem::Specification
|
2
|
+
name: rdg
|
3
|
+
version: !ruby/object:Gem::Version
|
4
|
+
version: 0.0.1
|
5
|
+
platform: ruby
|
6
|
+
authors:
|
7
|
+
- Louis Rose
|
8
|
+
autorequire:
|
9
|
+
bindir: bin
|
10
|
+
cert_chain: []
|
11
|
+
date: 2015-02-12 00:00:00.000000000 Z
|
12
|
+
dependencies:
|
13
|
+
- !ruby/object:Gem::Dependency
|
14
|
+
name: parser
|
15
|
+
requirement: !ruby/object:Gem::Requirement
|
16
|
+
requirements:
|
17
|
+
- - "~>"
|
18
|
+
- !ruby/object:Gem::Version
|
19
|
+
version: 2.2.0.2
|
20
|
+
type: :runtime
|
21
|
+
prerelease: false
|
22
|
+
version_requirements: !ruby/object:Gem::Requirement
|
23
|
+
requirements:
|
24
|
+
- - "~>"
|
25
|
+
- !ruby/object:Gem::Version
|
26
|
+
version: 2.2.0.2
|
27
|
+
- !ruby/object:Gem::Dependency
|
28
|
+
name: rgl
|
29
|
+
requirement: !ruby/object:Gem::Requirement
|
30
|
+
requirements:
|
31
|
+
- - "~>"
|
32
|
+
- !ruby/object:Gem::Version
|
33
|
+
version: 0.5.0
|
34
|
+
type: :runtime
|
35
|
+
prerelease: false
|
36
|
+
version_requirements: !ruby/object:Gem::Requirement
|
37
|
+
requirements:
|
38
|
+
- - "~>"
|
39
|
+
- !ruby/object:Gem::Version
|
40
|
+
version: 0.5.0
|
41
|
+
- !ruby/object:Gem::Dependency
|
42
|
+
name: bundler
|
43
|
+
requirement: !ruby/object:Gem::Requirement
|
44
|
+
requirements:
|
45
|
+
- - "~>"
|
46
|
+
- !ruby/object:Gem::Version
|
47
|
+
version: 1.8.0
|
48
|
+
type: :development
|
49
|
+
prerelease: false
|
50
|
+
version_requirements: !ruby/object:Gem::Requirement
|
51
|
+
requirements:
|
52
|
+
- - "~>"
|
53
|
+
- !ruby/object:Gem::Version
|
54
|
+
version: 1.8.0
|
55
|
+
- !ruby/object:Gem::Dependency
|
56
|
+
name: rake
|
57
|
+
requirement: !ruby/object:Gem::Requirement
|
58
|
+
requirements:
|
59
|
+
- - "~>"
|
60
|
+
- !ruby/object:Gem::Version
|
61
|
+
version: 10.4.2
|
62
|
+
type: :development
|
63
|
+
prerelease: false
|
64
|
+
version_requirements: !ruby/object:Gem::Requirement
|
65
|
+
requirements:
|
66
|
+
- - "~>"
|
67
|
+
- !ruby/object:Gem::Version
|
68
|
+
version: 10.4.2
|
69
|
+
- !ruby/object:Gem::Dependency
|
70
|
+
name: rspec
|
71
|
+
requirement: !ruby/object:Gem::Requirement
|
72
|
+
requirements:
|
73
|
+
- - "~>"
|
74
|
+
- !ruby/object:Gem::Version
|
75
|
+
version: 3.2.0
|
76
|
+
type: :development
|
77
|
+
prerelease: false
|
78
|
+
version_requirements: !ruby/object:Gem::Requirement
|
79
|
+
requirements:
|
80
|
+
- - "~>"
|
81
|
+
- !ruby/object:Gem::Version
|
82
|
+
version: 3.2.0
|
83
|
+
- !ruby/object:Gem::Dependency
|
84
|
+
name: codeclimate-test-reporter
|
85
|
+
requirement: !ruby/object:Gem::Requirement
|
86
|
+
requirements:
|
87
|
+
- - "~>"
|
88
|
+
- !ruby/object:Gem::Version
|
89
|
+
version: 0.4.6
|
90
|
+
type: :development
|
91
|
+
prerelease: false
|
92
|
+
version_requirements: !ruby/object:Gem::Requirement
|
93
|
+
requirements:
|
94
|
+
- - "~>"
|
95
|
+
- !ruby/object:Gem::Version
|
96
|
+
version: 0.4.6
|
97
|
+
- !ruby/object:Gem::Dependency
|
98
|
+
name: rubocop
|
99
|
+
requirement: !ruby/object:Gem::Requirement
|
100
|
+
requirements:
|
101
|
+
- - "~>"
|
102
|
+
- !ruby/object:Gem::Version
|
103
|
+
version: 0.29.0
|
104
|
+
type: :development
|
105
|
+
prerelease: false
|
106
|
+
version_requirements: !ruby/object:Gem::Requirement
|
107
|
+
requirements:
|
108
|
+
- - "~>"
|
109
|
+
- !ruby/object:Gem::Version
|
110
|
+
version: 0.29.0
|
111
|
+
description: Provides dependency analysis of Ruby programs, including control and
|
112
|
+
data flow analysis.
|
113
|
+
email:
|
114
|
+
- louis.rose@york.ac.uk
|
115
|
+
executables:
|
116
|
+
- ast
|
117
|
+
extensions: []
|
118
|
+
extra_rdoc_files: []
|
119
|
+
files:
|
120
|
+
- ".gitignore"
|
121
|
+
- ".rspec"
|
122
|
+
- ".rubocop.yml"
|
123
|
+
- ".travis.yml"
|
124
|
+
- Gemfile
|
125
|
+
- LICENSE.txt
|
126
|
+
- README.md
|
127
|
+
- Rakefile
|
128
|
+
- bin/ast
|
129
|
+
- lib/rdg/tree/ast.rb
|
130
|
+
- lib/rdg/tree/rgl/post_order_iterator.rb
|
131
|
+
- lib/rdg/tree/rgl/pre_order_iterator.rb
|
132
|
+
- lib/rdg/version.rb
|
133
|
+
- rdg.gemspec
|
134
|
+
- spec/spec_helper.rb
|
135
|
+
- spec/unit/tree/ast_spec.rb
|
136
|
+
- spec/unit/tree/rgl/post_order_iterator_spec.rb
|
137
|
+
- spec/unit/tree/rgl/pre_order_iterator_spec.rb
|
138
|
+
homepage: https://github.com/mutiny/rdg
|
139
|
+
licenses:
|
140
|
+
- MIT
|
141
|
+
metadata: {}
|
142
|
+
post_install_message:
|
143
|
+
rdoc_options: []
|
144
|
+
require_paths:
|
145
|
+
- lib
|
146
|
+
required_ruby_version: !ruby/object:Gem::Requirement
|
147
|
+
requirements:
|
148
|
+
- - ">="
|
149
|
+
- !ruby/object:Gem::Version
|
150
|
+
version: '0'
|
151
|
+
required_rubygems_version: !ruby/object:Gem::Requirement
|
152
|
+
requirements:
|
153
|
+
- - ">="
|
154
|
+
- !ruby/object:Gem::Version
|
155
|
+
version: '0'
|
156
|
+
requirements: []
|
157
|
+
rubyforge_project:
|
158
|
+
rubygems_version: 2.4.5
|
159
|
+
signing_key:
|
160
|
+
specification_version: 4
|
161
|
+
summary: Dependency analysis for Ruby programs
|
162
|
+
test_files:
|
163
|
+
- spec/spec_helper.rb
|
164
|
+
- spec/unit/tree/ast_spec.rb
|
165
|
+
- spec/unit/tree/rgl/post_order_iterator_spec.rb
|
166
|
+
- spec/unit/tree/rgl/pre_order_iterator_spec.rb
|