graphm 0.1
Sign up to get free protection for your applications and to get access to all the features.
- data.tar.gz.sig +0 -0
- data/COPYING +165 -0
- data/Makefile +59 -0
- data/README +0 -0
- data/graphm.gemspec +38 -0
- data/lib/graphm/edge.rb +29 -0
- data/lib/graphm/graph.rb +48 -0
- data/lib/graphm/node.rb +41 -0
- data/lib/graphm/render/dot.rb +48 -0
- data/lib/graphm/render/generic.rb +24 -0
- data/lib/graphm/render/path.rb +68 -0
- data/test/Makefile +36 -0
- data/test/template.rb +31 -0
- metadata +100 -0
- metadata.gz.sig +0 -0
data.tar.gz.sig
ADDED
Binary file
|
data/COPYING
ADDED
@@ -0,0 +1,165 @@
|
|
1
|
+
GNU LESSER GENERAL PUBLIC LICENSE
|
2
|
+
Version 3, 29 June 2007
|
3
|
+
|
4
|
+
Copyright (C) 2007 Free Software Foundation, Inc. <http://fsf.org/>
|
5
|
+
Everyone is permitted to copy and distribute verbatim copies
|
6
|
+
of this license document, but changing it is not allowed.
|
7
|
+
|
8
|
+
|
9
|
+
This version of the GNU Lesser General Public License incorporates
|
10
|
+
the terms and conditions of version 3 of the GNU General Public
|
11
|
+
License, supplemented by the additional permissions listed below.
|
12
|
+
|
13
|
+
0. Additional Definitions.
|
14
|
+
|
15
|
+
As used herein, "this License" refers to version 3 of the GNU Lesser
|
16
|
+
General Public License, and the "GNU GPL" refers to version 3 of the GNU
|
17
|
+
General Public License.
|
18
|
+
|
19
|
+
"The Library" refers to a covered work governed by this License,
|
20
|
+
other than an Application or a Combined Work as defined below.
|
21
|
+
|
22
|
+
An "Application" is any work that makes use of an interface provided
|
23
|
+
by the Library, but which is not otherwise based on the Library.
|
24
|
+
Defining a subclass of a class defined by the Library is deemed a mode
|
25
|
+
of using an interface provided by the Library.
|
26
|
+
|
27
|
+
A "Combined Work" is a work produced by combining or linking an
|
28
|
+
Application with the Library. The particular version of the Library
|
29
|
+
with which the Combined Work was made is also called the "Linked
|
30
|
+
Version".
|
31
|
+
|
32
|
+
The "Minimal Corresponding Source" for a Combined Work means the
|
33
|
+
Corresponding Source for the Combined Work, excluding any source code
|
34
|
+
for portions of the Combined Work that, considered in isolation, are
|
35
|
+
based on the Application, and not on the Linked Version.
|
36
|
+
|
37
|
+
The "Corresponding Application Code" for a Combined Work means the
|
38
|
+
object code and/or source code for the Application, including any data
|
39
|
+
and utility programs needed for reproducing the Combined Work from the
|
40
|
+
Application, but excluding the System Libraries of the Combined Work.
|
41
|
+
|
42
|
+
1. Exception to Section 3 of the GNU GPL.
|
43
|
+
|
44
|
+
You may convey a covered work under sections 3 and 4 of this License
|
45
|
+
without being bound by section 3 of the GNU GPL.
|
46
|
+
|
47
|
+
2. Conveying Modified Versions.
|
48
|
+
|
49
|
+
If you modify a copy of the Library, and, in your modifications, a
|
50
|
+
facility refers to a function or data to be supplied by an Application
|
51
|
+
that uses the facility (other than as an argument passed when the
|
52
|
+
facility is invoked), then you may convey a copy of the modified
|
53
|
+
version:
|
54
|
+
|
55
|
+
a) under this License, provided that you make a good faith effort to
|
56
|
+
ensure that, in the event an Application does not supply the
|
57
|
+
function or data, the facility still operates, and performs
|
58
|
+
whatever part of its purpose remains meaningful, or
|
59
|
+
|
60
|
+
b) under the GNU GPL, with none of the additional permissions of
|
61
|
+
this License applicable to that copy.
|
62
|
+
|
63
|
+
3. Object Code Incorporating Material from Library Header Files.
|
64
|
+
|
65
|
+
The object code form of an Application may incorporate material from
|
66
|
+
a header file that is part of the Library. You may convey such object
|
67
|
+
code under terms of your choice, provided that, if the incorporated
|
68
|
+
material is not limited to numerical parameters, data structure
|
69
|
+
layouts and accessors, or small macros, inline functions and templates
|
70
|
+
(ten or fewer lines in length), you do both of the following:
|
71
|
+
|
72
|
+
a) Give prominent notice with each copy of the object code that the
|
73
|
+
Library is used in it and that the Library and its use are
|
74
|
+
covered by this License.
|
75
|
+
|
76
|
+
b) Accompany the object code with a copy of the GNU GPL and this license
|
77
|
+
document.
|
78
|
+
|
79
|
+
4. Combined Works.
|
80
|
+
|
81
|
+
You may convey a Combined Work under terms of your choice that,
|
82
|
+
taken together, effectively do not restrict modification of the
|
83
|
+
portions of the Library contained in the Combined Work and reverse
|
84
|
+
engineering for debugging such modifications, if you also do each of
|
85
|
+
the following:
|
86
|
+
|
87
|
+
a) Give prominent notice with each copy of the Combined Work that
|
88
|
+
the Library is used in it and that the Library and its use are
|
89
|
+
covered by this License.
|
90
|
+
|
91
|
+
b) Accompany the Combined Work with a copy of the GNU GPL and this license
|
92
|
+
document.
|
93
|
+
|
94
|
+
c) For a Combined Work that displays copyright notices during
|
95
|
+
execution, include the copyright notice for the Library among
|
96
|
+
these notices, as well as a reference directing the user to the
|
97
|
+
copies of the GNU GPL and this license document.
|
98
|
+
|
99
|
+
d) Do one of the following:
|
100
|
+
|
101
|
+
0) Convey the Minimal Corresponding Source under the terms of this
|
102
|
+
License, and the Corresponding Application Code in a form
|
103
|
+
suitable for, and under terms that permit, the user to
|
104
|
+
recombine or relink the Application with a modified version of
|
105
|
+
the Linked Version to produce a modified Combined Work, in the
|
106
|
+
manner specified by section 6 of the GNU GPL for conveying
|
107
|
+
Corresponding Source.
|
108
|
+
|
109
|
+
1) Use a suitable shared library mechanism for linking with the
|
110
|
+
Library. A suitable mechanism is one that (a) uses at run time
|
111
|
+
a copy of the Library already present on the user's computer
|
112
|
+
system, and (b) will operate properly with a modified version
|
113
|
+
of the Library that is interface-compatible with the Linked
|
114
|
+
Version.
|
115
|
+
|
116
|
+
e) Provide Installation Information, but only if you would otherwise
|
117
|
+
be required to provide such information under section 6 of the
|
118
|
+
GNU GPL, and only to the extent that such information is
|
119
|
+
necessary to install and execute a modified version of the
|
120
|
+
Combined Work produced by recombining or relinking the
|
121
|
+
Application with a modified version of the Linked Version. (If
|
122
|
+
you use option 4d0, the Installation Information must accompany
|
123
|
+
the Minimal Corresponding Source and Corresponding Application
|
124
|
+
Code. If you use option 4d1, you must provide the Installation
|
125
|
+
Information in the manner specified by section 6 of the GNU GPL
|
126
|
+
for conveying Corresponding Source.)
|
127
|
+
|
128
|
+
5. Combined Libraries.
|
129
|
+
|
130
|
+
You may place library facilities that are a work based on the
|
131
|
+
Library side by side in a single library together with other library
|
132
|
+
facilities that are not Applications and are not covered by this
|
133
|
+
License, and convey such a combined library under terms of your
|
134
|
+
choice, if you do both of the following:
|
135
|
+
|
136
|
+
a) Accompany the combined library with a copy of the same work based
|
137
|
+
on the Library, uncombined with any other library facilities,
|
138
|
+
conveyed under the terms of this License.
|
139
|
+
|
140
|
+
b) Give prominent notice with the combined library that part of it
|
141
|
+
is a work based on the Library, and explaining where to find the
|
142
|
+
accompanying uncombined form of the same work.
|
143
|
+
|
144
|
+
6. Revised Versions of the GNU Lesser General Public License.
|
145
|
+
|
146
|
+
The Free Software Foundation may publish revised and/or new versions
|
147
|
+
of the GNU Lesser General Public License from time to time. Such new
|
148
|
+
versions will be similar in spirit to the present version, but may
|
149
|
+
differ in detail to address new problems or concerns.
|
150
|
+
|
151
|
+
Each version is given a distinguishing version number. If the
|
152
|
+
Library as you received it specifies that a certain numbered version
|
153
|
+
of the GNU Lesser General Public License "or any later version"
|
154
|
+
applies to it, you have the option of following the terms and
|
155
|
+
conditions either of that published version or of any later version
|
156
|
+
published by the Free Software Foundation. If the Library as you
|
157
|
+
received it does not specify a version number of the GNU Lesser
|
158
|
+
General Public License, you may choose any version of the GNU Lesser
|
159
|
+
General Public License ever published by the Free Software Foundation.
|
160
|
+
|
161
|
+
If the Library as you received it specifies that a proxy can decide
|
162
|
+
whether future versions of the GNU Lesser General Public License shall
|
163
|
+
apply, that proxy's public statement of acceptance of any version is
|
164
|
+
permanent authorization for you to choose that version for the
|
165
|
+
Library.
|
data/Makefile
ADDED
@@ -0,0 +1,59 @@
|
|
1
|
+
DESTDIR=
|
2
|
+
|
3
|
+
NAME=libgraphm-ruby
|
4
|
+
GEMNAME=graphm
|
5
|
+
RUBYVERSION=1.8
|
6
|
+
|
7
|
+
BINDIR=$(DESTDIR)/usr/bin
|
8
|
+
MANDIR=$(DESTDIR)/usr/share/man
|
9
|
+
LIBDIR=$(DESTDIR)/usr/lib/ruby/$(RUBYVERSION)
|
10
|
+
DOCDIR=$(DESTDIR)/usr/share/doc/$(NAME)
|
11
|
+
|
12
|
+
RDOC=rdoc$(RUBYVERSION)
|
13
|
+
#RDOC=rdoc1.9
|
14
|
+
all: doc test
|
15
|
+
|
16
|
+
clean:
|
17
|
+
rm -fr doc *.gem
|
18
|
+
|
19
|
+
build:
|
20
|
+
|
21
|
+
.PHONY: doc doc-reader
|
22
|
+
doc-reader: doc
|
23
|
+
xdg-open file://`pwd`/doc/api/index.html
|
24
|
+
|
25
|
+
doc:
|
26
|
+
rm -fr doc/api
|
27
|
+
$(RDOC) \
|
28
|
+
--promiscuous \
|
29
|
+
--inline-source \
|
30
|
+
--line-numbers \
|
31
|
+
-o doc/api lib/
|
32
|
+
# --diagram
|
33
|
+
|
34
|
+
.PHONY: test
|
35
|
+
test:
|
36
|
+
$(MAKE) -C test
|
37
|
+
|
38
|
+
install: doc test
|
39
|
+
# install libraries
|
40
|
+
#
|
41
|
+
find lib -name '*.rb' |while read FILE ; do \
|
42
|
+
FILEPATH=`echo $$FILE |sed -e "s~^lib~$(LIBDIR)~"` ; \
|
43
|
+
install -D -o root -g root -m 644 $$FILE $$FILEPATH ; \
|
44
|
+
done
|
45
|
+
# install binaries
|
46
|
+
find bin -name '*.rb' |while read FILE ; do \
|
47
|
+
FILEPATH=`echo $$FILE |sed -e "s~^bin~$(BINDIR)~"` ; \
|
48
|
+
install -D -o root -g root -m 755 $$FILE $$FILEPATH ; \
|
49
|
+
done
|
50
|
+
# install documentation
|
51
|
+
rm -fr $(DOCDIR)
|
52
|
+
mkdir -p $(DOCDIR)
|
53
|
+
cp -a doc $(DOCDIR)
|
54
|
+
|
55
|
+
gem:
|
56
|
+
gem build $(GEMNAME).gemspec
|
57
|
+
|
58
|
+
gem_install:
|
59
|
+
gem install $(GEMNAME)*.gem
|
data/README
ADDED
File without changes
|
data/graphm.gemspec
ADDED
@@ -0,0 +1,38 @@
|
|
1
|
+
#!/usr/bin/ruby -d
|
2
|
+
|
3
|
+
require 'rake'
|
4
|
+
|
5
|
+
spec = Gem::Specification.new do |s|
|
6
|
+
s.author = 'Glenn Y. Rolland'
|
7
|
+
s.email = 'glenux@glenux.net'
|
8
|
+
s.homepage = 'http://code.google.com/p/libgraphm-ruby/'
|
9
|
+
|
10
|
+
s.signing_key = ENV['GEM_PRIVATE_KEY']
|
11
|
+
s.cert_chain = ENV['GEM_CERTIFICATE_CHAIN']
|
12
|
+
|
13
|
+
s.name = 'graphm'
|
14
|
+
s.version = '0.1'
|
15
|
+
s.summary = 'A simple graph manipulation library'
|
16
|
+
s.description = 'A simple graph manipulation library' \
|
17
|
+
+ "providing search, rendering (to dot format, etc.)"
|
18
|
+
|
19
|
+
s.required_ruby_version = '>= 1.8.1'
|
20
|
+
|
21
|
+
s.require_paths = ['lib']
|
22
|
+
s.files = FileList[
|
23
|
+
"lib/graphm/*.rb",
|
24
|
+
"lib/graphm/render/*.rb",
|
25
|
+
"examples/*.rb",
|
26
|
+
"test/**/*"
|
27
|
+
].to_a + [ \
|
28
|
+
"Makefile",
|
29
|
+
"graphm.gemspec",
|
30
|
+
"COPYING",
|
31
|
+
"README"
|
32
|
+
]
|
33
|
+
s.files.reject! { |fn| fn.include? "coverage" }
|
34
|
+
|
35
|
+
puts "== GEM CONTENT =="
|
36
|
+
puts s.files
|
37
|
+
puts "== /GEM CONTENT =="
|
38
|
+
end
|
data/lib/graphm/edge.rb
ADDED
@@ -0,0 +1,29 @@
|
|
1
|
+
#!/usr/bin/ruby
|
2
|
+
|
3
|
+
module Graphm
|
4
|
+
class Edge
|
5
|
+
attr_reader :src, :dst, :prop
|
6
|
+
|
7
|
+
def initialize src, dst, prop={}
|
8
|
+
@src = src
|
9
|
+
@dst = dst
|
10
|
+
@prop = {}
|
11
|
+
set_prop prop
|
12
|
+
end
|
13
|
+
|
14
|
+
def set_prop prop
|
15
|
+
prop.each do |k,v|
|
16
|
+
@prop[k] = v
|
17
|
+
end
|
18
|
+
end
|
19
|
+
|
20
|
+
def has_prop? key, val=nil
|
21
|
+
res = if @prop.include? key then
|
22
|
+
@prop[key]
|
23
|
+
else
|
24
|
+
false
|
25
|
+
end
|
26
|
+
return res
|
27
|
+
end
|
28
|
+
end
|
29
|
+
end
|
data/lib/graphm/graph.rb
ADDED
@@ -0,0 +1,48 @@
|
|
1
|
+
#!/usr/bin/ruby
|
2
|
+
|
3
|
+
require 'set'
|
4
|
+
require 'graphm/node'
|
5
|
+
|
6
|
+
module Graphm
|
7
|
+
class Graph
|
8
|
+
attr_reader :nodes, :name
|
9
|
+
|
10
|
+
def initialize name=nil, &block
|
11
|
+
@name = name
|
12
|
+
@nodes = {}
|
13
|
+
self.instance_eval(&block) if block_given?
|
14
|
+
end
|
15
|
+
|
16
|
+
def title name
|
17
|
+
@name = name
|
18
|
+
end
|
19
|
+
|
20
|
+
def edge src, dst, prop={}
|
21
|
+
src_node = node src
|
22
|
+
dst_node = node dst
|
23
|
+
|
24
|
+
@nodes[src].edge_to dst_node, prop
|
25
|
+
end
|
26
|
+
|
27
|
+
def node name, prop={}
|
28
|
+
if not @nodes.include? name then
|
29
|
+
@nodes[name] = Node.new name, prop
|
30
|
+
else
|
31
|
+
@nodes[name].set_prop prop
|
32
|
+
end
|
33
|
+
return @nodes[name]
|
34
|
+
end
|
35
|
+
|
36
|
+
def initial name
|
37
|
+
node name, {:initial => true}
|
38
|
+
end
|
39
|
+
|
40
|
+
def final name
|
41
|
+
node name, {:final => true}
|
42
|
+
end
|
43
|
+
|
44
|
+
def render renderer
|
45
|
+
return renderer.render_graph self
|
46
|
+
end
|
47
|
+
end
|
48
|
+
end
|
data/lib/graphm/node.rb
ADDED
@@ -0,0 +1,41 @@
|
|
1
|
+
#!/usr/bin/ruby
|
2
|
+
|
3
|
+
require 'set'
|
4
|
+
require 'graphm/edge'
|
5
|
+
|
6
|
+
module Graphm
|
7
|
+
class Node
|
8
|
+
attr_reader :name
|
9
|
+
attr_reader :prop
|
10
|
+
attr_reader :edges
|
11
|
+
|
12
|
+
def initialize name, prop={}
|
13
|
+
@name = name
|
14
|
+
@edges = Set.new
|
15
|
+
@prop = {}
|
16
|
+
|
17
|
+
set_prop prop
|
18
|
+
end
|
19
|
+
|
20
|
+
def set_prop prop
|
21
|
+
prop.each do |k,v|
|
22
|
+
@prop[k] = v
|
23
|
+
end
|
24
|
+
end
|
25
|
+
|
26
|
+
def edge_to node, prop={}
|
27
|
+
edge = ( Edge.new self, node, prop )
|
28
|
+
@edges << edge
|
29
|
+
return edge
|
30
|
+
end
|
31
|
+
|
32
|
+
def has_prop? key, val=nil
|
33
|
+
res = if @prop.include? key then
|
34
|
+
@prop[key]
|
35
|
+
else
|
36
|
+
false
|
37
|
+
end
|
38
|
+
return res
|
39
|
+
end
|
40
|
+
end
|
41
|
+
end
|
@@ -0,0 +1,48 @@
|
|
1
|
+
#!/usr/bin/ruby
|
2
|
+
|
3
|
+
require 'graphm/graph'
|
4
|
+
require 'graphm/render/generic'
|
5
|
+
|
6
|
+
module Graphm
|
7
|
+
module Render
|
8
|
+
|
9
|
+
class DotRenderer < GenericRenderer
|
10
|
+
def render_graph graph
|
11
|
+
buff = ""
|
12
|
+
|
13
|
+
buff << "digraph graphm {\n"
|
14
|
+
graph.nodes.each do |name,dinode|
|
15
|
+
buff << ( render_node dinode )
|
16
|
+
end
|
17
|
+
|
18
|
+
graph.nodes.each do |name,dinode|
|
19
|
+
dinode.edges.each do |edge|
|
20
|
+
buff << ( render_edge edge )
|
21
|
+
end
|
22
|
+
end
|
23
|
+
buff << "}\n"
|
24
|
+
return buff
|
25
|
+
end
|
26
|
+
|
27
|
+
def render_node node
|
28
|
+
opts = {}
|
29
|
+
opts[:label] = "\"%s\"" % node.prop[:label] if node.prop.include? :label
|
30
|
+
opts[:shape] = 'circle' if node.has_prop? :initial
|
31
|
+
opts[:shape] = 'doublecircle' if node.has_prop? :final
|
32
|
+
opts_str = opts.map{ |k,v| "%s=%s" % [k, v] }.join(',')
|
33
|
+
|
34
|
+
return "\t%s [%s];\n" % [ node.name, opts_str ]
|
35
|
+
end
|
36
|
+
|
37
|
+
def render_edge edge
|
38
|
+
opts = {}
|
39
|
+
opts[:label] = "\"%s\"" % edge.prop[:label] if edge.prop.include? :label
|
40
|
+
opts_str = opts.map{ |k,v| "%s=%s" % [k, v] }.join(',')
|
41
|
+
|
42
|
+
return "\t%s -> %s [%s];\n" % [ edge.src.name, edge.dst.name, opts_str ]
|
43
|
+
end
|
44
|
+
|
45
|
+
end
|
46
|
+
|
47
|
+
end
|
48
|
+
end
|
@@ -0,0 +1,24 @@
|
|
1
|
+
#!/usr/bin/ruby
|
2
|
+
|
3
|
+
module Graphm
|
4
|
+
module Render
|
5
|
+
|
6
|
+
class GenericRenderer
|
7
|
+
def initialize
|
8
|
+
end
|
9
|
+
|
10
|
+
def render_graph graph
|
11
|
+
raise NotImplementedError
|
12
|
+
end
|
13
|
+
|
14
|
+
def render_node node
|
15
|
+
raise NotImplementedError
|
16
|
+
end
|
17
|
+
|
18
|
+
def render_edge edge
|
19
|
+
raise NotImplementedError
|
20
|
+
end
|
21
|
+
end
|
22
|
+
|
23
|
+
end
|
24
|
+
end
|
@@ -0,0 +1,68 @@
|
|
1
|
+
#!/usr/bin/ruby
|
2
|
+
|
3
|
+
require 'graphm/graph'
|
4
|
+
require 'graphm/render/generic'
|
5
|
+
|
6
|
+
module Graphm
|
7
|
+
module Render
|
8
|
+
|
9
|
+
class PathRenderer
|
10
|
+
def initialize
|
11
|
+
@incomplete = []
|
12
|
+
@complete = []
|
13
|
+
end
|
14
|
+
|
15
|
+
def render_graph graph
|
16
|
+
# create a path for each init node
|
17
|
+
ini = graph.nodes.map{ |name,node| node }.reject{ |node| not node.has_prop? :initial }
|
18
|
+
|
19
|
+
ini.each do |node|
|
20
|
+
@incomplete << [ node ]
|
21
|
+
end
|
22
|
+
|
23
|
+
# while there is an incomplete path
|
24
|
+
while not @incomplete.empty? do
|
25
|
+
cur_path = @incomplete.shift
|
26
|
+
|
27
|
+
node = cur_path.last
|
28
|
+
node.edges.each do |edge|
|
29
|
+
next if cur_path.include? edge
|
30
|
+
|
31
|
+
node_path = cur_path + [ edge, edge.dst ]
|
32
|
+
if edge.dst.has_prop? :final then
|
33
|
+
@complete << node_path
|
34
|
+
else
|
35
|
+
@incomplete << node_path
|
36
|
+
end
|
37
|
+
end
|
38
|
+
end
|
39
|
+
|
40
|
+
res = []
|
41
|
+
res = @complete.map do |path|
|
42
|
+
rpath = path.map do |elem|
|
43
|
+
case elem
|
44
|
+
when Node then render_node elem
|
45
|
+
when Edge then render_edge elem
|
46
|
+
end
|
47
|
+
end
|
48
|
+
rpath
|
49
|
+
end
|
50
|
+
return res
|
51
|
+
end
|
52
|
+
|
53
|
+
def render_node node
|
54
|
+
return node.name
|
55
|
+
end
|
56
|
+
|
57
|
+
def render_edge edge
|
58
|
+
res = if edge.has_prop? :label then
|
59
|
+
"[%s]-->" % edge.prop[:label]
|
60
|
+
else
|
61
|
+
"-->"
|
62
|
+
end
|
63
|
+
return res
|
64
|
+
end
|
65
|
+
end
|
66
|
+
|
67
|
+
end
|
68
|
+
end
|
data/test/Makefile
ADDED
@@ -0,0 +1,36 @@
|
|
1
|
+
TESTS=$(wildcard *.rb)
|
2
|
+
|
3
|
+
all: test-unit test-notimplemented
|
4
|
+
|
5
|
+
test-unit-%: %.rb
|
6
|
+
rcov --aggregate coverage/cov.info $< 2>&1 >/dev/null
|
7
|
+
ruby $< || exit 1
|
8
|
+
|
9
|
+
test-unit:
|
10
|
+
#
|
11
|
+
# UNIT TESTING
|
12
|
+
#
|
13
|
+
echo "require 'test/unit'" > coverage.rb
|
14
|
+
echo "\$$LOAD_PATH.insert( 0, '../lib' )" >> coverage.rb
|
15
|
+
find ../lib/ |grep rb$$ |sed -e 's/.rb$$/"/' -e 's|../lib/||' -e 's/^/require "/' >> coverage.rb
|
16
|
+
#
|
17
|
+
rm -fr coverage
|
18
|
+
mkdir -p coverage
|
19
|
+
for test in $(TESTS); do \
|
20
|
+
$(MAKE) test-unit-$${test/.rb/} ; \
|
21
|
+
done
|
22
|
+
#
|
23
|
+
# TESTING MISSING CODE
|
24
|
+
#
|
25
|
+
|
26
|
+
test-notimplemented:
|
27
|
+
TMP=`mktemp` ; \
|
28
|
+
find ../lib -name '*.rb' |xargs grep -n 'NotImplementedError' > $$TMP ; \
|
29
|
+
COUNT=`wc -l < $$TMP` ; \
|
30
|
+
if [ $$COUNT -gt 0 ]; then \
|
31
|
+
cat $$TMP 1>&2 ; \
|
32
|
+
fi
|
33
|
+
|
34
|
+
clean:
|
35
|
+
rm -fr coverage
|
36
|
+
rm -f coverage.rb
|
data/test/template.rb
ADDED
@@ -0,0 +1,31 @@
|
|
1
|
+
|
2
|
+
# create sample system command
|
3
|
+
|
4
|
+
# exec system command
|
5
|
+
|
6
|
+
# verify return code
|
7
|
+
|
8
|
+
# run batch and catch errors
|
9
|
+
|
10
|
+
|
11
|
+
require "test/unit"
|
12
|
+
|
13
|
+
$LOAD_PATH.insert( 0, '../lib' )
|
14
|
+
|
15
|
+
require 'graphm/digraph'
|
16
|
+
|
17
|
+
class TestXyz < Test::Unit::TestCase
|
18
|
+
|
19
|
+
def test_base
|
20
|
+
#assert_nothing_raised( Exception ) do
|
21
|
+
# sc.run
|
22
|
+
#end
|
23
|
+
|
24
|
+
#assert_raise( CommandRuntimeError ) do
|
25
|
+
# sc.run
|
26
|
+
#end
|
27
|
+
|
28
|
+
end
|
29
|
+
|
30
|
+
end
|
31
|
+
|
metadata
ADDED
@@ -0,0 +1,100 @@
|
|
1
|
+
--- !ruby/object:Gem::Specification
|
2
|
+
name: graphm
|
3
|
+
version: !ruby/object:Gem::Version
|
4
|
+
hash: 9
|
5
|
+
prerelease: false
|
6
|
+
segments:
|
7
|
+
- 0
|
8
|
+
- 1
|
9
|
+
version: "0.1"
|
10
|
+
platform: ruby
|
11
|
+
authors:
|
12
|
+
- Glenn Y. Rolland
|
13
|
+
autorequire:
|
14
|
+
bindir: bin
|
15
|
+
cert_chain:
|
16
|
+
- |
|
17
|
+
-----BEGIN CERTIFICATE-----
|
18
|
+
MIIDMDCCAhigAwIBAgIBADANBgkqhkiG9w0BAQUFADA+MQ8wDQYDVQQDDAZnbGVu
|
19
|
+
dXgxFjAUBgoJkiaJk/IsZAEZFgZnbGVudXgxEzARBgoJkiaJk/IsZAEZFgNuZXQw
|
20
|
+
HhcNMTAwODA1MTAwMDQxWhcNMTEwODA1MTAwMDQxWjA+MQ8wDQYDVQQDDAZnbGVu
|
21
|
+
dXgxFjAUBgoJkiaJk/IsZAEZFgZnbGVudXgxEzARBgoJkiaJk/IsZAEZFgNuZXQw
|
22
|
+
ggEiMA0GCSqGSIb3DQEBAQUAA4IBDwAwggEKAoIBAQD01Jf7nrsqLLF2lT/d5K1P
|
23
|
+
t9PxGHrp/gDzopzVHOFUNWnhgUnzBo/1uISQCbVaKMzzM6W/JSDB72Ijnida4uXQ
|
24
|
+
NWu/nKNhUnYMsrbiDVNrZLTXqcxa1Yeh5XwyyNyLDIsQp8YaZIGiJ1CgY6Ex+erv
|
25
|
+
xdA6QYO0qAHwNLGNUsrOziUjZ+Uoi4ETTwLf3XLqfc//P7vdimSeZ/8xlqR7avE+
|
26
|
+
6moADBqhnL12XL1YpvpznN5XdsolOYnXgjcrJXLXWLbkHWWbAbVaKrdWQegms0cA
|
27
|
+
VL3Wd2g7zBS0bJwFzVzfYhq2qybYDouMynHHngniaBPyKoY6Ksu+1Xx5mKwd7Tyd
|
28
|
+
AgMBAAGjOTA3MAkGA1UdEwQCMAAwCwYDVR0PBAQDAgSwMB0GA1UdDgQWBBQH0/mD
|
29
|
+
dOYIOt0x/69bL/mihBAY8jANBgkqhkiG9w0BAQUFAAOCAQEANfqG5FKOe2n+0VVy
|
30
|
+
Vb9Dlo5jFPtFokVGcxrKWy/rgKKZTHe6nUD8PpT5TPAv/fqss42znaDU2c3x0hjY
|
31
|
+
k/f1o+y82A7kvDQ4ln7nhkIcX3d8jv1zIGrn/9XANK5cDE+3WUlUhVunvqb+SVad
|
32
|
+
ijFd6F9aVBhtUcRj6fuJcv5iyxWtfoUqKfn/iiRk3nrhrCr9/gczp5DVY3fWGUVA
|
33
|
+
grXBYDK5aYBKJ2iHqAq1daY9tESVu3o63ciS3xDj1dFH3Uw1nzMBL79/Jk7KXbwZ
|
34
|
+
fZIDGVYLDMJ8LJiNOG8hoFAolZdVL/Sdncmb3HNZVFsuLBj4GgXEXTjCwKYyWpah
|
35
|
+
WpLCnA==
|
36
|
+
-----END CERTIFICATE-----
|
37
|
+
|
38
|
+
date: 2010-08-09 00:00:00 +02:00
|
39
|
+
default_executable:
|
40
|
+
dependencies: []
|
41
|
+
|
42
|
+
description: A simple graph manipulation libraryproviding search, rendering (to dot format, etc.)
|
43
|
+
email: glenux@glenux.net
|
44
|
+
executables: []
|
45
|
+
|
46
|
+
extensions: []
|
47
|
+
|
48
|
+
extra_rdoc_files: []
|
49
|
+
|
50
|
+
files:
|
51
|
+
- lib/graphm/node.rb
|
52
|
+
- lib/graphm/graph.rb
|
53
|
+
- lib/graphm/edge.rb
|
54
|
+
- lib/graphm/render/dot.rb
|
55
|
+
- lib/graphm/render/generic.rb
|
56
|
+
- lib/graphm/render/path.rb
|
57
|
+
- test/template.rb
|
58
|
+
- test/Makefile
|
59
|
+
- Makefile
|
60
|
+
- graphm.gemspec
|
61
|
+
- COPYING
|
62
|
+
- README
|
63
|
+
has_rdoc: true
|
64
|
+
homepage: http://code.google.com/p/libgraphm-ruby/
|
65
|
+
licenses: []
|
66
|
+
|
67
|
+
post_install_message:
|
68
|
+
rdoc_options: []
|
69
|
+
|
70
|
+
require_paths:
|
71
|
+
- lib
|
72
|
+
required_ruby_version: !ruby/object:Gem::Requirement
|
73
|
+
none: false
|
74
|
+
requirements:
|
75
|
+
- - ">="
|
76
|
+
- !ruby/object:Gem::Version
|
77
|
+
hash: 53
|
78
|
+
segments:
|
79
|
+
- 1
|
80
|
+
- 8
|
81
|
+
- 1
|
82
|
+
version: 1.8.1
|
83
|
+
required_rubygems_version: !ruby/object:Gem::Requirement
|
84
|
+
none: false
|
85
|
+
requirements:
|
86
|
+
- - ">="
|
87
|
+
- !ruby/object:Gem::Version
|
88
|
+
hash: 3
|
89
|
+
segments:
|
90
|
+
- 0
|
91
|
+
version: "0"
|
92
|
+
requirements: []
|
93
|
+
|
94
|
+
rubyforge_project:
|
95
|
+
rubygems_version: 1.3.7
|
96
|
+
signing_key:
|
97
|
+
specification_version: 3
|
98
|
+
summary: A simple graph manipulation library
|
99
|
+
test_files: []
|
100
|
+
|
metadata.gz.sig
ADDED
Binary file
|